./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:22:26,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:22:26,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:22:26,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:22:26,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:22:26,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:22:26,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:22:26,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:22:26,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:22:26,375 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:22:26,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:22:26,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:22:26,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:22:26,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:22:26,376 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:22:26,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:22:26,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:22:26,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:22:26,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:22:26,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:22:26,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:22:26,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:22:26,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:22:26,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:22:26,376 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:22:26,377 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:22:26,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:22:26,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:22:26,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:22:26,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:22:26,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:22:26,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:22:26,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:22:26,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:22:26,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:26,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:22:26,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:22:26,378 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:22:26,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:22:26,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:22:26,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:22:26,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:22:26,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:22:26,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:22:26,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:22:26,378 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2025-03-04 15:22:26,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:22:26,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:22:26,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:22:26,610 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:22:26,610 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:22:26,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-03-04 15:22:27,730 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a3255fd/942850e12efb4745bf7752f5044b5ec8/FLAGe1259cd1c [2025-03-04 15:22:27,989 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:22:27,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-03-04 15:22:28,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a3255fd/942850e12efb4745bf7752f5044b5ec8/FLAGe1259cd1c [2025-03-04 15:22:28,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a3255fd/942850e12efb4745bf7752f5044b5ec8 [2025-03-04 15:22:28,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:22:28,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:22:28,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:28,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:22:28,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:22:28,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a49c00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28, skipping insertion in model container [2025-03-04 15:22:28,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:22:28,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:28,671 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:22:28,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:28,756 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:22:28,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28 WrapperNode [2025-03-04 15:22:28,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:28,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:28,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:22:28,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:22:28,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,801 INFO L138 Inliner]: procedures = 272, calls = 96, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 274 [2025-03-04 15:22:28,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:28,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:22:28,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:22:28,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:22:28,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,835 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 70, 2, 5]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 60, 0, 5]. The 5 writes are split as follows [0, 4, 1, 0]. [2025-03-04 15:22:28,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:22:28,849 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:22:28,849 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:22:28,849 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:22:28,850 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (1/1) ... [2025-03-04 15:22:28,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:28,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:28,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:22:28,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:22:28,892 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:22:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:22:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:22:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:22:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:22:28,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:22:28,894 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:22:28,992 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:22:28,993 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:22:29,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:22:29,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 15:22:29,303 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:22:29,303 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:22:29,583 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:22:29,585 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:22:29,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:29 BoogieIcfgContainer [2025-03-04 15:22:29,586 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:22:29,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:22:29,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:22:29,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:22:29,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:22:28" (1/3) ... [2025-03-04 15:22:29,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d03f7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:29, skipping insertion in model container [2025-03-04 15:22:29,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:28" (2/3) ... [2025-03-04 15:22:29,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d03f7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:29, skipping insertion in model container [2025-03-04 15:22:29,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:29" (3/3) ... [2025-03-04 15:22:29,593 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-03-04 15:22:29,606 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:22:29,608 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 95 locations, 1 initial locations, 13 loop locations, and 18 error locations. [2025-03-04 15:22:29,608 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:22:29,649 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:22:29,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 121 transitions, 249 flow [2025-03-04 15:22:29,745 INFO L124 PetriNetUnfolderBase]: 38/173 cut-off events. [2025-03-04 15:22:29,747 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:29,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 173 events. 38/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 746 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 106. Up to 8 conditions per place. [2025-03-04 15:22:29,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 121 transitions, 249 flow [2025-03-04 15:22:29,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 120 transitions, 247 flow [2025-03-04 15:22:29,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:29,773 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57fa631d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:29,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 15:22:29,778 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:29,779 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:22:29,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:29,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:29,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:22:29,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:22:29,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash 665900, now seen corresponding path program 1 times [2025-03-04 15:22:29,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:29,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440791874] [2025-03-04 15:22:29,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:29,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:29,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:22:29,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:22:29,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:29,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:30,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:30,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:30,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440791874] [2025-03-04 15:22:30,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440791874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:30,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:30,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:30,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681657997] [2025-03-04 15:22:30,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:30,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:30,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:30,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:30,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:30,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 121 [2025-03-04 15:22:30,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 120 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:30,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:30,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 121 [2025-03-04 15:22:30,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:30,450 INFO L124 PetriNetUnfolderBase]: 575/1779 cut-off events. [2025-03-04 15:22:30,451 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:30,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2886 conditions, 1779 events. 575/1779 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 12529 event pairs, 480 based on Foata normal form. 243/1749 useless extension candidates. Maximal degree in co-relation 2787. Up to 1100 conditions per place. [2025-03-04 15:22:30,461 INFO L140 encePairwiseOnDemand]: 95/121 looper letters, 53 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2025-03-04 15:22:30,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 102 transitions, 323 flow [2025-03-04 15:22:30,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2025-03-04 15:22:30,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5433884297520661 [2025-03-04 15:22:30,474 INFO L175 Difference]: Start difference. First operand has 98 places, 120 transitions, 247 flow. Second operand 4 states and 263 transitions. [2025-03-04 15:22:30,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 102 transitions, 323 flow [2025-03-04 15:22:30,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 323 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:30,482 INFO L231 Difference]: Finished difference. Result has 103 places, 102 transitions, 231 flow [2025-03-04 15:22:30,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=103, PETRI_TRANSITIONS=102} [2025-03-04 15:22:30,488 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2025-03-04 15:22:30,489 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 102 transitions, 231 flow [2025-03-04 15:22:30,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:30,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:30,489 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:22:30,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:22:30,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:22:30,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:30,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1636433053, now seen corresponding path program 1 times [2025-03-04 15:22:30,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:30,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550321138] [2025-03-04 15:22:30,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:30,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:30,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:30,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:30,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:30,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:30,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:30,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550321138] [2025-03-04 15:22:30,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550321138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:30,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320857763] [2025-03-04 15:22:30,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:30,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:30,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:30,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:30,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:22:30,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:30,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:30,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:30,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:30,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:22:30,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:30,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:22:30,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320857763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:30,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:22:30,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:22:30,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415546621] [2025-03-04 15:22:30,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:30,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:30,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:30,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:30,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:22:30,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 121 [2025-03-04 15:22:30,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 102 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:30,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:30,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 121 [2025-03-04 15:22:30,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:31,020 INFO L124 PetriNetUnfolderBase]: 575/1778 cut-off events. [2025-03-04 15:22:31,020 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:22:31,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2896 conditions, 1778 events. 575/1778 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 12498 event pairs, 480 based on Foata normal form. 1/1506 useless extension candidates. Maximal degree in co-relation 2878. Up to 1095 conditions per place. [2025-03-04 15:22:31,026 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 49 selfloop transitions, 6 changer transitions 0/101 dead transitions. [2025-03-04 15:22:31,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 101 transitions, 337 flow [2025-03-04 15:22:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 332 transitions. [2025-03-04 15:22:31,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4573002754820937 [2025-03-04 15:22:31,029 INFO L175 Difference]: Start difference. First operand has 103 places, 102 transitions, 231 flow. Second operand 6 states and 332 transitions. [2025-03-04 15:22:31,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 101 transitions, 337 flow [2025-03-04 15:22:31,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 101 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:31,031 INFO L231 Difference]: Finished difference. Result has 106 places, 101 transitions, 237 flow [2025-03-04 15:22:31,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=106, PETRI_TRANSITIONS=101} [2025-03-04 15:22:31,031 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 8 predicate places. [2025-03-04 15:22:31,031 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 101 transitions, 237 flow [2025-03-04 15:22:31,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:31,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:31,032 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:22:31,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:22:31,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:31,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:22:31,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash 810183488, now seen corresponding path program 1 times [2025-03-04 15:22:31,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:31,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133402402] [2025-03-04 15:22:31,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:31,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:22:31,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:22:31,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:31,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:22:31,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:31,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133402402] [2025-03-04 15:22:31,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133402402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:31,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:31,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114014641] [2025-03-04 15:22:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:31,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:22:31,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:31,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:22:31,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:22:31,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 121 [2025-03-04 15:22:31,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 101 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:31,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:31,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 121 [2025-03-04 15:22:31,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:31,488 INFO L124 PetriNetUnfolderBase]: 575/1777 cut-off events. [2025-03-04 15:22:31,489 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 15:22:31,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2898 conditions, 1777 events. 575/1777 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 12525 event pairs, 480 based on Foata normal form. 1/1506 useless extension candidates. Maximal degree in co-relation 2874. Up to 1098 conditions per place. [2025-03-04 15:22:31,497 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 50 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-03-04 15:22:31,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 100 transitions, 341 flow [2025-03-04 15:22:31,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:22:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:22:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2025-03-04 15:22:31,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5261707988980716 [2025-03-04 15:22:31,500 INFO L175 Difference]: Start difference. First operand has 106 places, 101 transitions, 237 flow. Second operand 3 states and 191 transitions. [2025-03-04 15:22:31,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 100 transitions, 341 flow [2025-03-04 15:22:31,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 100 transitions, 319 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:22:31,504 INFO L231 Difference]: Finished difference. Result has 101 places, 100 transitions, 219 flow [2025-03-04 15:22:31,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=101, PETRI_TRANSITIONS=100} [2025-03-04 15:22:31,506 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 3 predicate places. [2025-03-04 15:22:31,506 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 100 transitions, 219 flow [2025-03-04 15:22:31,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:31,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:31,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:31,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:22:31,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:22:31,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:31,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1197580708, now seen corresponding path program 1 times [2025-03-04 15:22:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:31,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393458604] [2025-03-04 15:22:31,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:31,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:31,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:31,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:31,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:31,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:31,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393458604] [2025-03-04 15:22:31,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393458604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:31,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110581613] [2025-03-04 15:22:31,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:31,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:31,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:31,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:31,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:22:31,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:31,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:31,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:31,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:31,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:22:31,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:31,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:31,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110581613] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:31,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:31,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:22:31,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312774110] [2025-03-04 15:22:31,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:31,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:22:31,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:31,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:22:31,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:22:31,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 121 [2025-03-04 15:22:31,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 100 transitions, 219 flow. Second operand has 10 states, 10 states have (on average 47.3) internal successors, (473), 10 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:31,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:31,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 121 [2025-03-04 15:22:31,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:32,027 INFO L124 PetriNetUnfolderBase]: 575/1781 cut-off events. [2025-03-04 15:22:32,028 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 15:22:32,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1781 events. 575/1781 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 12492 event pairs, 480 based on Foata normal form. 2/1512 useless extension candidates. Maximal degree in co-relation 2867. Up to 1096 conditions per place. [2025-03-04 15:22:32,037 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 50 selfloop transitions, 7 changer transitions 0/103 dead transitions. [2025-03-04 15:22:32,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 103 transitions, 348 flow [2025-03-04 15:22:32,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:22:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:22:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 381 transitions. [2025-03-04 15:22:32,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4498229043683589 [2025-03-04 15:22:32,039 INFO L175 Difference]: Start difference. First operand has 101 places, 100 transitions, 219 flow. Second operand 7 states and 381 transitions. [2025-03-04 15:22:32,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 103 transitions, 348 flow [2025-03-04 15:22:32,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 103 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:32,044 INFO L231 Difference]: Finished difference. Result has 107 places, 103 transitions, 245 flow [2025-03-04 15:22:32,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=245, PETRI_PLACES=107, PETRI_TRANSITIONS=103} [2025-03-04 15:22:32,045 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 9 predicate places. [2025-03-04 15:22:32,045 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 103 transitions, 245 flow [2025-03-04 15:22:32,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 47.3) internal successors, (473), 10 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:32,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:32,046 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:32,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:32,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 15:22:32,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:22:32,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:32,247 INFO L85 PathProgramCache]: Analyzing trace with hash 92891716, now seen corresponding path program 2 times [2025-03-04 15:22:32,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:32,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041501623] [2025-03-04 15:22:32,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:32,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:32,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:22:32,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:22:32,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:22:32,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:22:32,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:32,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041501623] [2025-03-04 15:22:32,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041501623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:32,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:32,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:32,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385685923] [2025-03-04 15:22:32,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:32,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:32,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:32,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:32,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:32,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 121 [2025-03-04 15:22:32,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 245 flow. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:32,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:32,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 121 [2025-03-04 15:22:32,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:32,568 INFO L124 PetriNetUnfolderBase]: 571/1550 cut-off events. [2025-03-04 15:22:32,568 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:22:32,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 1550 events. 571/1550 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 10292 event pairs, 0 based on Foata normal form. 21/1363 useless extension candidates. Maximal degree in co-relation 2640. Up to 1039 conditions per place. [2025-03-04 15:22:32,576 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 98 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2025-03-04 15:22:32,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 144 transitions, 529 flow [2025-03-04 15:22:32,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 279 transitions. [2025-03-04 15:22:32,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5764462809917356 [2025-03-04 15:22:32,579 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 245 flow. Second operand 4 states and 279 transitions. [2025-03-04 15:22:32,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 144 transitions, 529 flow [2025-03-04 15:22:32,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 144 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:32,583 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 247 flow [2025-03-04 15:22:32,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2025-03-04 15:22:32,584 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 9 predicate places. [2025-03-04 15:22:32,584 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 247 flow [2025-03-04 15:22:32,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:32,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:32,584 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:32,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:22:32,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:22:32,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1378739320, now seen corresponding path program 1 times [2025-03-04 15:22:32,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:32,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637110064] [2025-03-04 15:22:32,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:32,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:22:32,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:22:32,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:32,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:32,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:32,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637110064] [2025-03-04 15:22:32,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637110064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:32,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065868604] [2025-03-04 15:22:32,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:32,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:32,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:32,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:32,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:22:32,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:22:32,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:22:32,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:32,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:32,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:22:32,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:32,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:32,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065868604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:32,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:32,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:22:32,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241847696] [2025-03-04 15:22:32,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:32,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:22:32,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:32,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:22:32,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:22:32,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 121 [2025-03-04 15:22:32,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 247 flow. Second operand has 18 states, 18 states have (on average 47.22222222222222) internal successors, (850), 18 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:32,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:32,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 121 [2025-03-04 15:22:32,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:33,266 INFO L124 PetriNetUnfolderBase]: 573/1737 cut-off events. [2025-03-04 15:22:33,266 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-04 15:22:33,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2910 conditions, 1737 events. 573/1737 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 11955 event pairs, 480 based on Foata normal form. 4/1500 useless extension candidates. Maximal degree in co-relation 2835. Up to 1073 conditions per place. [2025-03-04 15:22:33,272 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 50 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2025-03-04 15:22:33,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 109 transitions, 425 flow [2025-03-04 15:22:33,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:22:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:22:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 759 transitions. [2025-03-04 15:22:33,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2025-03-04 15:22:33,277 INFO L175 Difference]: Start difference. First operand has 107 places, 101 transitions, 247 flow. Second operand 15 states and 759 transitions. [2025-03-04 15:22:33,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 109 transitions, 425 flow [2025-03-04 15:22:33,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 109 transitions, 419 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:22:33,280 INFO L231 Difference]: Finished difference. Result has 122 places, 109 transitions, 338 flow [2025-03-04 15:22:33,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=338, PETRI_PLACES=122, PETRI_TRANSITIONS=109} [2025-03-04 15:22:33,281 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 24 predicate places. [2025-03-04 15:22:33,282 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 109 transitions, 338 flow [2025-03-04 15:22:33,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 47.22222222222222) internal successors, (850), 18 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:33,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:33,282 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:33,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:33,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:33,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:22:33,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:33,483 INFO L85 PathProgramCache]: Analyzing trace with hash -576212168, now seen corresponding path program 2 times [2025-03-04 15:22:33,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:33,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452228633] [2025-03-04 15:22:33,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:33,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:33,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:22:33,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:22:33,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:22:33,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:33,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:33,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452228633] [2025-03-04 15:22:33,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452228633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:33,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252288560] [2025-03-04 15:22:33,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:33,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:33,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:33,736 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:33,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:22:33,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:22:33,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:22:33,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:22:33,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:33,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:22:33,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:33,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:34,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252288560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:34,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:34,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-04 15:22:34,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637455437] [2025-03-04 15:22:34,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:34,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:22:34,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:34,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:22:34,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:22:34,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 121 [2025-03-04 15:22:34,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 109 transitions, 338 flow. Second operand has 23 states, 23 states have (on average 47.21739130434783) internal successors, (1086), 23 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:34,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:34,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 121 [2025-03-04 15:22:34,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:34,385 INFO L124 PetriNetUnfolderBase]: 573/1737 cut-off events. [2025-03-04 15:22:34,385 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-03-04 15:22:34,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1737 events. 573/1737 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 11906 event pairs, 480 based on Foata normal form. 3/1497 useless extension candidates. Maximal degree in co-relation 2809. Up to 1075 conditions per place. [2025-03-04 15:22:34,392 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 50 selfloop transitions, 21 changer transitions 0/115 dead transitions. [2025-03-04 15:22:34,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 115 transitions, 534 flow [2025-03-04 15:22:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:22:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:22:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1040 transitions. [2025-03-04 15:22:34,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40928768201495475 [2025-03-04 15:22:34,395 INFO L175 Difference]: Start difference. First operand has 122 places, 109 transitions, 338 flow. Second operand 21 states and 1040 transitions. [2025-03-04 15:22:34,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 115 transitions, 534 flow [2025-03-04 15:22:34,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 115 transitions, 524 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:22:34,397 INFO L231 Difference]: Finished difference. Result has 141 places, 115 transitions, 439 flow [2025-03-04 15:22:34,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=439, PETRI_PLACES=141, PETRI_TRANSITIONS=115} [2025-03-04 15:22:34,398 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 43 predicate places. [2025-03-04 15:22:34,398 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 115 transitions, 439 flow [2025-03-04 15:22:34,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 47.21739130434783) internal successors, (1086), 23 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:34,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:34,399 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:34,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:34,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:34,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-04 15:22:34,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:34,600 INFO L85 PathProgramCache]: Analyzing trace with hash 621549377, now seen corresponding path program 3 times [2025-03-04 15:22:34,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:34,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362456248] [2025-03-04 15:22:34,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:22:34,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:34,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 11 equivalence classes. [2025-03-04 15:22:34,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:22:34,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:22:34,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:34,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:34,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:22:34,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:22:34,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:34,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:34,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:34,688 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:34,689 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-03-04 15:22:34,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2025-03-04 15:22:34,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2025-03-04 15:22:34,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2025-03-04 15:22:34,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2025-03-04 15:22:34,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2025-03-04 15:22:34,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2025-03-04 15:22:34,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2025-03-04 15:22:34,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2025-03-04 15:22:34,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2025-03-04 15:22:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2025-03-04 15:22:34,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:22:34,692 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2025-03-04 15:22:34,693 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:34,694 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:22:34,711 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:22:34,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 172 transitions, 360 flow [2025-03-04 15:22:34,729 INFO L124 PetriNetUnfolderBase]: 64/295 cut-off events. [2025-03-04 15:22:34,729 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:22:34,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 295 events. 64/295 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1476 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 175. Up to 12 conditions per place. [2025-03-04 15:22:34,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 172 transitions, 360 flow [2025-03-04 15:22:34,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 172 transitions, 360 flow [2025-03-04 15:22:34,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:34,736 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57fa631d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:34,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-04 15:22:34,737 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:34,738 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:22:34,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:34,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:34,738 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:22:34,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-03-04 15:22:34,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:34,738 INFO L85 PathProgramCache]: Analyzing trace with hash 836696, now seen corresponding path program 1 times [2025-03-04 15:22:34,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:34,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53444674] [2025-03-04 15:22:34,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:34,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:34,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:22:34,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:22:34,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:34,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:34,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53444674] [2025-03-04 15:22:34,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53444674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:34,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:34,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500801264] [2025-03-04 15:22:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:34,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:34,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:34,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:34,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:34,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 172 [2025-03-04 15:22:34,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 172 transitions, 360 flow. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:34,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:34,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 172 [2025-03-04 15:22:34,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:37,571 INFO L124 PetriNetUnfolderBase]: 24270/51838 cut-off events. [2025-03-04 15:22:37,572 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2025-03-04 15:22:37,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87323 conditions, 51838 events. 24270/51838 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 1483. Compared 548711 event pairs, 21160 based on Foata normal form. 8148/52474 useless extension candidates. Maximal degree in co-relation 64993. Up to 35371 conditions per place. [2025-03-04 15:22:37,907 INFO L140 encePairwiseOnDemand]: 136/172 looper letters, 77 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2025-03-04 15:22:37,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 144 transitions, 464 flow [2025-03-04 15:22:37,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2025-03-04 15:22:37,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363372093023255 [2025-03-04 15:22:37,909 INFO L175 Difference]: Start difference. First operand has 138 places, 172 transitions, 360 flow. Second operand 4 states and 369 transitions. [2025-03-04 15:22:37,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 144 transitions, 464 flow [2025-03-04 15:22:37,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 144 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:37,911 INFO L231 Difference]: Finished difference. Result has 143 places, 144 transitions, 324 flow [2025-03-04 15:22:37,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=143, PETRI_TRANSITIONS=144} [2025-03-04 15:22:37,913 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, 5 predicate places. [2025-03-04 15:22:37,913 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 144 transitions, 324 flow [2025-03-04 15:22:37,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:37,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:37,914 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:22:37,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:22:37,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-03-04 15:22:37,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash -843045917, now seen corresponding path program 1 times [2025-03-04 15:22:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:37,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098814761] [2025-03-04 15:22:37,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:37,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:37,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:37,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:37,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:37,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:37,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:37,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098814761] [2025-03-04 15:22:37,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098814761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:37,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794813503] [2025-03-04 15:22:37,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:37,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:37,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:37,971 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:37,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:22:38,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:38,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:38,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:38,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:38,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:22:38,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:38,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:22:38,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794813503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:38,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:22:38,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:22:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045686557] [2025-03-04 15:22:38,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:38,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:38,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:38,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:38,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:22:38,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 172 [2025-03-04 15:22:38,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 144 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 64.83333333333333) internal successors, (389), 6 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:38,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:38,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 172 [2025-03-04 15:22:38,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:40,955 INFO L124 PetriNetUnfolderBase]: 24270/51837 cut-off events. [2025-03-04 15:22:40,956 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-03-04 15:22:41,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87333 conditions, 51837 events. 24270/51837 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 1483. Compared 548821 event pairs, 21160 based on Foata normal form. 1/44326 useless extension candidates. Maximal degree in co-relation 87314. Up to 35366 conditions per place. [2025-03-04 15:22:41,189 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 73 selfloop transitions, 6 changer transitions 0/143 dead transitions. [2025-03-04 15:22:41,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 143 transitions, 478 flow [2025-03-04 15:22:41,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 464 transitions. [2025-03-04 15:22:41,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4496124031007752 [2025-03-04 15:22:41,191 INFO L175 Difference]: Start difference. First operand has 143 places, 144 transitions, 324 flow. Second operand 6 states and 464 transitions. [2025-03-04 15:22:41,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 143 transitions, 478 flow [2025-03-04 15:22:41,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 143 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:41,193 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 330 flow [2025-03-04 15:22:41,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2025-03-04 15:22:41,196 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, 8 predicate places. [2025-03-04 15:22:41,196 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 330 flow [2025-03-04 15:22:41,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.83333333333333) internal successors, (389), 6 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:41,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:41,196 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:22:41,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:41,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 15:22:41,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-03-04 15:22:41,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash -364618900, now seen corresponding path program 1 times [2025-03-04 15:22:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:41,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718509154] [2025-03-04 15:22:41,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:41,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:22:41,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:22:41,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:41,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:22:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:41,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718509154] [2025-03-04 15:22:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718509154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:41,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934208965] [2025-03-04 15:22:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:41,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:22:41,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:41,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:22:41,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:22:41,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 172 [2025-03-04 15:22:41,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:41,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:41,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 172 [2025-03-04 15:22:41,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:43,862 INFO L124 PetriNetUnfolderBase]: 24270/51836 cut-off events. [2025-03-04 15:22:43,863 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-03-04 15:22:44,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87335 conditions, 51836 events. 24270/51836 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 1483. Compared 548743 event pairs, 21160 based on Foata normal form. 1/44326 useless extension candidates. Maximal degree in co-relation 87310. Up to 35369 conditions per place. [2025-03-04 15:22:44,288 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 74 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2025-03-04 15:22:44,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 142 transitions, 482 flow [2025-03-04 15:22:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:22:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:22:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2025-03-04 15:22:44,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5213178294573644 [2025-03-04 15:22:44,290 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 330 flow. Second operand 3 states and 269 transitions. [2025-03-04 15:22:44,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 142 transitions, 482 flow [2025-03-04 15:22:44,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 142 transitions, 460 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:22:44,292 INFO L231 Difference]: Finished difference. Result has 141 places, 142 transitions, 312 flow [2025-03-04 15:22:44,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=141, PETRI_TRANSITIONS=142} [2025-03-04 15:22:44,294 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, 3 predicate places. [2025-03-04 15:22:44,294 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 142 transitions, 312 flow [2025-03-04 15:22:44,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:44,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:44,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:44,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:22:44,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-03-04 15:22:44,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:44,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1788937281, now seen corresponding path program 1 times [2025-03-04 15:22:44,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:44,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346202989] [2025-03-04 15:22:44,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:44,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:44,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:44,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:44,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:44,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:44,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346202989] [2025-03-04 15:22:44,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346202989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:44,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960721006] [2025-03-04 15:22:44,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:44,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:44,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:44,348 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:44,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:22:44,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:44,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:44,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:44,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:44,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:22:44,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:44,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:44,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:44,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960721006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:44,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:44,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:22:44,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413015260] [2025-03-04 15:22:44,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:44,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:22:44,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:44,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:22:44,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:22:44,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 172 [2025-03-04 15:22:44,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 142 transitions, 312 flow. Second operand has 10 states, 10 states have (on average 65.3) internal successors, (653), 10 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:44,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:44,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 172 [2025-03-04 15:22:44,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:46,852 INFO L124 PetriNetUnfolderBase]: 24270/51840 cut-off events. [2025-03-04 15:22:46,852 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-04 15:22:46,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87338 conditions, 51840 events. 24270/51840 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 1483. Compared 548734 event pairs, 21160 based on Foata normal form. 2/44332 useless extension candidates. Maximal degree in co-relation 87303. Up to 35367 conditions per place. [2025-03-04 15:22:47,065 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 74 selfloop transitions, 7 changer transitions 0/145 dead transitions. [2025-03-04 15:22:47,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 145 transitions, 489 flow [2025-03-04 15:22:47,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:22:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:22:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 531 transitions. [2025-03-04 15:22:47,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4410299003322259 [2025-03-04 15:22:47,067 INFO L175 Difference]: Start difference. First operand has 141 places, 142 transitions, 312 flow. Second operand 7 states and 531 transitions. [2025-03-04 15:22:47,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 145 transitions, 489 flow [2025-03-04 15:22:47,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 145 transitions, 475 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:47,069 INFO L231 Difference]: Finished difference. Result has 147 places, 145 transitions, 338 flow [2025-03-04 15:22:47,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=147, PETRI_TRANSITIONS=145} [2025-03-04 15:22:47,070 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, 9 predicate places. [2025-03-04 15:22:47,070 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 145 transitions, 338 flow [2025-03-04 15:22:47,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 65.3) internal successors, (653), 10 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:47,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:47,070 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:47,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:22:47,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:47,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-03-04 15:22:47,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:47,271 INFO L85 PathProgramCache]: Analyzing trace with hash -543474591, now seen corresponding path program 2 times [2025-03-04 15:22:47,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:47,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264177586] [2025-03-04 15:22:47,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:47,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:47,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:22:47,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:22:47,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:22:47,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:22:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:47,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264177586] [2025-03-04 15:22:47,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264177586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:47,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:47,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:47,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467301587] [2025-03-04 15:22:47,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:47,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:47,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:47,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:47,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:47,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 172 [2025-03-04 15:22:47,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 145 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:47,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:47,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 172 [2025-03-04 15:22:47,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:50,375 INFO L124 PetriNetUnfolderBase]: 26448/53999 cut-off events. [2025-03-04 15:22:50,375 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-03-04 15:22:50,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92892 conditions, 53999 events. 26448/53999 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 1471. Compared 554854 event pairs, 11420 based on Foata normal form. 21/46367 useless extension candidates. Maximal degree in co-relation 92852. Up to 38696 conditions per place. [2025-03-04 15:22:50,652 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 126 selfloop transitions, 3 changer transitions 0/190 dead transitions. [2025-03-04 15:22:50,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 190 transitions, 686 flow [2025-03-04 15:22:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2025-03-04 15:22:50,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5508720930232558 [2025-03-04 15:22:50,654 INFO L175 Difference]: Start difference. First operand has 147 places, 145 transitions, 338 flow. Second operand 4 states and 379 transitions. [2025-03-04 15:22:50,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 190 transitions, 686 flow [2025-03-04 15:22:50,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 190 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:50,657 INFO L231 Difference]: Finished difference. Result has 150 places, 147 transitions, 358 flow [2025-03-04 15:22:50,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=358, PETRI_PLACES=150, PETRI_TRANSITIONS=147} [2025-03-04 15:22:50,658 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, 12 predicate places. [2025-03-04 15:22:50,658 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 147 transitions, 358 flow [2025-03-04 15:22:50,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:50,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:50,658 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:50,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:22:50,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-03-04 15:22:50,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash -607239876, now seen corresponding path program 1 times [2025-03-04 15:22:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:50,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782362555] [2025-03-04 15:22:50,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:50,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:22:50,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:22:50,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:50,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:50,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:50,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782362555] [2025-03-04 15:22:50,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782362555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:50,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354286053] [2025-03-04 15:22:50,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:50,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:50,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:50,775 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:22:50,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:22:50,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:22:50,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:22:50,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:50,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:50,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:22:50,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:50,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354286053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:50,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:22:50,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922799518] [2025-03-04 15:22:50,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:50,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:22:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:50,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:22:50,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:22:50,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 172 [2025-03-04 15:22:50,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 147 transitions, 358 flow. Second operand has 18 states, 18 states have (on average 65.27777777777777) internal successors, (1175), 18 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:50,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:50,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 172 [2025-03-04 15:22:50,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:54,180 INFO L124 PetriNetUnfolderBase]: 24267/52933 cut-off events. [2025-03-04 15:22:54,181 INFO L125 PetriNetUnfolderBase]: For 1132/1975 co-relation queries the response was YES. [2025-03-04 15:22:54,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89393 conditions, 52933 events. 24267/52933 cut-off events. For 1132/1975 co-relation queries the response was YES. Maximal size of possible extension queue 1487. Compared 569717 event pairs, 21160 based on Foata normal form. 23/45657 useless extension candidates. Maximal degree in co-relation 89316. Up to 35331 conditions per place. [2025-03-04 15:22:54,475 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 75 selfloop transitions, 15 changer transitions 0/155 dead transitions. [2025-03-04 15:22:54,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 155 transitions, 586 flow [2025-03-04 15:22:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:22:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:22:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1053 transitions. [2025-03-04 15:22:54,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40813953488372096 [2025-03-04 15:22:54,478 INFO L175 Difference]: Start difference. First operand has 150 places, 147 transitions, 358 flow. Second operand 15 states and 1053 transitions. [2025-03-04 15:22:54,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 155 transitions, 586 flow [2025-03-04 15:22:54,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 155 transitions, 584 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:54,481 INFO L231 Difference]: Finished difference. Result has 167 places, 155 transitions, 453 flow [2025-03-04 15:22:54,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=453, PETRI_PLACES=167, PETRI_TRANSITIONS=155} [2025-03-04 15:22:54,481 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, 29 predicate places. [2025-03-04 15:22:54,482 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 155 transitions, 453 flow [2025-03-04 15:22:54,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 65.27777777777777) internal successors, (1175), 18 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:54,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:54,482 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:54,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:22:54,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:54,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-03-04 15:22:54,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:54,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1829846788, now seen corresponding path program 2 times [2025-03-04 15:22:54,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:54,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688801692] [2025-03-04 15:22:54,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:54,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:54,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 15:22:54,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 32 statements. [2025-03-04 15:22:54,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:22:54,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:22:54,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:54,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688801692] [2025-03-04 15:22:54,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688801692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:54,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:54,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:22:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647940941] [2025-03-04 15:22:54,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:54,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:54,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:54,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:54,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 172 [2025-03-04 15:22:54,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 155 transitions, 453 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:54,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:54,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 172 [2025-03-04 15:22:54,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:57,975 INFO L124 PetriNetUnfolderBase]: 25079/47640 cut-off events. [2025-03-04 15:22:57,976 INFO L125 PetriNetUnfolderBase]: For 1857/1857 co-relation queries the response was YES. [2025-03-04 15:22:58,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86755 conditions, 47640 events. 25079/47640 cut-off events. For 1857/1857 co-relation queries the response was YES. Maximal size of possible extension queue 1326. Compared 460337 event pairs, 819 based on Foata normal form. 441/42004 useless extension candidates. Maximal degree in co-relation 86654. Up to 30745 conditions per place. [2025-03-04 15:22:58,248 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 214 selfloop transitions, 6 changer transitions 0/281 dead transitions. [2025-03-04 15:22:58,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 281 transitions, 1143 flow [2025-03-04 15:22:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 586 transitions. [2025-03-04 15:22:58,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5678294573643411 [2025-03-04 15:22:58,250 INFO L175 Difference]: Start difference. First operand has 167 places, 155 transitions, 453 flow. Second operand 6 states and 586 transitions. [2025-03-04 15:22:58,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 281 transitions, 1143 flow [2025-03-04 15:22:58,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 281 transitions, 1133 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:22:58,255 INFO L231 Difference]: Finished difference. Result has 167 places, 154 transitions, 451 flow [2025-03-04 15:22:58,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=451, PETRI_PLACES=167, PETRI_TRANSITIONS=154} [2025-03-04 15:22:58,256 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, 29 predicate places. [2025-03-04 15:22:58,256 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 154 transitions, 451 flow [2025-03-04 15:22:58,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:58,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:58,256 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:58,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:22:58,256 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-03-04 15:22:58,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash -890674840, now seen corresponding path program 1 times [2025-03-04 15:22:58,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:58,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944009729] [2025-03-04 15:22:58,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:58,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:58,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:22:58,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:22:58,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:58,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:22:58,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:58,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944009729] [2025-03-04 15:22:58,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944009729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:58,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:58,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:58,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158405412] [2025-03-04 15:22:58,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:58,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:58,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:58,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:58,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 172 [2025-03-04 15:22:58,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 154 transitions, 451 flow. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:58,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:58,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 172 [2025-03-04 15:22:58,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:01,318 INFO L124 PetriNetUnfolderBase]: 24198/45924 cut-off events. [2025-03-04 15:23:01,318 INFO L125 PetriNetUnfolderBase]: For 3446/3446 co-relation queries the response was YES. [2025-03-04 15:23:01,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84696 conditions, 45924 events. 24198/45924 cut-off events. For 3446/3446 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 439721 event pairs, 907 based on Foata normal form. 441/40963 useless extension candidates. Maximal degree in co-relation 84599. Up to 32110 conditions per place. [2025-03-04 15:23:01,610 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 171 selfloop transitions, 6 changer transitions 0/238 dead transitions. [2025-03-04 15:23:01,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 238 transitions, 971 flow [2025-03-04 15:23:01,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:01,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2025-03-04 15:23:01,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031976744186046 [2025-03-04 15:23:01,612 INFO L175 Difference]: Start difference. First operand has 167 places, 154 transitions, 451 flow. Second operand 4 states and 415 transitions. [2025-03-04 15:23:01,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 238 transitions, 971 flow [2025-03-04 15:23:01,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 238 transitions, 955 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:23:01,622 INFO L231 Difference]: Finished difference. Result has 165 places, 154 transitions, 451 flow [2025-03-04 15:23:01,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=451, PETRI_PLACES=165, PETRI_TRANSITIONS=154} [2025-03-04 15:23:01,623 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, 27 predicate places. [2025-03-04 15:23:01,623 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 154 transitions, 451 flow [2025-03-04 15:23:01,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:01,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:01,623 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:01,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:23:01,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-03-04 15:23:01,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1261169674, now seen corresponding path program 1 times [2025-03-04 15:23:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971805415] [2025-03-04 15:23:01,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:01,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:23:01,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:23:01,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:01,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:01,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:01,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971805415] [2025-03-04 15:23:01,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971805415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:01,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051640190] [2025-03-04 15:23:01,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:01,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:01,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:01,810 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:23:01,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:23:01,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:23:01,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:23:01,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:01,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:01,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:23:01,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:01,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:23:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051640190] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:02,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:02,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-04 15:23:02,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96106411] [2025-03-04 15:23:02,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:02,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:23:02,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:02,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:23:02,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:23:02,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 172 [2025-03-04 15:23:02,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 154 transitions, 451 flow. Second operand has 23 states, 23 states have (on average 65.47826086956522) internal successors, (1506), 23 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:02,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:02,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 172 [2025-03-04 15:23:02,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:05,851 INFO L124 PetriNetUnfolderBase]: 24267/52929 cut-off events. [2025-03-04 15:23:05,851 INFO L125 PetriNetUnfolderBase]: For 3967/3967 co-relation queries the response was YES. [2025-03-04 15:23:06,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90338 conditions, 52929 events. 24267/52929 cut-off events. For 3967/3967 co-relation queries the response was YES. Maximal size of possible extension queue 1489. Compared 569155 event pairs, 21160 based on Foata normal form. 3/45631 useless extension candidates. Maximal degree in co-relation 90207. Up to 35331 conditions per place. [2025-03-04 15:23:06,165 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 76 selfloop transitions, 21 changer transitions 0/160 dead transitions. [2025-03-04 15:23:06,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 160 transitions, 699 flow [2025-03-04 15:23:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:23:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:23:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1442 transitions. [2025-03-04 15:23:06,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3992248062015504 [2025-03-04 15:23:06,168 INFO L175 Difference]: Start difference. First operand has 165 places, 154 transitions, 451 flow. Second operand 21 states and 1442 transitions. [2025-03-04 15:23:06,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 160 transitions, 699 flow [2025-03-04 15:23:06,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 160 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:06,171 INFO L231 Difference]: Finished difference. Result has 186 places, 160 transitions, 554 flow [2025-03-04 15:23:06,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=554, PETRI_PLACES=186, PETRI_TRANSITIONS=160} [2025-03-04 15:23:06,172 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, 48 predicate places. [2025-03-04 15:23:06,172 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 160 transitions, 554 flow [2025-03-04 15:23:06,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 65.47826086956522) internal successors, (1506), 23 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:06,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:06,173 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:06,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:23:06,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:23:06,373 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-03-04 15:23:06,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash 144329515, now seen corresponding path program 2 times [2025-03-04 15:23:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:06,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670758356] [2025-03-04 15:23:06,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:06,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:06,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 15:23:06,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-03-04 15:23:06,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:06,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:23:06,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:06,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670758356] [2025-03-04 15:23:06,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670758356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:06,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:06,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:23:06,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069335805] [2025-03-04 15:23:06,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:06,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:23:06,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:06,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:23:06,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:23:06,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 172 [2025-03-04 15:23:06,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 160 transitions, 554 flow. Second operand has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:06,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:06,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 172 [2025-03-04 15:23:06,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand