./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eaba04057472de7e0abee59642faf365bd5be09903096cb87fd907eb76891380 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:01:17,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:01:17,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:01:17,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:01:17,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:01:18,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:01:18,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:01:18,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:01:18,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:01:18,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:01:18,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:01:18,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:01:18,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:01:18,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:01:18,004 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:01:18,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:01:18,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:01:18,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:01:18,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:01:18,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:01:18,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:01:18,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:01:18,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:01:18,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:01:18,004 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:01:18,004 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:01:18,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:01:18,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:01:18,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:01:18,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:01:18,005 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 -> eaba04057472de7e0abee59642faf365bd5be09903096cb87fd907eb76891380 [2025-04-29 11:01:18,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:01:18,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:01:18,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:01:18,244 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:01:18,245 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:01:18,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c [2025-04-29 11:01:19,519 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca941f63/3a4ca547e42c40878790c4017a2fa8f1/FLAGfcde3943e [2025-04-29 11:01:19,721 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:01:19,721 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c [2025-04-29 11:01:19,722 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:01:19,723 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:01:19,727 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca941f63/3a4ca547e42c40878790c4017a2fa8f1/FLAGfcde3943e [2025-04-29 11:01:20,521 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca941f63/3a4ca547e42c40878790c4017a2fa8f1 [2025-04-29 11:01:20,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:01:20,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:01:20,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:01:20,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:01:20,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:01:20,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de7fb1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20, skipping insertion in model container [2025-04-29 11:01:20,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:01:20,712 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:01:20,721 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:01:20,755 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:01:20,769 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:01:20,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20 WrapperNode [2025-04-29 11:01:20,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:01:20,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:01:20,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:01:20,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:01:20,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,802 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 112 [2025-04-29 11:01:20,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:01:20,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:01:20,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:01:20,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:01:20,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,836 INFO L175 MemorySlicer]: Split 12 memory accesses to 1 slices as follows [12]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 3 writes are split as follows [3]. [2025-04-29 11:01:20,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,841 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:01:20,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:01:20,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:01:20,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:01:20,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (1/1) ... [2025-04-29 11:01:20,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:01:20,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:20,879 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-04-29 11:01:20,881 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-04-29 11:01:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:01:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:01:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:01:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:01:20,895 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:01:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:01:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:01:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:01:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-29 11:01:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-29 11:01:20,897 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:01:20,965 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:01:20,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:01:21,124 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:01:21,124 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:01:21,215 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:01:21,215 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 11:01:21,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:01:21 BoogieIcfgContainer [2025-04-29 11:01:21,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:01:21,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:01:21,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:01:21,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:01:21,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:01:20" (1/3) ... [2025-04-29 11:01:21,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6a0786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:01:21, skipping insertion in model container [2025-04-29 11:01:21,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:20" (2/3) ... [2025-04-29 11:01:21,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6a0786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:01:21, skipping insertion in model container [2025-04-29 11:01:21,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:01:21" (3/3) ... [2025-04-29 11:01:21,222 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.c [2025-04-29 11:01:21,231 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:01:21,231 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.c that has 2 procedures, 36 locations, 40 edges, 1 initial locations, 3 loop locations, and 6 error locations. [2025-04-29 11:01:21,232 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:01:21,267 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:01:21,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 41 transitions, 86 flow [2025-04-29 11:01:21,314 INFO L116 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-04-29 11:01:21,315 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:21,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 40 events. 6/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-04-29 11:01:21,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 41 transitions, 86 flow [2025-04-29 11:01:21,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 40 transitions, 83 flow [2025-04-29 11:01:21,330 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:01:21,339 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@4a817c0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:01:21,339 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:01:21,344 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:01:21,344 INFO L116 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-04-29 11:01:21,344 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:21,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:21,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:21,345 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:21,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:21,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1459533045, now seen corresponding path program 1 times [2025-04-29 11:01:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:21,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666493216] [2025-04-29 11:01:21,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:21,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:21,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:01:21,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:01:21,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:21,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:21,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:21,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666493216] [2025-04-29 11:01:21,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666493216] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:21,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:21,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:21,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918122945] [2025-04-29 11:01:21,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:21,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:21,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:21,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:21,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:21,732 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-29 11:01:21,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 40 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-04-29 11:01:21,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:21,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-29 11:01:21,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:21,997 INFO L116 PetriNetUnfolderBase]: 363/738 cut-off events. [2025-04-29 11:01:21,997 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:22,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 738 events. 363/738 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3605 event pairs, 35 based on Foata normal form. 64/658 useless extension candidates. Maximal degree in co-relation 1367. Up to 352 conditions per place. [2025-04-29 11:01:22,005 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 72 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2025-04-29 11:01:22,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 93 transitions, 351 flow [2025-04-29 11:01:22,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-04-29 11:01:22,018 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7032520325203252 [2025-04-29 11:01:22,019 INFO L175 Difference]: Start difference. First operand has 38 places, 40 transitions, 83 flow. Second operand 6 states and 173 transitions. [2025-04-29 11:01:22,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 93 transitions, 351 flow [2025-04-29 11:01:22,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 93 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:01:22,026 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 148 flow [2025-04-29 11:01:22,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2025-04-29 11:01:22,031 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2025-04-29 11:01:22,031 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 148 flow [2025-04-29 11:01:22,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-04-29 11:01:22,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:22,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:22,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:01:22,032 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:22,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1843070487, now seen corresponding path program 1 times [2025-04-29 11:01:22,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:22,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438717663] [2025-04-29 11:01:22,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:22,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:22,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:01:22,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:01:22,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:22,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:22,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:22,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438717663] [2025-04-29 11:01:22,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438717663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:22,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:22,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:01:22,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690468569] [2025-04-29 11:01:22,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:22,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:22,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:22,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:22,165 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-04-29 11:01:22,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-04-29 11:01:22,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:22,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-04-29 11:01:22,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:22,336 INFO L116 PetriNetUnfolderBase]: 298/648 cut-off events. [2025-04-29 11:01:22,336 INFO L117 PetriNetUnfolderBase]: For 135/139 co-relation queries the response was YES. [2025-04-29 11:01:22,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 648 events. 298/648 cut-off events. For 135/139 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3158 event pairs, 26 based on Foata normal form. 22/593 useless extension candidates. Maximal degree in co-relation 1386. Up to 378 conditions per place. [2025-04-29 11:01:22,340 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 66 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2025-04-29 11:01:22,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 90 transitions, 389 flow [2025-04-29 11:01:22,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2025-04-29 11:01:22,343 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6707317073170732 [2025-04-29 11:01:22,343 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 148 flow. Second operand 6 states and 165 transitions. [2025-04-29 11:01:22,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 90 transitions, 389 flow [2025-04-29 11:01:22,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 389 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:01:22,347 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 192 flow [2025-04-29 11:01:22,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-04-29 11:01:22,348 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-04-29 11:01:22,348 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 192 flow [2025-04-29 11:01:22,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-04-29 11:01:22,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:22,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:22,349 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:01:22,349 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:22,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:22,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1121816469, now seen corresponding path program 1 times [2025-04-29 11:01:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:22,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199558334] [2025-04-29 11:01:22,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:22,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:22,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:01:22,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:01:22,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:22,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:22,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:22,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199558334] [2025-04-29 11:01:22,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199558334] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:22,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:22,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:01:22,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160789414] [2025-04-29 11:01:22,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:22,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:22,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:22,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:22,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:22,440 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-04-29 11:01:22,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-04-29 11:01:22,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:22,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-04-29 11:01:22,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:22,658 INFO L116 PetriNetUnfolderBase]: 467/992 cut-off events. [2025-04-29 11:01:22,658 INFO L117 PetriNetUnfolderBase]: For 570/585 co-relation queries the response was YES. [2025-04-29 11:01:22,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 992 events. 467/992 cut-off events. For 570/585 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5325 event pairs, 95 based on Foata normal form. 32/945 useless extension candidates. Maximal degree in co-relation 2372. Up to 491 conditions per place. [2025-04-29 11:01:22,663 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 93 selfloop transitions, 20 changer transitions 0/124 dead transitions. [2025-04-29 11:01:22,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 124 transitions, 745 flow [2025-04-29 11:01:22,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2025-04-29 11:01:22,665 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6300813008130082 [2025-04-29 11:01:22,665 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 192 flow. Second operand 6 states and 155 transitions. [2025-04-29 11:01:22,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 124 transitions, 745 flow [2025-04-29 11:01:22,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 124 transitions, 719 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-29 11:01:22,672 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 351 flow [2025-04-29 11:01:22,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=61, PETRI_TRANSITIONS=65} [2025-04-29 11:01:22,673 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2025-04-29 11:01:22,673 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 351 flow [2025-04-29 11:01:22,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-04-29 11:01:22,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:22,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:22,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:01:22,674 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:22,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash 416572551, now seen corresponding path program 1 times [2025-04-29 11:01:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:22,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768954996] [2025-04-29 11:01:22,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:22,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:22,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:01:22,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:01:22,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:22,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:22,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:22,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768954996] [2025-04-29 11:01:22,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768954996] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:22,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:22,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996713935] [2025-04-29 11:01:22,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:22,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:01:22,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:22,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:01:22,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:01:22,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-04-29 11:01:22,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 65 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-04-29 11:01:22,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:22,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-04-29 11:01:22,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:22,903 INFO L116 PetriNetUnfolderBase]: 335/756 cut-off events. [2025-04-29 11:01:22,903 INFO L117 PetriNetUnfolderBase]: For 749/791 co-relation queries the response was YES. [2025-04-29 11:01:22,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 756 events. 335/756 cut-off events. For 749/791 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3713 event pairs, 111 based on Foata normal form. 35/765 useless extension candidates. Maximal degree in co-relation 2099. Up to 454 conditions per place. [2025-04-29 11:01:22,908 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 57 selfloop transitions, 11 changer transitions 3/86 dead transitions. [2025-04-29 11:01:22,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 555 flow [2025-04-29 11:01:22,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:01:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:01:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-04-29 11:01:22,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-04-29 11:01:22,909 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 351 flow. Second operand 5 states and 130 transitions. [2025-04-29 11:01:22,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 555 flow [2025-04-29 11:01:22,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 533 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-29 11:01:22,914 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 365 flow [2025-04-29 11:01:22,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2025-04-29 11:01:22,915 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2025-04-29 11:01:22,915 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 365 flow [2025-04-29 11:01:22,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-04-29 11:01:22,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:22,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:22,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:01:22,918 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:22,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:22,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1633576134, now seen corresponding path program 1 times [2025-04-29 11:01:22,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:22,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142174339] [2025-04-29 11:01:22,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:22,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:22,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:01:22,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:01:22,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:22,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:22,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:22,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142174339] [2025-04-29 11:01:22,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142174339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:22,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:22,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:22,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088291206] [2025-04-29 11:01:22,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:22,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:01:22,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:22,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:01:22,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:01:22,964 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-29 11:01:22,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 365 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:22,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:22,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-29 11:01:22,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:23,090 INFO L116 PetriNetUnfolderBase]: 398/863 cut-off events. [2025-04-29 11:01:23,090 INFO L117 PetriNetUnfolderBase]: For 1309/1391 co-relation queries the response was YES. [2025-04-29 11:01:23,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2553 conditions, 863 events. 398/863 cut-off events. For 1309/1391 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4455 event pairs, 35 based on Foata normal form. 80/911 useless extension candidates. Maximal degree in co-relation 2527. Up to 559 conditions per place. [2025-04-29 11:01:23,095 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 84 selfloop transitions, 3 changer transitions 1/101 dead transitions. [2025-04-29 11:01:23,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 717 flow [2025-04-29 11:01:23,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:01:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:01:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-04-29 11:01:23,096 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.676829268292683 [2025-04-29 11:01:23,096 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 365 flow. Second operand 4 states and 111 transitions. [2025-04-29 11:01:23,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 717 flow [2025-04-29 11:01:23,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 101 transitions, 715 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-29 11:01:23,100 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 383 flow [2025-04-29 11:01:23,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=383, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2025-04-29 11:01:23,102 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2025-04-29 11:01:23,102 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 383 flow [2025-04-29 11:01:23,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:23,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:23,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:23,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:01:23,102 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:23,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:23,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1920282476, now seen corresponding path program 1 times [2025-04-29 11:01:23,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:23,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573907534] [2025-04-29 11:01:23,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:23,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:23,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:01:23,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:01:23,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:23,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:23,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:23,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573907534] [2025-04-29 11:01:23,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573907534] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:23,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:23,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:01:23,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717129539] [2025-04-29 11:01:23,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:23,312 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:23,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:23,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:23,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:23,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-04-29 11:01:23,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 383 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-04-29 11:01:23,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:23,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-04-29 11:01:23,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:23,458 INFO L116 PetriNetUnfolderBase]: 367/867 cut-off events. [2025-04-29 11:01:23,458 INFO L117 PetriNetUnfolderBase]: For 1177/1198 co-relation queries the response was YES. [2025-04-29 11:01:23,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 867 events. 367/867 cut-off events. For 1177/1198 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4680 event pairs, 177 based on Foata normal form. 7/869 useless extension candidates. Maximal degree in co-relation 2569. Up to 609 conditions per place. [2025-04-29 11:01:23,464 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 57 selfloop transitions, 7 changer transitions 0/78 dead transitions. [2025-04-29 11:01:23,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 78 transitions, 572 flow [2025-04-29 11:01:23,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:01:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:01:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-04-29 11:01:23,465 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5707317073170731 [2025-04-29 11:01:23,465 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 383 flow. Second operand 5 states and 117 transitions. [2025-04-29 11:01:23,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 78 transitions, 572 flow [2025-04-29 11:01:23,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 78 transitions, 559 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-29 11:01:23,469 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 400 flow [2025-04-29 11:01:23,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=400, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2025-04-29 11:01:23,470 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 35 predicate places. [2025-04-29 11:01:23,470 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 400 flow [2025-04-29 11:01:23,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-04-29 11:01:23,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:23,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:23,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:01:23,471 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:23,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1162754578, now seen corresponding path program 2 times [2025-04-29 11:01:23,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:23,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985654630] [2025-04-29 11:01:23,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:23,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:23,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:01:23,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:01:23,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:01:23,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:23,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:23,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985654630] [2025-04-29 11:01:23,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985654630] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:23,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:23,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:01:23,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865817041] [2025-04-29 11:01:23,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:23,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:01:23,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:23,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:01:23,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:01:23,705 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-04-29 11:01:23,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 400 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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-04-29 11:01:23,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:23,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-04-29 11:01:23,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:23,928 INFO L116 PetriNetUnfolderBase]: 446/988 cut-off events. [2025-04-29 11:01:23,928 INFO L117 PetriNetUnfolderBase]: For 1775/1799 co-relation queries the response was YES. [2025-04-29 11:01:23,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3155 conditions, 988 events. 446/988 cut-off events. For 1775/1799 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5313 event pairs, 214 based on Foata normal form. 16/997 useless extension candidates. Maximal degree in co-relation 3124. Up to 731 conditions per place. [2025-04-29 11:01:23,932 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 71 selfloop transitions, 14 changer transitions 1/98 dead transitions. [2025-04-29 11:01:23,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 98 transitions, 773 flow [2025-04-29 11:01:23,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:01:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:01:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2025-04-29 11:01:23,934 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4742547425474255 [2025-04-29 11:01:23,934 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 400 flow. Second operand 9 states and 175 transitions. [2025-04-29 11:01:23,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 98 transitions, 773 flow [2025-04-29 11:01:23,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 98 transitions, 743 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-29 11:01:23,940 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 520 flow [2025-04-29 11:01:23,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=520, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2025-04-29 11:01:23,942 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 45 predicate places. [2025-04-29 11:01:23,942 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 520 flow [2025-04-29 11:01:23,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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-04-29 11:01:23,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:23,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:23,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:01:23,942 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:23,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:23,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1316981712, now seen corresponding path program 3 times [2025-04-29 11:01:23,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:23,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442086690] [2025-04-29 11:01:23,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:01:23,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:23,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:01:23,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:01:23,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:01:23,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:24,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:24,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442086690] [2025-04-29 11:01:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442086690] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:24,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:24,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:01:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745125313] [2025-04-29 11:01:24,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:24,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:01:24,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:24,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:01:24,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:01:24,122 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-04-29 11:01:24,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 520 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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-04-29 11:01:24,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:24,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-04-29 11:01:24,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:24,332 INFO L116 PetriNetUnfolderBase]: 440/988 cut-off events. [2025-04-29 11:01:24,332 INFO L117 PetriNetUnfolderBase]: For 2265/2279 co-relation queries the response was YES. [2025-04-29 11:01:24,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 988 events. 440/988 cut-off events. For 2265/2279 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4972 event pairs, 175 based on Foata normal form. 16/1000 useless extension candidates. Maximal degree in co-relation 3295. Up to 711 conditions per place. [2025-04-29 11:01:24,338 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 74 selfloop transitions, 22 changer transitions 1/109 dead transitions. [2025-04-29 11:01:24,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 109 transitions, 930 flow [2025-04-29 11:01:24,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:01:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:01:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2025-04-29 11:01:24,339 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2025-04-29 11:01:24,339 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 520 flow. Second operand 9 states and 180 transitions. [2025-04-29 11:01:24,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 109 transitions, 930 flow [2025-04-29 11:01:24,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 109 transitions, 905 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-29 11:01:24,349 INFO L231 Difference]: Finished difference. Result has 92 places, 81 transitions, 662 flow [2025-04-29 11:01:24,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=662, PETRI_PLACES=92, PETRI_TRANSITIONS=81} [2025-04-29 11:01:24,351 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2025-04-29 11:01:24,351 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 81 transitions, 662 flow [2025-04-29 11:01:24,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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-04-29 11:01:24,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:24,351 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:24,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:01:24,351 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:24,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1118246455, now seen corresponding path program 1 times [2025-04-29 11:01:24,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:24,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958258028] [2025-04-29 11:01:24,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:24,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:24,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:01:24,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:01:24,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:24,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:24,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:24,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958258028] [2025-04-29 11:01:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958258028] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:24,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066633381] [2025-04-29 11:01:24,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:24,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:24,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:24,543 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-04-29 11:01:24,545 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-04-29 11:01:24,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:01:24,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:01:24,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:24,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:24,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:01:24,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:24,629 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:01:24,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-04-29 11:01:24,797 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:01:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:24,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:01:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:24,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066633381] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:01:24,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:01:24,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2025-04-29 11:01:24,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842586599] [2025-04-29 11:01:24,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:01:24,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:01:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:24,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:01:24,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:01:25,009 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-04-29 11:01:25,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 81 transitions, 662 flow. Second operand has 20 states, 20 states have (on average 14.5) internal successors, (290), 20 states have internal predecessors, (290), 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-04-29 11:01:25,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:25,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-04-29 11:01:25,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:25,916 INFO L116 PetriNetUnfolderBase]: 1408/2957 cut-off events. [2025-04-29 11:01:25,916 INFO L117 PetriNetUnfolderBase]: For 7057/7271 co-relation queries the response was YES. [2025-04-29 11:01:25,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9821 conditions, 2957 events. 1408/2957 cut-off events. For 7057/7271 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 17540 event pairs, 106 based on Foata normal form. 198/3137 useless extension candidates. Maximal degree in co-relation 9780. Up to 576 conditions per place. [2025-04-29 11:01:25,937 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 328 selfloop transitions, 97 changer transitions 0/439 dead transitions. [2025-04-29 11:01:25,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 439 transitions, 3711 flow [2025-04-29 11:01:25,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:01:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:01:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 521 transitions. [2025-04-29 11:01:25,941 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6051103368176539 [2025-04-29 11:01:25,941 INFO L175 Difference]: Start difference. First operand has 92 places, 81 transitions, 662 flow. Second operand 21 states and 521 transitions. [2025-04-29 11:01:25,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 439 transitions, 3711 flow [2025-04-29 11:01:25,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 439 transitions, 3601 flow, removed 38 selfloop flow, removed 4 redundant places. [2025-04-29 11:01:25,959 INFO L231 Difference]: Finished difference. Result has 115 places, 170 transitions, 1643 flow [2025-04-29 11:01:25,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1643, PETRI_PLACES=115, PETRI_TRANSITIONS=170} [2025-04-29 11:01:25,960 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2025-04-29 11:01:25,961 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 170 transitions, 1643 flow [2025-04-29 11:01:25,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.5) internal successors, (290), 20 states have internal predecessors, (290), 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-04-29 11:01:25,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:25,961 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:25,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:01:26,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:26,166 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:26,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2121354536, now seen corresponding path program 1 times [2025-04-29 11:01:26,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:26,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718697918] [2025-04-29 11:01:26,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:26,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:26,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:01:26,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:01:26,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:26,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:26,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-04-29 11:01:26,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:26,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718697918] [2025-04-29 11:01:26,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718697918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:26,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:26,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:01:26,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224194832] [2025-04-29 11:01:26,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:26,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:01:26,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:26,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:01:26,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:01:26,331 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-04-29 11:01:26,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 170 transitions, 1643 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:26,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:26,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-04-29 11:01:26,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:26,940 INFO L116 PetriNetUnfolderBase]: 1716/3622 cut-off events. [2025-04-29 11:01:26,940 INFO L117 PetriNetUnfolderBase]: For 10750/10871 co-relation queries the response was YES. [2025-04-29 11:01:26,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13306 conditions, 3622 events. 1716/3622 cut-off events. For 10750/10871 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 22612 event pairs, 626 based on Foata normal form. 102/3701 useless extension candidates. Maximal degree in co-relation 13258. Up to 2245 conditions per place. [2025-04-29 11:01:26,964 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 223 selfloop transitions, 64 changer transitions 0/300 dead transitions. [2025-04-29 11:01:26,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 300 transitions, 3143 flow [2025-04-29 11:01:26,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:01:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:01:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 249 transitions. [2025-04-29 11:01:26,966 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5060975609756098 [2025-04-29 11:01:26,966 INFO L175 Difference]: Start difference. First operand has 115 places, 170 transitions, 1643 flow. Second operand 12 states and 249 transitions. [2025-04-29 11:01:26,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 300 transitions, 3143 flow [2025-04-29 11:01:26,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 300 transitions, 2830 flow, removed 134 selfloop flow, removed 6 redundant places. [2025-04-29 11:01:26,998 INFO L231 Difference]: Finished difference. Result has 127 places, 203 transitions, 2048 flow [2025-04-29 11:01:26,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2048, PETRI_PLACES=127, PETRI_TRANSITIONS=203} [2025-04-29 11:01:26,999 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 89 predicate places. [2025-04-29 11:01:26,999 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 203 transitions, 2048 flow [2025-04-29 11:01:26,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:26,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:26,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:26,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:01:26,999 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:26,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1995487348, now seen corresponding path program 2 times [2025-04-29 11:01:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:27,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046400095] [2025-04-29 11:01:27,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:27,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:01:27,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:01:27,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:01:27,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:27,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:27,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046400095] [2025-04-29 11:01:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046400095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:27,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:27,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:01:27,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087015731] [2025-04-29 11:01:27,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:27,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:01:27,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:27,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:01:27,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:01:27,162 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-04-29 11:01:27,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 203 transitions, 2048 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:27,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:27,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-04-29 11:01:27,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:27,743 INFO L116 PetriNetUnfolderBase]: 1908/4078 cut-off events. [2025-04-29 11:01:27,744 INFO L117 PetriNetUnfolderBase]: For 15616/15760 co-relation queries the response was YES. [2025-04-29 11:01:27,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15160 conditions, 4078 events. 1908/4078 cut-off events. For 15616/15760 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 26497 event pairs, 685 based on Foata normal form. 141/4195 useless extension candidates. Maximal degree in co-relation 15107. Up to 2581 conditions per place. [2025-04-29 11:01:27,812 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 250 selfloop transitions, 68 changer transitions 0/331 dead transitions. [2025-04-29 11:01:27,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 331 transitions, 3511 flow [2025-04-29 11:01:27,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:01:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:01:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 275 transitions. [2025-04-29 11:01:27,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47909407665505227 [2025-04-29 11:01:27,815 INFO L175 Difference]: Start difference. First operand has 127 places, 203 transitions, 2048 flow. Second operand 14 states and 275 transitions. [2025-04-29 11:01:27,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 331 transitions, 3511 flow [2025-04-29 11:01:27,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 331 transitions, 3480 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-04-29 11:01:27,851 INFO L231 Difference]: Finished difference. Result has 146 places, 233 transitions, 2629 flow [2025-04-29 11:01:27,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2629, PETRI_PLACES=146, PETRI_TRANSITIONS=233} [2025-04-29 11:01:27,852 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 108 predicate places. [2025-04-29 11:01:27,852 INFO L485 AbstractCegarLoop]: Abstraction has has 146 places, 233 transitions, 2629 flow [2025-04-29 11:01:27,852 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:27,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:27,852 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:27,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:01:27,852 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:27,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:27,853 INFO L85 PathProgramCache]: Analyzing trace with hash 640009338, now seen corresponding path program 3 times [2025-04-29 11:01:27,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:27,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567044575] [2025-04-29 11:01:27,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:01:27,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:27,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:01:27,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:01:27,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:01:27,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:27,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:27,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567044575] [2025-04-29 11:01:27,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567044575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:27,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:27,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:01:27,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464761142] [2025-04-29 11:01:27,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:27,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:01:27,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:27,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:01:27,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:01:28,000 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-04-29 11:01:28,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 233 transitions, 2629 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:28,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:28,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-04-29 11:01:28,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:29,080 INFO L116 PetriNetUnfolderBase]: 3048/6485 cut-off events. [2025-04-29 11:01:29,080 INFO L117 PetriNetUnfolderBase]: For 36541/36811 co-relation queries the response was YES. [2025-04-29 11:01:29,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25172 conditions, 6485 events. 3048/6485 cut-off events. For 36541/36811 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 46357 event pairs, 492 based on Foata normal form. 382/6833 useless extension candidates. Maximal degree in co-relation 25111. Up to 2341 conditions per place. [2025-04-29 11:01:29,124 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 312 selfloop transitions, 247 changer transitions 3/575 dead transitions. [2025-04-29 11:01:29,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 575 transitions, 6240 flow [2025-04-29 11:01:29,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:01:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-29 11:01:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 465 transitions. [2025-04-29 11:01:29,126 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5155210643015521 [2025-04-29 11:01:29,126 INFO L175 Difference]: Start difference. First operand has 146 places, 233 transitions, 2629 flow. Second operand 22 states and 465 transitions. [2025-04-29 11:01:29,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 575 transitions, 6240 flow [2025-04-29 11:01:29,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 575 transitions, 6105 flow, removed 22 selfloop flow, removed 6 redundant places. [2025-04-29 11:01:29,226 INFO L231 Difference]: Finished difference. Result has 180 places, 401 transitions, 5154 flow [2025-04-29 11:01:29,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2515, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5154, PETRI_PLACES=180, PETRI_TRANSITIONS=401} [2025-04-29 11:01:29,227 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 142 predicate places. [2025-04-29 11:01:29,227 INFO L485 AbstractCegarLoop]: Abstraction has has 180 places, 401 transitions, 5154 flow [2025-04-29 11:01:29,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:29,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:29,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:29,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:01:29,228 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:29,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:29,228 INFO L85 PathProgramCache]: Analyzing trace with hash 44333164, now seen corresponding path program 4 times [2025-04-29 11:01:29,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:29,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134679708] [2025-04-29 11:01:29,228 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:01:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:29,234 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-29 11:01:29,237 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 19 statements. [2025-04-29 11:01:29,237 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:01:29,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:29,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134679708] [2025-04-29 11:01:29,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134679708] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:29,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:29,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:01:29,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106528834] [2025-04-29 11:01:29,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:29,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:01:29,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:29,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:01:29,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:01:29,341 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-04-29 11:01:29,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 401 transitions, 5154 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-04-29 11:01:29,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:29,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-04-29 11:01:29,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:30,646 INFO L116 PetriNetUnfolderBase]: 4009/8878 cut-off events. [2025-04-29 11:01:30,646 INFO L117 PetriNetUnfolderBase]: For 67949/68524 co-relation queries the response was YES. [2025-04-29 11:01:30,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39722 conditions, 8878 events. 4009/8878 cut-off events. For 67949/68524 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 70375 event pairs, 150 based on Foata normal form. 288/9144 useless extension candidates. Maximal degree in co-relation 39644. Up to 1895 conditions per place. [2025-04-29 11:01:30,700 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 639 selfloop transitions, 313 changer transitions 2/974 dead transitions. [2025-04-29 11:01:30,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 974 transitions, 13904 flow [2025-04-29 11:01:30,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:01:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:01:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 325 transitions. [2025-04-29 11:01:30,702 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-04-29 11:01:30,702 INFO L175 Difference]: Start difference. First operand has 180 places, 401 transitions, 5154 flow. Second operand 13 states and 325 transitions. [2025-04-29 11:01:30,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 974 transitions, 13904 flow [2025-04-29 11:01:30,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 974 transitions, 13467 flow, removed 162 selfloop flow, removed 10 redundant places. [2025-04-29 11:01:30,968 INFO L231 Difference]: Finished difference. Result has 184 places, 589 transitions, 8057 flow [2025-04-29 11:01:30,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4804, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8057, PETRI_PLACES=184, PETRI_TRANSITIONS=589} [2025-04-29 11:01:30,969 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 146 predicate places. [2025-04-29 11:01:30,969 INFO L485 AbstractCegarLoop]: Abstraction has has 184 places, 589 transitions, 8057 flow [2025-04-29 11:01:30,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-04-29 11:01:30,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:30,969 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:30,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:01:30,969 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:30,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash 305902079, now seen corresponding path program 1 times [2025-04-29 11:01:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:30,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738170245] [2025-04-29 11:01:30,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:30,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:01:30,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:01:30,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:30,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:01:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:31,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738170245] [2025-04-29 11:01:31,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738170245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:31,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:31,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679840977] [2025-04-29 11:01:31,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:31,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:01:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:31,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:01:31,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:01:31,012 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-29 11:01:31,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 589 transitions, 8057 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-04-29 11:01:31,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:31,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-29 11:01:31,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:32,706 INFO L116 PetriNetUnfolderBase]: 4691/9885 cut-off events. [2025-04-29 11:01:32,706 INFO L117 PetriNetUnfolderBase]: For 82525/83248 co-relation queries the response was YES. [2025-04-29 11:01:32,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48695 conditions, 9885 events. 4691/9885 cut-off events. For 82525/83248 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 75781 event pairs, 882 based on Foata normal form. 697/10498 useless extension candidates. Maximal degree in co-relation 48621. Up to 4781 conditions per place. [2025-04-29 11:01:32,767 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 662 selfloop transitions, 154 changer transitions 0/832 dead transitions. [2025-04-29 11:01:32,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 832 transitions, 12810 flow [2025-04-29 11:01:32,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:01:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:01:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-29 11:01:32,768 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6524390243902439 [2025-04-29 11:01:32,769 INFO L175 Difference]: Start difference. First operand has 184 places, 589 transitions, 8057 flow. Second operand 4 states and 107 transitions. [2025-04-29 11:01:32,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 832 transitions, 12810 flow [2025-04-29 11:01:33,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 832 transitions, 12666 flow, removed 72 selfloop flow, removed 0 redundant places. [2025-04-29 11:01:33,124 INFO L231 Difference]: Finished difference. Result has 189 places, 642 transitions, 9297 flow [2025-04-29 11:01:33,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7811, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9297, PETRI_PLACES=189, PETRI_TRANSITIONS=642} [2025-04-29 11:01:33,125 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 151 predicate places. [2025-04-29 11:01:33,125 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 642 transitions, 9297 flow [2025-04-29 11:01:33,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-04-29 11:01:33,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:33,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:33,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:01:33,125 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:33,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1108727412, now seen corresponding path program 1 times [2025-04-29 11:01:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:33,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863266056] [2025-04-29 11:01:33,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:33,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:01:33,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:01:33,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:33,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:33,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:33,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863266056] [2025-04-29 11:01:33,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863266056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:33,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:33,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:01:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158349366] [2025-04-29 11:01:33,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:33,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:01:33,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:33,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:01:33,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:01:33,292 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-04-29 11:01:33,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 642 transitions, 9297 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 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-04-29 11:01:33,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:33,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-04-29 11:01:33,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:36,212 INFO L116 PetriNetUnfolderBase]: 7525/15342 cut-off events. [2025-04-29 11:01:36,212 INFO L117 PetriNetUnfolderBase]: For 138412/138661 co-relation queries the response was YES. [2025-04-29 11:01:36,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79363 conditions, 15342 events. 7525/15342 cut-off events. For 138412/138661 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 120976 event pairs, 1324 based on Foata normal form. 243/15575 useless extension candidates. Maximal degree in co-relation 79286. Up to 6253 conditions per place. [2025-04-29 11:01:36,330 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 662 selfloop transitions, 643 changer transitions 2/1317 dead transitions. [2025-04-29 11:01:36,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 1317 transitions, 19897 flow [2025-04-29 11:01:36,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 11:01:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-29 11:01:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 459 transitions. [2025-04-29 11:01:36,331 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43058161350844276 [2025-04-29 11:01:36,331 INFO L175 Difference]: Start difference. First operand has 189 places, 642 transitions, 9297 flow. Second operand 26 states and 459 transitions. [2025-04-29 11:01:36,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 1317 transitions, 19897 flow [2025-04-29 11:01:37,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 1317 transitions, 19867 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-04-29 11:01:37,136 INFO L231 Difference]: Finished difference. Result has 233 places, 1028 transitions, 17774 flow [2025-04-29 11:01:37,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9287, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=17774, PETRI_PLACES=233, PETRI_TRANSITIONS=1028} [2025-04-29 11:01:37,137 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 195 predicate places. [2025-04-29 11:01:37,137 INFO L485 AbstractCegarLoop]: Abstraction has has 233 places, 1028 transitions, 17774 flow [2025-04-29 11:01:37,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 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-04-29 11:01:37,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:37,137 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:37,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:01:37,137 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:37,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash 892998315, now seen corresponding path program 1 times [2025-04-29 11:01:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:37,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105705624] [2025-04-29 11:01:37,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:37,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:01:37,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:01:37,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:37,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:37,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:37,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105705624] [2025-04-29 11:01:37,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105705624] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:37,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770006030] [2025-04-29 11:01:37,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:37,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:37,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:37,286 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-04-29 11:01:37,288 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-04-29 11:01:37,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:01:37,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:01:37,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:37,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:37,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:01:37,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:37,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:01:37,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770006030] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:37,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:01:37,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2025-04-29 11:01:37,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429965512] [2025-04-29 11:01:37,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:37,386 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:01:37,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:37,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:01:37,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:01:37,391 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-29 11:01:37,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 1028 transitions, 17774 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:37,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:37,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-29 11:01:37,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:40,527 INFO L116 PetriNetUnfolderBase]: 6682/14038 cut-off events. [2025-04-29 11:01:40,527 INFO L117 PetriNetUnfolderBase]: For 170814/171644 co-relation queries the response was YES. [2025-04-29 11:01:40,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81476 conditions, 14038 events. 6682/14038 cut-off events. For 170814/171644 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 112599 event pairs, 876 based on Foata normal form. 695/14369 useless extension candidates. Maximal degree in co-relation 81378. Up to 8485 conditions per place. [2025-04-29 11:01:40,630 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 925 selfloop transitions, 328 changer transitions 30/1313 dead transitions. [2025-04-29 11:01:40,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 1313 transitions, 24469 flow [2025-04-29 11:01:40,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2025-04-29 11:01:40,631 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-04-29 11:01:40,631 INFO L175 Difference]: Start difference. First operand has 233 places, 1028 transitions, 17774 flow. Second operand 6 states and 156 transitions. [2025-04-29 11:01:40,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 1313 transitions, 24469 flow [2025-04-29 11:01:41,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 1313 transitions, 24247 flow, removed 82 selfloop flow, removed 5 redundant places. [2025-04-29 11:01:41,547 INFO L231 Difference]: Finished difference. Result has 232 places, 1027 transitions, 18243 flow [2025-04-29 11:01:41,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=17587, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1027, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=328, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=18243, PETRI_PLACES=232, PETRI_TRANSITIONS=1027} [2025-04-29 11:01:41,548 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 194 predicate places. [2025-04-29 11:01:41,548 INFO L485 AbstractCegarLoop]: Abstraction has has 232 places, 1027 transitions, 18243 flow [2025-04-29 11:01:41,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:41,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:41,548 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:41,553 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-04-29 11:01:41,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:01:41,749 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:41,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:41,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1103577206, now seen corresponding path program 1 times [2025-04-29 11:01:41,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:41,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355334178] [2025-04-29 11:01:41,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:41,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:41,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:01:41,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:01:41,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:41,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:41,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:41,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355334178] [2025-04-29 11:01:41,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355334178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:41,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:41,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:01:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630608252] [2025-04-29 11:01:41,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:41,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:01:41,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:41,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:01:41,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:01:41,909 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-04-29 11:01:41,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 1027 transitions, 18243 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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-04-29 11:01:41,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:41,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-04-29 11:01:41,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:46,967 INFO L116 PetriNetUnfolderBase]: 10091/20346 cut-off events. [2025-04-29 11:01:46,967 INFO L117 PetriNetUnfolderBase]: For 256616/256907 co-relation queries the response was YES. [2025-04-29 11:01:47,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120416 conditions, 20346 events. 10091/20346 cut-off events. For 256616/256907 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 166784 event pairs, 1732 based on Foata normal form. 221/20562 useless extension candidates. Maximal degree in co-relation 120319. Up to 9178 conditions per place. [2025-04-29 11:01:47,139 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 958 selfloop transitions, 729 changer transitions 5/1701 dead transitions. [2025-04-29 11:01:47,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 1701 transitions, 31004 flow [2025-04-29 11:01:47,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 11:01:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-29 11:01:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 457 transitions. [2025-04-29 11:01:47,140 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42870544090056284 [2025-04-29 11:01:47,141 INFO L175 Difference]: Start difference. First operand has 232 places, 1027 transitions, 18243 flow. Second operand 26 states and 457 transitions. [2025-04-29 11:01:47,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 1701 transitions, 31004 flow [2025-04-29 11:01:48,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 1701 transitions, 30793 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-04-29 11:01:48,722 INFO L231 Difference]: Finished difference. Result has 265 places, 1410 transitions, 27456 flow [2025-04-29 11:01:48,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=18062, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1027, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=392, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=27456, PETRI_PLACES=265, PETRI_TRANSITIONS=1410} [2025-04-29 11:01:48,723 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 227 predicate places. [2025-04-29 11:01:48,723 INFO L485 AbstractCegarLoop]: Abstraction has has 265 places, 1410 transitions, 27456 flow [2025-04-29 11:01:48,723 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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-04-29 11:01:48,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:48,723 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:48,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:01:48,723 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:48,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:48,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1913144352, now seen corresponding path program 1 times [2025-04-29 11:01:48,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:48,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040487518] [2025-04-29 11:01:48,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:48,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:48,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:01:48,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:01:48,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:48,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:48,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:48,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040487518] [2025-04-29 11:01:48,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040487518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:48,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615367968] [2025-04-29 11:01:48,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:48,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:48,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:48,830 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-04-29 11:01:48,832 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-04-29 11:01:48,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:01:48,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:01:48,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:48,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:48,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:01:48,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:48,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:01:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:49,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615367968] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:01:49,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:01:49,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 17 [2025-04-29 11:01:49,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55733529] [2025-04-29 11:01:49,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:01:49,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:01:49,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:49,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:01:49,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:01:49,173 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-04-29 11:01:49,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 1410 transitions, 27456 flow. Second operand has 17 states, 17 states have (on average 14.058823529411764) internal successors, (239), 17 states have internal predecessors, (239), 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-04-29 11:01:49,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:49,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-04-29 11:01:49,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:02:04,997 INFO L116 PetriNetUnfolderBase]: 26343/53587 cut-off events. [2025-04-29 11:02:04,997 INFO L117 PetriNetUnfolderBase]: For 801494/805018 co-relation queries the response was YES. [2025-04-29 11:02:05,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339182 conditions, 53587 events. 26343/53587 cut-off events. For 801494/805018 co-relation queries the response was YES. Maximal size of possible extension queue 979. Compared 502744 event pairs, 3495 based on Foata normal form. 2518/55849 useless extension candidates. Maximal degree in co-relation 339073. Up to 14806 conditions per place. [2025-04-29 11:02:05,882 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 3632 selfloop transitions, 1010 changer transitions 11/4692 dead transitions. [2025-04-29 11:02:05,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 4692 transitions, 96608 flow [2025-04-29 11:02:05,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:02:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-29 11:02:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 502 transitions. [2025-04-29 11:02:05,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5565410199556541 [2025-04-29 11:02:05,883 INFO L175 Difference]: Start difference. First operand has 265 places, 1410 transitions, 27456 flow. Second operand 22 states and 502 transitions. [2025-04-29 11:02:05,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 4692 transitions, 96608 flow [2025-04-29 11:02:16,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 4692 transitions, 95519 flow, removed 442 selfloop flow, removed 8 redundant places. [2025-04-29 11:02:16,562 INFO L231 Difference]: Finished difference. Result has 284 places, 2236 transitions, 45750 flow [2025-04-29 11:02:16,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=26758, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=466, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=45750, PETRI_PLACES=284, PETRI_TRANSITIONS=2236} [2025-04-29 11:02:16,564 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 246 predicate places. [2025-04-29 11:02:16,564 INFO L485 AbstractCegarLoop]: Abstraction has has 284 places, 2236 transitions, 45750 flow [2025-04-29 11:02:16,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.058823529411764) internal successors, (239), 17 states have internal predecessors, (239), 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-04-29 11:02:16,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:02:16,564 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:02:16,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:02:16,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-29 11:02:16,770 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:02:16,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:02:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1173745606, now seen corresponding path program 1 times [2025-04-29 11:02:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:02:16,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397723821] [2025-04-29 11:02:16,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:02:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:02:16,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:02:16,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:02:16,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:02:16,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:02:16,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-04-29 11:02:16,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:02:16,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397723821] [2025-04-29 11:02:16,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397723821] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:02:16,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:02:16,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:02:16,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726733227] [2025-04-29 11:02:16,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:02:16,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:02:16,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:02:16,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:02:16,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:02:17,030 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2025-04-29 11:02:17,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 2236 transitions, 45750 flow. Second operand has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 12 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:02:17,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:02:17,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2025-04-29 11:02:17,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15