./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-complex/safestack_relacy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-complex/safestack_relacy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:17:04,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:17:04,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:17:04,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:17:04,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:17:04,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:17:04,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:17:04,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:17:04,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:17:04,534 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:17:04,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:17:04,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:17:04,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:17:04,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:17:04,535 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:17:04,536 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:17:04,536 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:17:04,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:17:04,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:17:04,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:17:04,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:17:04,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:17:04,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:17:04,537 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:17:04,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:17:04,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:17:04,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:17:04,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:17:04,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:17:04,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:17:04,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:17:04,538 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 [2025-03-04 15:17:04,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:17:04,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:17:04,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:17:04,767 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:17:04,767 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:17:04,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-03-04 15:17:05,866 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f7107de/b20100d8c99e4f12bc7163b02658597f/FLAG98069b0f4 [2025-03-04 15:17:06,168 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:17:06,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-03-04 15:17:06,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f7107de/b20100d8c99e4f12bc7163b02658597f/FLAG98069b0f4 [2025-03-04 15:17:06,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f7107de/b20100d8c99e4f12bc7163b02658597f [2025-03-04 15:17:06,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:17:06,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:17:06,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:17:06,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:17:06,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:17:06,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@465b336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06, skipping insertion in model container [2025-03-04 15:17:06,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:17:06,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:17:06,637 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:17:06,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:17:06,746 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:17:06,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06 WrapperNode [2025-03-04 15:17:06,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:17:06,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:17:06,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:17:06,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:17:06,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,782 INFO L138 Inliner]: procedures = 458, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 176 [2025-03-04 15:17:06,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:17:06,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:17:06,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:17:06,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:17:06,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,802 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 5, 30]. 81 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 3, 8]. The 13 writes are split as follows [0, 1, 12]. [2025-03-04 15:17:06,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,809 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:17:06,822 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:17:06,822 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:17:06,822 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:17:06,824 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (1/1) ... [2025-03-04 15:17:06,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:17:06,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:17:06,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:17:06,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:17:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:17:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:17:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:17:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:17:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 15:17:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 15:17:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:17:06,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:17:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:17:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:17:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:17:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:17:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:17:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:17:06,874 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:17:07,097 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:17:07,098 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:17:07,330 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:17:07,333 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:17:07,453 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:17:07,453 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:17:07,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:17:07 BoogieIcfgContainer [2025-03-04 15:17:07,455 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:17:07,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:17:07,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:17:07,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:17:07,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:17:06" (1/3) ... [2025-03-04 15:17:07,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f00fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:17:07, skipping insertion in model container [2025-03-04 15:17:07,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:17:06" (2/3) ... [2025-03-04 15:17:07,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f00fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:17:07, skipping insertion in model container [2025-03-04 15:17:07,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:17:07" (3/3) ... [2025-03-04 15:17:07,464 INFO L128 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2025-03-04 15:17:07,476 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:17:07,478 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safestack_relacy.i that has 2 procedures, 69 locations, 1 initial locations, 7 loop locations, and 12 error locations. [2025-03-04 15:17:07,478 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:17:07,535 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:17:07,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 81 transitions, 169 flow [2025-03-04 15:17:07,603 INFO L124 PetriNetUnfolderBase]: 12/85 cut-off events. [2025-03-04 15:17:07,605 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:17:07,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 85 events. 12/85 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 211 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 46. Up to 3 conditions per place. [2025-03-04 15:17:07,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 81 transitions, 169 flow [2025-03-04 15:17:07,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 80 transitions, 167 flow [2025-03-04 15:17:07,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:17:07,631 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;@5f067fa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:17:07,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 15:17:07,635 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:17:07,636 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-04 15:17:07,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:17:07,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:07,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:17:07,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:07,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash 430103556, now seen corresponding path program 1 times [2025-03-04 15:17:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:07,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880020584] [2025-03-04 15:17:07,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:07,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:17:07,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:17:07,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:07,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880020584] [2025-03-04 15:17:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880020584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:07,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:07,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:17:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132602502] [2025-03-04 15:17:07,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:07,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:17:07,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:08,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:17:08,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:17:08,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 81 [2025-03-04 15:17:08,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 80 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:08,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:08,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 81 [2025-03-04 15:17:08,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:08,192 INFO L124 PetriNetUnfolderBase]: 193/436 cut-off events. [2025-03-04 15:17:08,192 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:17:08,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 436 events. 193/436 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1708 event pairs, 150 based on Foata normal form. 2/340 useless extension candidates. Maximal degree in co-relation 759. Up to 367 conditions per place. [2025-03-04 15:17:08,196 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 44 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-03-04 15:17:08,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 74 transitions, 247 flow [2025-03-04 15:17:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:17:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:17:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2025-03-04 15:17:08,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5596707818930041 [2025-03-04 15:17:08,214 INFO L175 Difference]: Start difference. First operand has 72 places, 80 transitions, 167 flow. Second operand 3 states and 136 transitions. [2025-03-04 15:17:08,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 74 transitions, 247 flow [2025-03-04 15:17:08,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 74 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:17:08,220 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 159 flow [2025-03-04 15:17:08,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2025-03-04 15:17:08,225 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2025-03-04 15:17:08,225 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 159 flow [2025-03-04 15:17:08,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:08,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:08,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:17:08,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:17:08,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:08,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:08,226 INFO L85 PathProgramCache]: Analyzing trace with hash 448308740, now seen corresponding path program 1 times [2025-03-04 15:17:08,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:08,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802492818] [2025-03-04 15:17:08,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:08,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:08,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:17:08,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:17:08,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:08,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:08,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:08,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802492818] [2025-03-04 15:17:08,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802492818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:08,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:17:08,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422472616] [2025-03-04 15:17:08,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:08,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:17:08,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:08,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:17:08,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:17:08,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 81 [2025-03-04 15:17:08,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:08,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:08,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 81 [2025-03-04 15:17:08,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:08,500 INFO L124 PetriNetUnfolderBase]: 193/434 cut-off events. [2025-03-04 15:17:08,500 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:17:08,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 434 events. 193/434 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1701 event pairs, 150 based on Foata normal form. 2/338 useless extension candidates. Maximal degree in co-relation 780. Up to 367 conditions per place. [2025-03-04 15:17:08,503 INFO L140 encePairwiseOnDemand]: 77/81 looper letters, 42 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-04 15:17:08,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 72 transitions, 243 flow [2025-03-04 15:17:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:17:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:17:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-03-04 15:17:08,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5349794238683128 [2025-03-04 15:17:08,506 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 159 flow. Second operand 3 states and 130 transitions. [2025-03-04 15:17:08,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 72 transitions, 243 flow [2025-03-04 15:17:08,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 72 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:17:08,508 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 155 flow [2025-03-04 15:17:08,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2025-03-04 15:17:08,510 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-03-04 15:17:08,510 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 155 flow [2025-03-04 15:17:08,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:08,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:08,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:08,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:17:08,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:08,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:08,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1327981083, now seen corresponding path program 1 times [2025-03-04 15:17:08,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:08,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525188133] [2025-03-04 15:17:08,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:08,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:17:08,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:17:08,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:08,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:08,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:08,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525188133] [2025-03-04 15:17:08,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525188133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:08,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:08,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:17:08,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393931883] [2025-03-04 15:17:08,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:08,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:17:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:08,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:17:08,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:17:08,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 81 [2025-03-04 15:17:08,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:08,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:08,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 81 [2025-03-04 15:17:08,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:08,732 INFO L124 PetriNetUnfolderBase]: 194/450 cut-off events. [2025-03-04 15:17:08,732 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:17:08,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 450 events. 194/450 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1824 event pairs, 150 based on Foata normal form. 2/354 useless extension candidates. Maximal degree in co-relation 780. Up to 377 conditions per place. [2025-03-04 15:17:08,736 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 48 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2025-03-04 15:17:08,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 267 flow [2025-03-04 15:17:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:17:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:17:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2025-03-04 15:17:08,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5761316872427984 [2025-03-04 15:17:08,738 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 155 flow. Second operand 3 states and 140 transitions. [2025-03-04 15:17:08,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 267 flow [2025-03-04 15:17:08,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 76 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:17:08,740 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 172 flow [2025-03-04 15:17:08,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2025-03-04 15:17:08,740 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2025-03-04 15:17:08,741 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 172 flow [2025-03-04 15:17:08,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:08,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:08,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:08,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:17:08,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:08,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:08,742 INFO L85 PathProgramCache]: Analyzing trace with hash -892081895, now seen corresponding path program 1 times [2025-03-04 15:17:08,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031787029] [2025-03-04 15:17:08,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:08,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:08,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:17:08,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:17:08,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:08,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:08,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:08,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031787029] [2025-03-04 15:17:08,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031787029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:08,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:08,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:17:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325880975] [2025-03-04 15:17:08,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:08,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:17:08,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:08,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:17:08,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:17:08,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 81 [2025-03-04 15:17:08,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:08,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:08,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 81 [2025-03-04 15:17:08,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:09,003 INFO L124 PetriNetUnfolderBase]: 194/448 cut-off events. [2025-03-04 15:17:09,003 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:17:09,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 448 events. 194/448 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1824 event pairs, 150 based on Foata normal form. 2/354 useless extension candidates. Maximal degree in co-relation 780. Up to 380 conditions per place. [2025-03-04 15:17:09,007 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 51 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-03-04 15:17:09,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 288 flow [2025-03-04 15:17:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:17:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:17:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2025-03-04 15:17:09,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2025-03-04 15:17:09,009 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 172 flow. Second operand 4 states and 161 transitions. [2025-03-04 15:17:09,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 288 flow [2025-03-04 15:17:09,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 77 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:17:09,011 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 190 flow [2025-03-04 15:17:09,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2025-03-04 15:17:09,012 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2025-03-04 15:17:09,012 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 190 flow [2025-03-04 15:17:09,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:09,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:09,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:09,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:17:09,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:09,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:09,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1247728257, now seen corresponding path program 1 times [2025-03-04 15:17:09,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:09,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209695699] [2025-03-04 15:17:09,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:09,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:09,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:17:09,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:17:09,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:09,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:09,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:09,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209695699] [2025-03-04 15:17:09,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209695699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:09,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:09,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:17:09,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540578264] [2025-03-04 15:17:09,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:09,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:17:09,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:09,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:17:09,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:17:09,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 81 [2025-03-04 15:17:09,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:09,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:09,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 81 [2025-03-04 15:17:09,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:09,226 INFO L124 PetriNetUnfolderBase]: 162/399 cut-off events. [2025-03-04 15:17:09,226 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 15:17:09,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 399 events. 162/399 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1669 event pairs, 77 based on Foata normal form. 28/366 useless extension candidates. Maximal degree in co-relation 706. Up to 202 conditions per place. [2025-03-04 15:17:09,228 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 69 selfloop transitions, 4 changer transitions 4/100 dead transitions. [2025-03-04 15:17:09,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 390 flow [2025-03-04 15:17:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:17:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:17:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-03-04 15:17:09,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6707818930041153 [2025-03-04 15:17:09,231 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 190 flow. Second operand 3 states and 163 transitions. [2025-03-04 15:17:09,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 390 flow [2025-03-04 15:17:09,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:17:09,233 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 171 flow [2025-03-04 15:17:09,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2025-03-04 15:17:09,234 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-03-04 15:17:09,234 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 171 flow [2025-03-04 15:17:09,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:09,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:09,235 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:09,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:17:09,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:09,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:09,235 INFO L85 PathProgramCache]: Analyzing trace with hash -659856379, now seen corresponding path program 1 times [2025-03-04 15:17:09,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:09,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999910897] [2025-03-04 15:17:09,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:09,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:09,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:17:09,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:17:09,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:09,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:09,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:09,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999910897] [2025-03-04 15:17:09,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999910897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:17:09,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024699105] [2025-03-04 15:17:09,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:09,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:17:09,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:17:09,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:17:09,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:17:09,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:17:09,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:17:09,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:09,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:09,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:17:09,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:17:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:09,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:17:09,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024699105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:09,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:17:09,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 15:17:09,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318316461] [2025-03-04 15:17:09,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:09,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:17:09,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:09,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:17:09,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:17:09,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 81 [2025-03-04 15:17:09,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:09,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:09,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 81 [2025-03-04 15:17:09,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:09,649 INFO L124 PetriNetUnfolderBase]: 132/314 cut-off events. [2025-03-04 15:17:09,649 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 15:17:09,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 314 events. 132/314 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1147 event pairs, 100 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 611. Up to 257 conditions per place. [2025-03-04 15:17:09,651 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 42 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-03-04 15:17:09,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 261 flow [2025-03-04 15:17:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:17:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:17:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-03-04 15:17:09,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2025-03-04 15:17:09,652 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 171 flow. Second operand 4 states and 148 transitions. [2025-03-04 15:17:09,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 261 flow [2025-03-04 15:17:09,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:17:09,655 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 173 flow [2025-03-04 15:17:09,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2025-03-04 15:17:09,655 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2025-03-04 15:17:09,656 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 173 flow [2025-03-04 15:17:09,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:09,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:09,656 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:09,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:17:09,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 15:17:09,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:09,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1019289109, now seen corresponding path program 1 times [2025-03-04 15:17:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:09,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374476763] [2025-03-04 15:17:09,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:09,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:17:09,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:17:09,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:09,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:09,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:09,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374476763] [2025-03-04 15:17:09,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374476763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:17:09,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179291988] [2025-03-04 15:17:09,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:09,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:17:09,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:17:09,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:17:09,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:17:10,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:17:10,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:17:10,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:10,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:10,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:17:10,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:17:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:10,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:17:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:10,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179291988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:17:10,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:17:10,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:17:10,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491074710] [2025-03-04 15:17:10,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:17:10,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:17:10,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:10,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:17:10,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:17:10,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 81 [2025-03-04 15:17:10,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 173 flow. Second operand has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:10,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:10,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 81 [2025-03-04 15:17:10,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:10,337 INFO L124 PetriNetUnfolderBase]: 134/338 cut-off events. [2025-03-04 15:17:10,337 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-04 15:17:10,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 338 events. 134/338 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1269 event pairs, 100 based on Foata normal form. 3/310 useless extension candidates. Maximal degree in co-relation 587. Up to 262 conditions per place. [2025-03-04 15:17:10,338 INFO L140 encePairwiseOnDemand]: 74/81 looper letters, 51 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2025-03-04 15:17:10,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 337 flow [2025-03-04 15:17:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:17:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:17:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 239 transitions. [2025-03-04 15:17:10,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42151675485008816 [2025-03-04 15:17:10,340 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 173 flow. Second operand 7 states and 239 transitions. [2025-03-04 15:17:10,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 337 flow [2025-03-04 15:17:10,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 76 transitions, 315 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:17:10,342 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 226 flow [2025-03-04 15:17:10,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2025-03-04 15:17:10,343 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 1 predicate places. [2025-03-04 15:17:10,343 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 226 flow [2025-03-04 15:17:10,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:10,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:10,343 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:10,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:17:10,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 15:17:10,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:10,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:10,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1869845548, now seen corresponding path program 1 times [2025-03-04 15:17:10,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:10,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231061331] [2025-03-04 15:17:10,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:10,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:10,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:17:10,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:17:10,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:10,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:10,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:10,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231061331] [2025-03-04 15:17:10,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231061331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:10,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:10,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:17:10,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013113358] [2025-03-04 15:17:10,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:10,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:17:10,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:10,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:17:10,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:17:10,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 81 [2025-03-04 15:17:10,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:10,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:10,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 81 [2025-03-04 15:17:10,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:10,756 INFO L124 PetriNetUnfolderBase]: 133/333 cut-off events. [2025-03-04 15:17:10,757 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-04 15:17:10,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 333 events. 133/333 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1228 event pairs, 100 based on Foata normal form. 1/307 useless extension candidates. Maximal degree in co-relation 638. Up to 255 conditions per place. [2025-03-04 15:17:10,758 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 43 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2025-03-04 15:17:10,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 69 transitions, 317 flow [2025-03-04 15:17:10,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:17:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:17:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2025-03-04 15:17:10,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44135802469135804 [2025-03-04 15:17:10,759 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 226 flow. Second operand 4 states and 143 transitions. [2025-03-04 15:17:10,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 69 transitions, 317 flow [2025-03-04 15:17:10,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 69 transitions, 301 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 15:17:10,761 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 217 flow [2025-03-04 15:17:10,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-03-04 15:17:10,762 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2025-03-04 15:17:10,762 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 217 flow [2025-03-04 15:17:10,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:10,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:10,762 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:10,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:17:10,763 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:10,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash -508184170, now seen corresponding path program 1 times [2025-03-04 15:17:10,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:10,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681940004] [2025-03-04 15:17:10,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:10,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:17:10,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:17:10,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:10,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:10,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:10,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681940004] [2025-03-04 15:17:10,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681940004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:17:10,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408782932] [2025-03-04 15:17:10,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:10,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:17:10,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:17:10,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:17:10,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:17:10,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:17:10,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:17:10,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:10,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:10,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:17:10,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:17:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:11,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:17:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408782932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:17:11,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:17:11,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 15:17:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581078948] [2025-03-04 15:17:11,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:17:11,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:17:11,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:11,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:17:11,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:17:11,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 81 [2025-03-04 15:17:11,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 217 flow. Second operand has 11 states, 11 states have (on average 22.363636363636363) internal successors, (246), 11 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:11,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:11,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 81 [2025-03-04 15:17:11,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:11,316 INFO L124 PetriNetUnfolderBase]: 132/328 cut-off events. [2025-03-04 15:17:11,316 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-04 15:17:11,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 328 events. 132/328 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1107 event pairs, 100 based on Foata normal form. 1/302 useless extension candidates. Maximal degree in co-relation 631. Up to 254 conditions per place. [2025-03-04 15:17:11,318 INFO L140 encePairwiseOnDemand]: 74/81 looper letters, 47 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2025-03-04 15:17:11,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 71 transitions, 328 flow [2025-03-04 15:17:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:17:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:17:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2025-03-04 15:17:11,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.345679012345679 [2025-03-04 15:17:11,319 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 217 flow. Second operand 7 states and 196 transitions. [2025-03-04 15:17:11,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 71 transitions, 328 flow [2025-03-04 15:17:11,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 71 transitions, 318 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:17:11,322 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 231 flow [2025-03-04 15:17:11,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2025-03-04 15:17:11,322 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 8 predicate places. [2025-03-04 15:17:11,323 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 231 flow [2025-03-04 15:17:11,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.363636363636363) internal successors, (246), 11 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:11,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:11,324 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 15:17:11,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:17:11,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:17:11,525 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:11,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 759774240, now seen corresponding path program 1 times [2025-03-04 15:17:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433081006] [2025-03-04 15:17:11,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:11,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:17:11,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:17:11,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:11,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 15:17:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433081006] [2025-03-04 15:17:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433081006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:11,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:11,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:17:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559393518] [2025-03-04 15:17:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:11,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:17:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:11,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:17:11,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:17:11,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 81 [2025-03-04 15:17:11,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:11,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:11,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 81 [2025-03-04 15:17:11,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:11,695 INFO L124 PetriNetUnfolderBase]: 132/327 cut-off events. [2025-03-04 15:17:11,695 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-03-04 15:17:11,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 327 events. 132/327 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1102 event pairs, 100 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 641. Up to 263 conditions per place. [2025-03-04 15:17:11,697 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 43 selfloop transitions, 9 changer transitions 0/68 dead transitions. [2025-03-04 15:17:11,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 68 transitions, 333 flow [2025-03-04 15:17:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:17:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:17:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-03-04 15:17:11,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2025-03-04 15:17:11,698 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 231 flow. Second operand 4 states and 147 transitions. [2025-03-04 15:17:11,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 68 transitions, 333 flow [2025-03-04 15:17:11,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 68 transitions, 320 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:17:11,701 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 242 flow [2025-03-04 15:17:11,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2025-03-04 15:17:11,702 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2025-03-04 15:17:11,702 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 242 flow [2025-03-04 15:17:11,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:11,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:11,702 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 15:17:11,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:17:11,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1791202645, now seen corresponding path program 2 times [2025-03-04 15:17:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:11,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290009296] [2025-03-04 15:17:11,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:17:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:11,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 15:17:11,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 36 statements. [2025-03-04 15:17:11,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:17:11,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 15:17:11,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290009296] [2025-03-04 15:17:11,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290009296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:11,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:11,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:17:11,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544242531] [2025-03-04 15:17:11,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:11,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:17:11,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:11,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:17:11,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:17:11,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 81 [2025-03-04 15:17:11,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:11,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:11,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 81 [2025-03-04 15:17:11,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:11,852 INFO L124 PetriNetUnfolderBase]: 132/326 cut-off events. [2025-03-04 15:17:11,852 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-04 15:17:11,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 326 events. 132/326 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1094 event pairs, 100 based on Foata normal form. 1/300 useless extension candidates. Maximal degree in co-relation 651. Up to 254 conditions per place. [2025-03-04 15:17:11,854 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 46 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2025-03-04 15:17:11,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 69 transitions, 350 flow [2025-03-04 15:17:11,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:17:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:17:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-03-04 15:17:11,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4012345679012346 [2025-03-04 15:17:11,855 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 242 flow. Second operand 4 states and 130 transitions. [2025-03-04 15:17:11,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 69 transitions, 350 flow [2025-03-04 15:17:11,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 69 transitions, 330 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:17:11,857 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 247 flow [2025-03-04 15:17:11,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2025-03-04 15:17:11,858 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 4 predicate places. [2025-03-04 15:17:11,858 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 247 flow [2025-03-04 15:17:11,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:11,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:11,858 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:11,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:17:11,858 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:11,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1653208212, now seen corresponding path program 2 times [2025-03-04 15:17:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:11,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150884771] [2025-03-04 15:17:11,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:17:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:11,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 15:17:11,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:17:11,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:17:11,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:17:11,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:17:11,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 15:17:11,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:17:11,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:11,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:17:11,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:17:11,943 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:17:11,944 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 15:17:11,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-04 15:17:11,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-04 15:17:11,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-04 15:17:11,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-04 15:17:11,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-04 15:17:11,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-04 15:17:11,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-04 15:17:11,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-04 15:17:11,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-04 15:17:11,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-04 15:17:11,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-04 15:17:11,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-04 15:17:11,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:17:11,947 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:11,949 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:17:11,949 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:17:11,981 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:17:11,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 120 transitions, 256 flow [2025-03-04 15:17:11,993 INFO L124 PetriNetUnfolderBase]: 23/147 cut-off events. [2025-03-04 15:17:11,993 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:17:11,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 147 events. 23/147 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 479 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2025-03-04 15:17:11,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 120 transitions, 256 flow [2025-03-04 15:17:11,995 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 120 transitions, 256 flow [2025-03-04 15:17:11,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:17:11,997 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;@5f067fa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:17:11,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 15:17:11,997 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:17:11,997 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-04 15:17:11,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:17:11,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:11,997 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:17:11,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash 544620156, now seen corresponding path program 1 times [2025-03-04 15:17:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304721035] [2025-03-04 15:17:11,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:12,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:17:12,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:17:12,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:12,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304721035] [2025-03-04 15:17:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304721035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:12,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:17:12,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560709969] [2025-03-04 15:17:12,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:12,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:17:12,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:12,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:17:12,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:17:12,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 120 [2025-03-04 15:17:12,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 120 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:12,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:12,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 120 [2025-03-04 15:17:12,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:13,051 INFO L124 PetriNetUnfolderBase]: 11368/17474 cut-off events. [2025-03-04 15:17:13,051 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-03-04 15:17:13,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34059 conditions, 17474 events. 11368/17474 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 106342 event pairs, 9489 based on Foata normal form. 2/14153 useless extension candidates. Maximal degree in co-relation 26942. Up to 16439 conditions per place. [2025-03-04 15:17:13,127 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 76 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-03-04 15:17:13,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 111 transitions, 394 flow [2025-03-04 15:17:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:17:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:17:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2025-03-04 15:17:13,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-03-04 15:17:13,128 INFO L175 Difference]: Start difference. First operand has 103 places, 120 transitions, 256 flow. Second operand 3 states and 186 transitions. [2025-03-04 15:17:13,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 111 transitions, 394 flow [2025-03-04 15:17:13,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 111 transitions, 394 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:17:13,130 INFO L231 Difference]: Finished difference. Result has 103 places, 111 transitions, 242 flow [2025-03-04 15:17:13,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=103, PETRI_TRANSITIONS=111} [2025-03-04 15:17:13,131 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 0 predicate places. [2025-03-04 15:17:13,131 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 111 transitions, 242 flow [2025-03-04 15:17:13,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:13,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:13,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:17:13,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:17:13,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:13,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash -296643836, now seen corresponding path program 1 times [2025-03-04 15:17:13,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:13,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132752573] [2025-03-04 15:17:13,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:13,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:13,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:17:13,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:17:13,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:13,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132752573] [2025-03-04 15:17:13,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132752573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:13,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:13,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:17:13,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356227845] [2025-03-04 15:17:13,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:13,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:17:13,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:13,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:17:13,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:17:13,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 120 [2025-03-04 15:17:13,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 111 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:13,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:13,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 120 [2025-03-04 15:17:13,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:14,255 INFO L124 PetriNetUnfolderBase]: 11368/17472 cut-off events. [2025-03-04 15:17:14,255 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-03-04 15:17:14,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34058 conditions, 17472 events. 11368/17472 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 106417 event pairs, 9489 based on Foata normal form. 2/14151 useless extension candidates. Maximal degree in co-relation 34022. Up to 16439 conditions per place. [2025-03-04 15:17:14,312 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 74 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-03-04 15:17:14,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 390 flow [2025-03-04 15:17:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:17:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:17:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-03-04 15:17:14,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2025-03-04 15:17:14,313 INFO L175 Difference]: Start difference. First operand has 103 places, 111 transitions, 242 flow. Second operand 3 states and 177 transitions. [2025-03-04 15:17:14,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 390 flow [2025-03-04 15:17:14,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:17:14,315 INFO L231 Difference]: Finished difference. Result has 101 places, 109 transitions, 238 flow [2025-03-04 15:17:14,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=101, PETRI_TRANSITIONS=109} [2025-03-04 15:17:14,315 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -2 predicate places. [2025-03-04 15:17:14,315 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 109 transitions, 238 flow [2025-03-04 15:17:14,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:14,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:14,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:14,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:17:14,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:14,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1606869477, now seen corresponding path program 1 times [2025-03-04 15:17:14,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:14,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707721453] [2025-03-04 15:17:14,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:14,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:14,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:17:14,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:17:14,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:14,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:14,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:14,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707721453] [2025-03-04 15:17:14,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707721453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:14,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:14,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:17:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404397615] [2025-03-04 15:17:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:14,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:17:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:14,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:17:14,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:17:14,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 120 [2025-03-04 15:17:14,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 109 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:14,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:14,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 120 [2025-03-04 15:17:14,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:15,186 INFO L124 PetriNetUnfolderBase]: 11369/17488 cut-off events. [2025-03-04 15:17:15,186 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-03-04 15:17:15,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34082 conditions, 17488 events. 11369/17488 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 106548 event pairs, 9489 based on Foata normal form. 2/14167 useless extension candidates. Maximal degree in co-relation 34022. Up to 16449 conditions per place. [2025-03-04 15:17:15,256 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 80 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2025-03-04 15:17:15,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 113 transitions, 414 flow [2025-03-04 15:17:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:17:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:17:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-03-04 15:17:15,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-03-04 15:17:15,257 INFO L175 Difference]: Start difference. First operand has 101 places, 109 transitions, 238 flow. Second operand 3 states and 187 transitions. [2025-03-04 15:17:15,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 113 transitions, 414 flow [2025-03-04 15:17:15,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 113 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:17:15,259 INFO L231 Difference]: Finished difference. Result has 102 places, 111 transitions, 255 flow [2025-03-04 15:17:15,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=102, PETRI_TRANSITIONS=111} [2025-03-04 15:17:15,260 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -1 predicate places. [2025-03-04 15:17:15,260 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 111 transitions, 255 flow [2025-03-04 15:17:15,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:15,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:15,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:15,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:17:15,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:15,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:15,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2065693927, now seen corresponding path program 1 times [2025-03-04 15:17:15,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:15,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634464030] [2025-03-04 15:17:15,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:15,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:15,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:17:15,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:17:15,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:15,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:15,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:15,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634464030] [2025-03-04 15:17:15,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634464030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:15,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:15,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:17:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235138475] [2025-03-04 15:17:15,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:15,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:17:15,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:15,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:17:15,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:17:15,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 120 [2025-03-04 15:17:15,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 111 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:15,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:15,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 120 [2025-03-04 15:17:15,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:16,290 INFO L124 PetriNetUnfolderBase]: 11369/17486 cut-off events. [2025-03-04 15:17:16,291 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2025-03-04 15:17:16,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34091 conditions, 17486 events. 11369/17486 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 106574 event pairs, 9489 based on Foata normal form. 2/14167 useless extension candidates. Maximal degree in co-relation 34022. Up to 16452 conditions per place. [2025-03-04 15:17:16,353 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 83 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-03-04 15:17:16,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 114 transitions, 435 flow [2025-03-04 15:17:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:17:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:17:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2025-03-04 15:17:16,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44375 [2025-03-04 15:17:16,354 INFO L175 Difference]: Start difference. First operand has 102 places, 111 transitions, 255 flow. Second operand 4 states and 213 transitions. [2025-03-04 15:17:16,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 114 transitions, 435 flow [2025-03-04 15:17:16,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 114 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:17:16,356 INFO L231 Difference]: Finished difference. Result has 106 places, 112 transitions, 273 flow [2025-03-04 15:17:16,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=106, PETRI_TRANSITIONS=112} [2025-03-04 15:17:16,357 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 3 predicate places. [2025-03-04 15:17:16,357 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 273 flow [2025-03-04 15:17:16,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:16,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:16,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:16,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:17:16,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:16,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:16,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1005137884, now seen corresponding path program 1 times [2025-03-04 15:17:16,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:16,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327512864] [2025-03-04 15:17:16,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:16,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:16,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:17:16,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:17:16,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:16,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:16,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:16,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327512864] [2025-03-04 15:17:16,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327512864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:16,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:16,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:17:16,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172505310] [2025-03-04 15:17:16,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:16,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:17:16,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:16,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:17:16,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:17:16,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 120 [2025-03-04 15:17:16,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:16,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:16,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 120 [2025-03-04 15:17:16,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:17,302 INFO L124 PetriNetUnfolderBase]: 13068/20170 cut-off events. [2025-03-04 15:17:17,302 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-03-04 15:17:17,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39105 conditions, 20170 events. 13068/20170 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 132363 event pairs, 5470 based on Foata normal form. 83/16666 useless extension candidates. Maximal degree in co-relation 39059. Up to 13739 conditions per place. [2025-03-04 15:17:17,386 INFO L140 encePairwiseOnDemand]: 111/120 looper letters, 141 selfloop transitions, 5 changer transitions 1/177 dead transitions. [2025-03-04 15:17:17,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 177 transitions, 703 flow [2025-03-04 15:17:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:17:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:17:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-03-04 15:17:17,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-03-04 15:17:17,387 INFO L175 Difference]: Start difference. First operand has 106 places, 112 transitions, 273 flow. Second operand 3 states and 250 transitions. [2025-03-04 15:17:17,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 177 transitions, 703 flow [2025-03-04 15:17:17,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 177 transitions, 697 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:17:17,390 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 296 flow [2025-03-04 15:17:17,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=107, PETRI_TRANSITIONS=113} [2025-03-04 15:17:17,391 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 4 predicate places. [2025-03-04 15:17:17,391 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 296 flow [2025-03-04 15:17:17,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:17,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:17,391 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:17,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:17:17,391 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:17,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:17,392 INFO L85 PathProgramCache]: Analyzing trace with hash -353178499, now seen corresponding path program 1 times [2025-03-04 15:17:17,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:17,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125456275] [2025-03-04 15:17:17,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:17,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:17,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:17:17,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:17:17,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:17,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:17,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125456275] [2025-03-04 15:17:17,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125456275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:17:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157774136] [2025-03-04 15:17:17,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:17,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:17:17,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:17:17,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:17:17,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:17:17,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:17:17,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:17:17,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:17,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:17:17,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:17:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:17,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:17:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157774136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:17:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 15:17:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51306092] [2025-03-04 15:17:17,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:17,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:17:17,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:17,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:17:17,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:17:17,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 120 [2025-03-04 15:17:17,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 113 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:17,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:17,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 120 [2025-03-04 15:17:17,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:18,217 INFO L124 PetriNetUnfolderBase]: 9728/15043 cut-off events. [2025-03-04 15:17:18,218 INFO L125 PetriNetUnfolderBase]: For 3347/4797 co-relation queries the response was YES. [2025-03-04 15:17:18,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31133 conditions, 15043 events. 9728/15043 cut-off events. For 3347/4797 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 90836 event pairs, 8129 based on Foata normal form. 2/13547 useless extension candidates. Maximal degree in co-relation 31084. Up to 14184 conditions per place. [2025-03-04 15:17:18,294 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 78 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2025-03-04 15:17:18,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 111 transitions, 458 flow [2025-03-04 15:17:18,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:17:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:17:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-03-04 15:17:18,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42291666666666666 [2025-03-04 15:17:18,298 INFO L175 Difference]: Start difference. First operand has 107 places, 113 transitions, 296 flow. Second operand 4 states and 203 transitions. [2025-03-04 15:17:18,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 111 transitions, 458 flow [2025-03-04 15:17:18,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 111 transitions, 453 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:17:18,404 INFO L231 Difference]: Finished difference. Result has 107 places, 111 transitions, 297 flow [2025-03-04 15:17:18,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=107, PETRI_TRANSITIONS=111} [2025-03-04 15:17:18,405 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 4 predicate places. [2025-03-04 15:17:18,405 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 111 transitions, 297 flow [2025-03-04 15:17:18,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:18,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:18,405 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:18,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:17:18,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:17:18,606 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:18,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:18,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1936368917, now seen corresponding path program 1 times [2025-03-04 15:17:18,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:18,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322217647] [2025-03-04 15:17:18,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:18,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:17:18,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:17:18,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:18,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:18,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:18,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:18,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322217647] [2025-03-04 15:17:18,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322217647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:17:18,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307544479] [2025-03-04 15:17:18,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:18,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:17:18,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:17:18,677 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:17:18,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:17:18,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:17:18,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:17:18,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:18,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:18,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:17:18,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:17:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:18,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:17:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:18,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307544479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:17:18,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:17:18,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:17:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809391192] [2025-03-04 15:17:18,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:17:18,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:17:18,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:18,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:17:18,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:17:18,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 120 [2025-03-04 15:17:18,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 111 transitions, 297 flow. Second operand has 10 states, 10 states have (on average 32.0) internal successors, (320), 10 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:18,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:18,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 120 [2025-03-04 15:17:18,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:19,809 INFO L124 PetriNetUnfolderBase]: 9730/15067 cut-off events. [2025-03-04 15:17:19,809 INFO L125 PetriNetUnfolderBase]: For 1857/3307 co-relation queries the response was YES. [2025-03-04 15:17:19,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31102 conditions, 15067 events. 9730/15067 cut-off events. For 1857/3307 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 91087 event pairs, 8129 based on Foata normal form. 3/13570 useless extension candidates. Maximal degree in co-relation 31006. Up to 14189 conditions per place. [2025-03-04 15:17:19,902 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 87 selfloop transitions, 10 changer transitions 0/123 dead transitions. [2025-03-04 15:17:19,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 123 transitions, 535 flow [2025-03-04 15:17:19,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:17:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:17:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 309 transitions. [2025-03-04 15:17:19,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3678571428571429 [2025-03-04 15:17:19,903 INFO L175 Difference]: Start difference. First operand has 107 places, 111 transitions, 297 flow. Second operand 7 states and 309 transitions. [2025-03-04 15:17:19,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 123 transitions, 535 flow [2025-03-04 15:17:19,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 123 transitions, 513 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:17:19,907 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 352 flow [2025-03-04 15:17:19,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=114, PETRI_TRANSITIONS=116} [2025-03-04 15:17:19,908 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 11 predicate places. [2025-03-04 15:17:19,908 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 352 flow [2025-03-04 15:17:19,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.0) internal successors, (320), 10 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:19,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:19,908 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:19,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:17:20,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:17:20,109 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:20,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:20,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1764799303, now seen corresponding path program 1 times [2025-03-04 15:17:20,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:20,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213595582] [2025-03-04 15:17:20,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:20,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:20,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:17:20,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:17:20,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:20,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:20,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:20,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213595582] [2025-03-04 15:17:20,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213595582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:20,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:20,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:17:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045999279] [2025-03-04 15:17:20,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:20,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:17:20,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:20,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:17:20,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:17:20,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 120 [2025-03-04 15:17:20,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:20,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:20,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 120 [2025-03-04 15:17:20,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:21,327 INFO L124 PetriNetUnfolderBase]: 11400/17711 cut-off events. [2025-03-04 15:17:21,327 INFO L125 PetriNetUnfolderBase]: For 2437/2437 co-relation queries the response was YES. [2025-03-04 15:17:21,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36717 conditions, 17711 events. 11400/17711 cut-off events. For 2437/2437 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 116076 event pairs, 4689 based on Foata normal form. 733/15914 useless extension candidates. Maximal degree in co-relation 36648. Up to 11284 conditions per place. [2025-03-04 15:17:21,418 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 195 selfloop transitions, 8 changer transitions 2/235 dead transitions. [2025-03-04 15:17:21,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 235 transitions, 1002 flow [2025-03-04 15:17:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:17:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:17:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2025-03-04 15:17:21,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6958333333333333 [2025-03-04 15:17:21,419 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 352 flow. Second operand 4 states and 334 transitions. [2025-03-04 15:17:21,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 235 transitions, 1002 flow [2025-03-04 15:17:21,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 235 transitions, 987 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 15:17:21,423 INFO L231 Difference]: Finished difference. Result has 113 places, 114 transitions, 345 flow [2025-03-04 15:17:21,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=113, PETRI_TRANSITIONS=114} [2025-03-04 15:17:21,423 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 10 predicate places. [2025-03-04 15:17:21,423 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 114 transitions, 345 flow [2025-03-04 15:17:21,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:21,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:21,424 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:21,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:17:21,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:21,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1125796979, now seen corresponding path program 1 times [2025-03-04 15:17:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:21,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160875873] [2025-03-04 15:17:21,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:21,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:21,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:17:21,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:17:21,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:21,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:21,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:21,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160875873] [2025-03-04 15:17:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160875873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:21,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:21,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:17:21,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45858901] [2025-03-04 15:17:21,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:21,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:17:21,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:21,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:17:21,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:17:21,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 120 [2025-03-04 15:17:21,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 114 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:21,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:21,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 120 [2025-03-04 15:17:21,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:22,096 INFO L124 PetriNetUnfolderBase]: 9812/15136 cut-off events. [2025-03-04 15:17:22,096 INFO L125 PetriNetUnfolderBase]: For 1400/1400 co-relation queries the response was YES. [2025-03-04 15:17:22,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32302 conditions, 15136 events. 9812/15136 cut-off events. For 1400/1400 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 89640 event pairs, 6571 based on Foata normal form. 1/13651 useless extension candidates. Maximal degree in co-relation 32233. Up to 11622 conditions per place. [2025-03-04 15:17:22,196 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 131 selfloop transitions, 10 changer transitions 1/172 dead transitions. [2025-03-04 15:17:22,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 172 transitions, 741 flow [2025-03-04 15:17:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:17:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:17:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2025-03-04 15:17:22,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-03-04 15:17:22,218 INFO L175 Difference]: Start difference. First operand has 113 places, 114 transitions, 345 flow. Second operand 3 states and 237 transitions. [2025-03-04 15:17:22,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 172 transitions, 741 flow [2025-03-04 15:17:22,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 172 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:17:22,235 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 358 flow [2025-03-04 15:17:22,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-03-04 15:17:22,236 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 9 predicate places. [2025-03-04 15:17:22,236 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 358 flow [2025-03-04 15:17:22,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:22,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:22,237 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:22,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:17:22,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:22,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:22,238 INFO L85 PathProgramCache]: Analyzing trace with hash -440843185, now seen corresponding path program 1 times [2025-03-04 15:17:22,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:22,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524876390] [2025-03-04 15:17:22,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:22,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:22,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:17:22,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:17:22,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:22,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:22,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:22,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524876390] [2025-03-04 15:17:22,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524876390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:22,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:22,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:17:22,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196291223] [2025-03-04 15:17:22,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:22,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:17:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:22,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:17:22,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:17:22,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 120 [2025-03-04 15:17:22,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:22,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:22,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 120 [2025-03-04 15:17:22,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:23,221 INFO L124 PetriNetUnfolderBase]: 9594/14800 cut-off events. [2025-03-04 15:17:23,222 INFO L125 PetriNetUnfolderBase]: For 10926/10926 co-relation queries the response was YES. [2025-03-04 15:17:23,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35193 conditions, 14800 events. 9594/14800 cut-off events. For 10926/10926 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 88569 event pairs, 8012 based on Foata normal form. 1/13324 useless extension candidates. Maximal degree in co-relation 35150. Up to 13926 conditions per place. [2025-03-04 15:17:23,300 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 80 selfloop transitions, 6 changer transitions 0/113 dead transitions. [2025-03-04 15:17:23,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 520 flow [2025-03-04 15:17:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:17:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:17:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2025-03-04 15:17:23,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41041666666666665 [2025-03-04 15:17:23,301 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 358 flow. Second operand 4 states and 197 transitions. [2025-03-04 15:17:23,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 520 flow [2025-03-04 15:17:23,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 509 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:17:23,306 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 351 flow [2025-03-04 15:17:23,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-03-04 15:17:23,307 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 12 predicate places. [2025-03-04 15:17:23,307 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 351 flow [2025-03-04 15:17:23,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:23,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:23,307 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 15:17:23,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:17:23,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:23,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1309293464, now seen corresponding path program 1 times [2025-03-04 15:17:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:23,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973846286] [2025-03-04 15:17:23,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:23,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:23,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:17:23,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:17:23,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:23,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 15:17:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:23,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973846286] [2025-03-04 15:17:23,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973846286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:23,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:23,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:17:23,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914915476] [2025-03-04 15:17:23,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:23,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:17:23,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:23,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:17:23,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:17:23,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 120 [2025-03-04 15:17:23,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 351 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-03-04 15:17:23,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:23,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 120 [2025-03-04 15:17:23,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:24,026 INFO L124 PetriNetUnfolderBase]: 9594/14799 cut-off events. [2025-03-04 15:17:24,026 INFO L125 PetriNetUnfolderBase]: For 8581/8581 co-relation queries the response was YES. [2025-03-04 15:17:24,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33650 conditions, 14799 events. 9594/14799 cut-off events. For 8581/8581 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 88338 event pairs, 8012 based on Foata normal form. 1/13323 useless extension candidates. Maximal degree in co-relation 33602. Up to 13936 conditions per place. [2025-03-04 15:17:24,103 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 81 selfloop transitions, 9 changer transitions 0/112 dead transitions. [2025-03-04 15:17:24,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 112 transitions, 529 flow [2025-03-04 15:17:24,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:17:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:17:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2025-03-04 15:17:24,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41875 [2025-03-04 15:17:24,104 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 351 flow. Second operand 4 states and 201 transitions. [2025-03-04 15:17:24,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 112 transitions, 529 flow [2025-03-04 15:17:24,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 513 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:17:24,109 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 359 flow [2025-03-04 15:17:24,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=359, PETRI_PLACES=113, PETRI_TRANSITIONS=112} [2025-03-04 15:17:24,109 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 10 predicate places. [2025-03-04 15:17:24,109 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 359 flow [2025-03-04 15:17:24,109 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-03-04 15:17:24,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:24,110 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:24,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:17:24,110 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:24,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1816176045, now seen corresponding path program 1 times [2025-03-04 15:17:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:24,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674800509] [2025-03-04 15:17:24,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:24,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:24,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:17:24,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:17:24,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:24,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:24,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:24,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674800509] [2025-03-04 15:17:24,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674800509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:17:24,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186116203] [2025-03-04 15:17:24,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:24,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:17:24,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:17:24,183 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:17:24,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:17:24,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:17:24,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:17:24,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:24,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:24,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:17:24,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:17:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:24,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:17:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:24,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186116203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:17:24,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:17:24,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 15:17:24,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096758863] [2025-03-04 15:17:24,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:17:24,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:17:24,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:24,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:17:24,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:17:24,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 120 [2025-03-04 15:17:24,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 112 transitions, 359 flow. Second operand has 11 states, 11 states have (on average 27.454545454545453) internal successors, (302), 11 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:24,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:24,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 120 [2025-03-04 15:17:24,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:25,259 INFO L124 PetriNetUnfolderBase]: 9593/14794 cut-off events. [2025-03-04 15:17:25,259 INFO L125 PetriNetUnfolderBase]: For 8584/8584 co-relation queries the response was YES. [2025-03-04 15:17:25,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33645 conditions, 14794 events. 9593/14794 cut-off events. For 8584/8584 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 88176 event pairs, 8012 based on Foata normal form. 1/13318 useless extension candidates. Maximal degree in co-relation 33593. Up to 13925 conditions per place. [2025-03-04 15:17:25,331 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 83 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2025-03-04 15:17:25,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 541 flow [2025-03-04 15:17:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:17:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:17:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 264 transitions. [2025-03-04 15:17:25,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2025-03-04 15:17:25,332 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 359 flow. Second operand 7 states and 264 transitions. [2025-03-04 15:17:25,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 541 flow [2025-03-04 15:17:25,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 115 transitions, 527 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 15:17:25,336 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 368 flow [2025-03-04 15:17:25,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2025-03-04 15:17:25,337 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 16 predicate places. [2025-03-04 15:17:25,337 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 368 flow [2025-03-04 15:17:25,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.454545454545453) internal successors, (302), 11 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:25,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:25,337 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 15:17:25,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:17:25,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:17:25,538 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:25,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1184701611, now seen corresponding path program 2 times [2025-03-04 15:17:25,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:25,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742211988] [2025-03-04 15:17:25,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:17:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:25,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 15:17:25,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 36 statements. [2025-03-04 15:17:25,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:17:25,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 15:17:25,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:25,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742211988] [2025-03-04 15:17:25,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742211988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:25,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:25,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:17:25,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748238281] [2025-03-04 15:17:25,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:25,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:17:25,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:25,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:17:25,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:17:25,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 120 [2025-03-04 15:17:25,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:25,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:25,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 120 [2025-03-04 15:17:25,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:17:26,344 INFO L124 PetriNetUnfolderBase]: 9593/14793 cut-off events. [2025-03-04 15:17:26,344 INFO L125 PetriNetUnfolderBase]: For 8614/8614 co-relation queries the response was YES. [2025-03-04 15:17:26,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33662 conditions, 14793 events. 9593/14793 cut-off events. For 8614/8614 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 88230 event pairs, 8012 based on Foata normal form. 1/13317 useless extension candidates. Maximal degree in co-relation 33608. Up to 13925 conditions per place. [2025-03-04 15:17:26,430 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 83 selfloop transitions, 9 changer transitions 0/113 dead transitions. [2025-03-04 15:17:26,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 113 transitions, 550 flow [2025-03-04 15:17:26,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:17:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:17:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2025-03-04 15:17:26,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2025-03-04 15:17:26,431 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 368 flow. Second operand 4 states and 184 transitions. [2025-03-04 15:17:26,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 113 transitions, 550 flow [2025-03-04 15:17:26,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 113 transitions, 535 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:17:26,435 INFO L231 Difference]: Finished difference. Result has 116 places, 112 transitions, 378 flow [2025-03-04 15:17:26,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=378, PETRI_PLACES=116, PETRI_TRANSITIONS=112} [2025-03-04 15:17:26,435 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 13 predicate places. [2025-03-04 15:17:26,435 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 112 transitions, 378 flow [2025-03-04 15:17:26,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:26,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:26,435 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:26,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 15:17:26,436 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:26,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash -730993137, now seen corresponding path program 2 times [2025-03-04 15:17:26,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:26,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529149377] [2025-03-04 15:17:26,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:17:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:26,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-04 15:17:26,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:17:26,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:17:26,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:17:26,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:17:26,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 15:17:26,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 15:17:26,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:26,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:17:26,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:17:26,466 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:17:26,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 15:17:26,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-04 15:17:26,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-04 15:17:26,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-04 15:17:26,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-04 15:17:26,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-04 15:17:26,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-04 15:17:26,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-04 15:17:26,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-04 15:17:26,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-04 15:17:26,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-04 15:17:26,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-04 15:17:26,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-04 15:17:26,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:17:26,467 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:17:26,467 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:17:26,467 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:17:26,495 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:17:26,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 159 transitions, 345 flow [2025-03-04 15:17:26,506 INFO L124 PetriNetUnfolderBase]: 37/228 cut-off events. [2025-03-04 15:17:26,506 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:17:26,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 228 events. 37/228 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 876 event pairs, 1 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 155. Up to 12 conditions per place. [2025-03-04 15:17:26,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 159 transitions, 345 flow [2025-03-04 15:17:26,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 159 transitions, 345 flow [2025-03-04 15:17:26,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:17:26,509 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;@5f067fa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:17:26,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 15:17:26,510 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:17:26,510 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-04 15:17:26,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:17:26,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:17:26,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:17:26,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:17:26,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:17:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash 696354651, now seen corresponding path program 1 times [2025-03-04 15:17:26,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:17:26,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482317169] [2025-03-04 15:17:26,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:17:26,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:17:26,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:17:26,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:17:26,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:17:26,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:17:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:17:26,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:17:26,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482317169] [2025-03-04 15:17:26,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482317169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:17:26,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:17:26,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:17:26,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957222032] [2025-03-04 15:17:26,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:17:26,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:17:26,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:17:26,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:17:26,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:17:26,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 159 [2025-03-04 15:17:26,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 159 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:17:26,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:17:26,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 159 [2025-03-04 15:17:26,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand