./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_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_76-tricky_address3_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 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:22:47,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:22:47,621 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:47,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:22:47,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:22:47,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:22:47,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:22:47,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:22:47,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:22:47,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:22:47,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:22:47,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:22:47,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:22:47,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:22:47,648 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:22:47,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:22:47,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:22:47,648 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:22:47,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:22:47,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:22:47,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:22:47,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:22:47,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:22:47,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:22:47,649 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:22:47,649 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:22:47,649 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:22:47,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:22:47,649 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:22:47,649 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:22:47,650 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:22:47,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:22:47,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:22:47,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:22:47,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:47,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:22:47,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:22:47,650 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:22:47,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:22:47,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:22:47,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:22:47,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:22:47,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:22:47,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:22:47,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:22:47,651 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 -> 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 [2025-03-04 15:22:47,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:22:47,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:22:47,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:22:47,907 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:22:47,908 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:22:47,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2025-03-04 15:22:49,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e12275d5/8cb089951ff24b0095e01b42e17b6c23/FLAGff169364f [2025-03-04 15:22:49,288 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:22:49,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2025-03-04 15:22:49,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e12275d5/8cb089951ff24b0095e01b42e17b6c23/FLAGff169364f [2025-03-04 15:22:49,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e12275d5/8cb089951ff24b0095e01b42e17b6c23 [2025-03-04 15:22:49,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:22:49,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:22:49,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:49,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:22:49,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:22:49,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:49" (1/1) ... [2025-03-04 15:22:49,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a9896a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:49, skipping insertion in model container [2025-03-04 15:22:49,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:49" (1/1) ... [2025-03-04 15:22:49,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:22:49,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:49,967 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:22:50,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:50,055 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:22:50,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:50 WrapperNode [2025-03-04 15:22:50,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:50,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:50,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:22:50,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:22:50,062 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:50" (1/1) ... [2025-03-04 15:22:50,075 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:50" (1/1) ... [2025-03-04 15:22:50,098 INFO L138 Inliner]: procedures = 271, calls = 110, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 276 [2025-03-04 15:22:50,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:50,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:22:50,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:22:50,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:22:50,105 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:50" (1/1) ... [2025-03-04 15:22:50,106 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:50" (1/1) ... [2025-03-04 15:22:50,109 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:50" (1/1) ... [2025-03-04 15:22:50,122 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 70, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-03-04 15:22:50,122 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:50" (1/1) ... [2025-03-04 15:22:50,122 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:50" (1/1) ... [2025-03-04 15:22:50,129 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:50" (1/1) ... [2025-03-04 15:22:50,130 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:50" (1/1) ... [2025-03-04 15:22:50,133 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:50" (1/1) ... [2025-03-04 15:22:50,134 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:50" (1/1) ... [2025-03-04 15:22:50,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:22:50,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:22:50,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:22:50,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:22:50,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:50" (1/1) ... [2025-03-04 15:22:50,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:50,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:50,162 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:50,166 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:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:22:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:22:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:22:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:22:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:22:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:22:50,180 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:22:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:22:50,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:22:50,181 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:50,294 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:22:50,296 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:22:50,598 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:50,599 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:50,674 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:22:50,674 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:22:51,010 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:22:51,010 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:22:51,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:51 BoogieIcfgContainer [2025-03-04 15:22:51,010 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:22:51,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:22:51,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:22:51,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:22:51,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:22:49" (1/3) ... [2025-03-04 15:22:51,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3e9f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:51, skipping insertion in model container [2025-03-04 15:22:51,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:50" (2/3) ... [2025-03-04 15:22:51,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3e9f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:51, skipping insertion in model container [2025-03-04 15:22:51,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:51" (3/3) ... [2025-03-04 15:22:51,018 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2025-03-04 15:22:51,029 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:22:51,031 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_76-tricky_address3_racefree.i that has 2 procedures, 89 locations, 1 initial locations, 11 loop locations, and 16 error locations. [2025-03-04 15:22:51,032 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:22:51,075 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:22:51,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 113 transitions, 233 flow [2025-03-04 15:22:51,150 INFO L124 PetriNetUnfolderBase]: 35/159 cut-off events. [2025-03-04 15:22:51,153 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:51,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 159 events. 35/159 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 633 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 98. Up to 8 conditions per place. [2025-03-04 15:22:51,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 113 transitions, 233 flow [2025-03-04 15:22:51,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 112 transitions, 231 flow [2025-03-04 15:22:51,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:51,180 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;@35e6ded6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:51,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 15:22:51,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:51,185 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:22:51,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:51,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:51,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:22:51,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:51,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash 667551, now seen corresponding path program 1 times [2025-03-04 15:22:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:51,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075190097] [2025-03-04 15:22:51,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:51,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:51,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:22:51,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:22:51,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:51,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:51,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:51,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075190097] [2025-03-04 15:22:51,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075190097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:51,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:51,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:51,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471109860] [2025-03-04 15:22:51,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:51,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:51,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:51,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:51,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:51,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 112 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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:51,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:51,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:51,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:51,802 INFO L124 PetriNetUnfolderBase]: 486/1471 cut-off events. [2025-03-04 15:22:51,803 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:51,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 1471 events. 486/1471 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9830 event pairs, 440 based on Foata normal form. 230/1515 useless extension candidates. Maximal degree in co-relation 2361. Up to 973 conditions per place. [2025-03-04 15:22:51,816 INFO L140 encePairwiseOnDemand]: 87/113 looper letters, 49 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2025-03-04 15:22:51,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 94 transitions, 299 flow [2025-03-04 15:22:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2025-03-04 15:22:51,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5376106194690266 [2025-03-04 15:22:51,830 INFO L175 Difference]: Start difference. First operand has 92 places, 112 transitions, 231 flow. Second operand 4 states and 243 transitions. [2025-03-04 15:22:51,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 94 transitions, 299 flow [2025-03-04 15:22:51,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 94 transitions, 299 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:51,837 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 215 flow [2025-03-04 15:22:51,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2025-03-04 15:22:51,841 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 5 predicate places. [2025-03-04 15:22:51,842 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 215 flow [2025-03-04 15:22:51,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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:51,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:51,842 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:22:51,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:22:51,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:51,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1587260876, now seen corresponding path program 1 times [2025-03-04 15:22:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645046360] [2025-03-04 15:22:51,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:51,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:51,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:51,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:51,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:51,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:51,971 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:51,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:51,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645046360] [2025-03-04 15:22:51,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645046360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:51,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57094679] [2025-03-04 15:22:51,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:51,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:51,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:51,975 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:51,976 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:52,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:52,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:52,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:52,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:52,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:22:52,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:52,103 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:52,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:22:52,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57094679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:52,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:22:52,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:22:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977072390] [2025-03-04 15:22:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:52,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:52,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:52,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:52,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:22:52,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:52,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 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:52,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:52,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:52,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:52,408 INFO L124 PetriNetUnfolderBase]: 486/1470 cut-off events. [2025-03-04 15:22:52,408 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:22:52,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 1470 events. 486/1470 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9812 event pairs, 440 based on Foata normal form. 1/1285 useless extension candidates. Maximal degree in co-relation 2443. Up to 968 conditions per place. [2025-03-04 15:22:52,418 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 45 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2025-03-04 15:22:52,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 93 transitions, 313 flow [2025-03-04 15:22:52,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 304 transitions. [2025-03-04 15:22:52,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44837758112094395 [2025-03-04 15:22:52,423 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 215 flow. Second operand 6 states and 304 transitions. [2025-03-04 15:22:52,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 93 transitions, 313 flow [2025-03-04 15:22:52,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 93 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:52,426 INFO L231 Difference]: Finished difference. Result has 100 places, 93 transitions, 221 flow [2025-03-04 15:22:52,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=100, PETRI_TRANSITIONS=93} [2025-03-04 15:22:52,427 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 8 predicate places. [2025-03-04 15:22:52,427 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 93 transitions, 221 flow [2025-03-04 15:22:52,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 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:52,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:52,427 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:22:52,434 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:52,628 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:52,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:52,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:52,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1960446335, now seen corresponding path program 1 times [2025-03-04 15:22:52,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:52,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285386340] [2025-03-04 15:22:52,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:52,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:22:52,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:22:52,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:52,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:52,695 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:52,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:52,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285386340] [2025-03-04 15:22:52,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285386340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:52,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:52,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:52,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518910599] [2025-03-04 15:22:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:52,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:22:52,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:52,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:22:52,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:22:52,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:52,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:52,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:52,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:52,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:52,879 INFO L124 PetriNetUnfolderBase]: 486/1469 cut-off events. [2025-03-04 15:22:52,879 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 15:22:52,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 1469 events. 486/1469 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9837 event pairs, 440 based on Foata normal form. 1/1285 useless extension candidates. Maximal degree in co-relation 2439. Up to 971 conditions per place. [2025-03-04 15:22:52,886 INFO L140 encePairwiseOnDemand]: 110/113 looper letters, 46 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2025-03-04 15:22:52,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 92 transitions, 317 flow [2025-03-04 15:22:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:22:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:22:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-03-04 15:22:52,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5162241887905604 [2025-03-04 15:22:52,888 INFO L175 Difference]: Start difference. First operand has 100 places, 93 transitions, 221 flow. Second operand 3 states and 175 transitions. [2025-03-04 15:22:52,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 92 transitions, 317 flow [2025-03-04 15:22:52,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 92 transitions, 295 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:22:52,890 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 203 flow [2025-03-04 15:22:52,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2025-03-04 15:22:52,891 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 3 predicate places. [2025-03-04 15:22:52,891 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 203 flow [2025-03-04 15:22:52,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:52,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:52,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:52,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:22:52,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:52,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1501877143, now seen corresponding path program 1 times [2025-03-04 15:22:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:52,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527599918] [2025-03-04 15:22:52,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:52,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:52,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:52,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:52,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:52,993 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:52,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:52,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527599918] [2025-03-04 15:22:52,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527599918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:52,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364431987] [2025-03-04 15:22:52,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:52,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:52,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:52,996 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:52,997 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:53,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:53,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:53,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:53,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:53,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:22:53,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:53,086 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:53,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:53,110 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:53,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364431987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:53,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:53,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:22:53,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697210476] [2025-03-04 15:22:53,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:53,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:22:53,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:53,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:22:53,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:22:53,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:53,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 203 flow. Second operand has 10 states, 10 states have (on average 43.3) internal successors, (433), 10 states have internal predecessors, (433), 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:53,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:53,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:53,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:53,362 INFO L124 PetriNetUnfolderBase]: 486/1473 cut-off events. [2025-03-04 15:22:53,363 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 15:22:53,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2466 conditions, 1473 events. 486/1473 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9827 event pairs, 440 based on Foata normal form. 2/1291 useless extension candidates. Maximal degree in co-relation 2432. Up to 969 conditions per place. [2025-03-04 15:22:53,369 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 46 selfloop transitions, 7 changer transitions 0/95 dead transitions. [2025-03-04 15:22:53,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 95 transitions, 324 flow [2025-03-04 15:22:53,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:22:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:22:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 349 transitions. [2025-03-04 15:22:53,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44121365360303416 [2025-03-04 15:22:53,373 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 203 flow. Second operand 7 states and 349 transitions. [2025-03-04 15:22:53,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 95 transitions, 324 flow [2025-03-04 15:22:53,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 95 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:53,375 INFO L231 Difference]: Finished difference. Result has 101 places, 95 transitions, 229 flow [2025-03-04 15:22:53,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=101, PETRI_TRANSITIONS=95} [2025-03-04 15:22:53,376 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 9 predicate places. [2025-03-04 15:22:53,376 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 95 transitions, 229 flow [2025-03-04 15:22:53,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 43.3) internal successors, (433), 10 states have internal predecessors, (433), 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:53,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:53,376 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:53,383 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:53,577 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:53,577 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:53,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:53,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1595349129, now seen corresponding path program 2 times [2025-03-04 15:22:53,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:53,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804430408] [2025-03-04 15:22:53,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:53,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:53,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:22:53,588 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:53,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:22:53,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:53,625 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:53,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:53,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804430408] [2025-03-04 15:22:53,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804430408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:53,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:53,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:53,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804951753] [2025-03-04 15:22:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:53,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:53,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:53,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:53,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:53,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 113 [2025-03-04 15:22:53,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 95 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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:53,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:53,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 113 [2025-03-04 15:22:53,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:53,810 INFO L124 PetriNetUnfolderBase]: 483/1356 cut-off events. [2025-03-04 15:22:53,810 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:22:53,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2356 conditions, 1356 events. 483/1356 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8966 event pairs, 0 based on Foata normal form. 21/1244 useless extension candidates. Maximal degree in co-relation 2317. Up to 912 conditions per place. [2025-03-04 15:22:53,817 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 92 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2025-03-04 15:22:53,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 134 transitions, 497 flow [2025-03-04 15:22:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2025-03-04 15:22:53,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5685840707964602 [2025-03-04 15:22:53,819 INFO L175 Difference]: Start difference. First operand has 101 places, 95 transitions, 229 flow. Second operand 4 states and 257 transitions. [2025-03-04 15:22:53,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 134 transitions, 497 flow [2025-03-04 15:22:53,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 134 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:53,825 INFO L231 Difference]: Finished difference. Result has 101 places, 93 transitions, 231 flow [2025-03-04 15:22:53,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=101, PETRI_TRANSITIONS=93} [2025-03-04 15:22:53,828 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 9 predicate places. [2025-03-04 15:22:53,828 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 93 transitions, 231 flow [2025-03-04 15:22:53,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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:53,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:53,828 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:53,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:22:53,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:53,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:53,829 INFO L85 PathProgramCache]: Analyzing trace with hash 174154424, now seen corresponding path program 1 times [2025-03-04 15:22:53,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:53,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502929641] [2025-03-04 15:22:53,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:53,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:53,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:22:53,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:22:53,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:53,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:53,925 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:53,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:53,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502929641] [2025-03-04 15:22:53,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502929641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:53,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:53,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670990922] [2025-03-04 15:22:53,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:53,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:53,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:53,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:53,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:53,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:53,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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:53,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:53,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:53,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:54,135 INFO L124 PetriNetUnfolderBase]: 506/1487 cut-off events. [2025-03-04 15:22:54,136 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-04 15:22:54,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2557 conditions, 1487 events. 506/1487 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9895 event pairs, 378 based on Foata normal form. 23/1344 useless extension candidates. Maximal degree in co-relation 2518. Up to 875 conditions per place. [2025-03-04 15:22:54,142 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 95 selfloop transitions, 3 changer transitions 0/136 dead transitions. [2025-03-04 15:22:54,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 136 transitions, 521 flow [2025-03-04 15:22:54,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-03-04 15:22:54,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5796460176991151 [2025-03-04 15:22:54,144 INFO L175 Difference]: Start difference. First operand has 101 places, 93 transitions, 231 flow. Second operand 4 states and 262 transitions. [2025-03-04 15:22:54,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 136 transitions, 521 flow [2025-03-04 15:22:54,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 136 transitions, 511 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:22:54,146 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 229 flow [2025-03-04 15:22:54,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2025-03-04 15:22:54,147 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 8 predicate places. [2025-03-04 15:22:54,148 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 229 flow [2025-03-04 15:22:54,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:54,148 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:54,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:22:54,148 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:54,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:54,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1062771755, now seen corresponding path program 1 times [2025-03-04 15:22:54,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:54,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490181772] [2025-03-04 15:22:54,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:54,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:54,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:22:54,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:22:54,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:54,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:54,277 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:54,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:54,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490181772] [2025-03-04 15:22:54,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490181772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:54,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767491910] [2025-03-04 15:22:54,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:54,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:54,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:54,280 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:54,281 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:54,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:22:54,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:22:54,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:54,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:54,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:22:54,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:54,377 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:54,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:54,440 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:54,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767491910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:54,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:54,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:22:54,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928524463] [2025-03-04 15:22:54,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:54,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:22:54,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:54,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:22:54,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:22:54,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:54,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 229 flow. Second operand has 18 states, 18 states have (on average 43.22222222222222) internal successors, (778), 18 states have internal predecessors, (778), 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,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:54,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:54,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:54,722 INFO L124 PetriNetUnfolderBase]: 485/1452 cut-off events. [2025-03-04 15:22:54,722 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-03-04 15:22:54,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2545 conditions, 1452 events. 485/1452 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9472 event pairs, 440 based on Foata normal form. 4/1313 useless extension candidates. Maximal degree in co-relation 2470. Up to 947 conditions per place. [2025-03-04 15:22:54,728 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 46 selfloop transitions, 15 changer transitions 0/100 dead transitions. [2025-03-04 15:22:54,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 399 flow [2025-03-04 15:22:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:22:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:22:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 695 transitions. [2025-03-04 15:22:54,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41002949852507375 [2025-03-04 15:22:54,730 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 229 flow. Second operand 15 states and 695 transitions. [2025-03-04 15:22:54,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 399 flow [2025-03-04 15:22:54,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 393 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:22:54,733 INFO L231 Difference]: Finished difference. Result has 115 places, 100 transitions, 320 flow [2025-03-04 15:22:54,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=320, PETRI_PLACES=115, PETRI_TRANSITIONS=100} [2025-03-04 15:22:54,733 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 23 predicate places. [2025-03-04 15:22:54,733 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 100 transitions, 320 flow [2025-03-04 15:22:54,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 43.22222222222222) internal successors, (778), 18 states have internal predecessors, (778), 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,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:54,734 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:54,742 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:54,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:54,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:54,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash -212691861, now seen corresponding path program 2 times [2025-03-04 15:22:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:54,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664356550] [2025-03-04 15:22:54,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:54,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:54,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:22:54,970 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:54,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:22:54,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:55,207 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:55,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:55,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664356550] [2025-03-04 15:22:55,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664356550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:55,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839309645] [2025-03-04 15:22:55,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:22:55,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:55,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:55,209 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:55,210 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:55,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:22:55,300 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:55,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:22:55,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:55,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:22:55,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:55,354 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:55,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:22:55,499 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:55,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839309645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:22:55,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:22:55,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-04 15:22:55,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18330623] [2025-03-04 15:22:55,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:22:55,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:22:55,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:55,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:22:55,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:22:55,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 113 [2025-03-04 15:22:55,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 100 transitions, 320 flow. Second operand has 23 states, 23 states have (on average 43.21739130434783) internal successors, (994), 23 states have internal predecessors, (994), 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:55,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:55,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 113 [2025-03-04 15:22:55,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:55,806 INFO L124 PetriNetUnfolderBase]: 485/1467 cut-off events. [2025-03-04 15:22:55,806 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-03-04 15:22:55,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2543 conditions, 1467 events. 485/1467 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 9557 event pairs, 440 based on Foata normal form. 3/1326 useless extension candidates. Maximal degree in co-relation 2408. Up to 944 conditions per place. [2025-03-04 15:22:55,812 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 46 selfloop transitions, 21 changer transitions 0/106 dead transitions. [2025-03-04 15:22:55,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 106 transitions, 508 flow [2025-03-04 15:22:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:22:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:22:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 952 transitions. [2025-03-04 15:22:55,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40117994100294985 [2025-03-04 15:22:55,816 INFO L175 Difference]: Start difference. First operand has 115 places, 100 transitions, 320 flow. Second operand 21 states and 952 transitions. [2025-03-04 15:22:55,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 106 transitions, 508 flow [2025-03-04 15:22:55,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 106 transitions, 498 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:22:55,818 INFO L231 Difference]: Finished difference. Result has 134 places, 106 transitions, 421 flow [2025-03-04 15:22:55,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=421, PETRI_PLACES=134, PETRI_TRANSITIONS=106} [2025-03-04 15:22:55,819 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 42 predicate places. [2025-03-04 15:22:55,819 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 106 transitions, 421 flow [2025-03-04 15:22:55,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 43.21739130434783) internal successors, (994), 23 states have internal predecessors, (994), 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:55,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:55,820 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:55,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:22:56,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:56,026 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:22:56,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:56,026 INFO L85 PathProgramCache]: Analyzing trace with hash -776277866, now seen corresponding path program 3 times [2025-03-04 15:22:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380296797] [2025-03-04 15:22:56,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:22:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:56,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 11 equivalence classes. [2025-03-04 15:22:56,088 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:56,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:22:56,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:56,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:56,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:22:56,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:22:56,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:56,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:56,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:56,129 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:56,132 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-04 15:22:56,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2025-03-04 15:22:56,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2025-03-04 15:22:56,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2025-03-04 15:22:56,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2025-03-04 15:22:56,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2025-03-04 15:22:56,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2025-03-04 15:22:56,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2025-03-04 15:22:56,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2025-03-04 15:22:56,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:22:56,139 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2025-03-04 15:22:56,141 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:56,141 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:22:56,175 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:22:56,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 162 transitions, 340 flow [2025-03-04 15:22:56,190 INFO L124 PetriNetUnfolderBase]: 59/273 cut-off events. [2025-03-04 15:22:56,190 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:22:56,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 273 events. 59/273 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1246 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 161. Up to 12 conditions per place. [2025-03-04 15:22:56,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 162 transitions, 340 flow [2025-03-04 15:22:56,194 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 162 transitions, 340 flow [2025-03-04 15:22:56,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:56,194 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;@35e6ded6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:56,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-04 15:22:56,195 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:56,196 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:22:56,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:56,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:56,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:22:56,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:56,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash 828417, now seen corresponding path program 1 times [2025-03-04 15:22:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:56,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120389243] [2025-03-04 15:22:56,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:56,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:56,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:22:56,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:22:56,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:56,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:56,227 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:56,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:56,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120389243] [2025-03-04 15:22:56,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120389243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:56,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:56,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654933736] [2025-03-04 15:22:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:56,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:56,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:56,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:56,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:56,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:22:56,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 162 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:56,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:56,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:22:56,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:58,905 INFO L124 PetriNetUnfolderBase]: 20921/43350 cut-off events. [2025-03-04 15:22:58,905 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-04 15:22:58,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74649 conditions, 43350 events. 20921/43350 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 435108 event pairs, 19440 based on Foata normal form. 7691/46338 useless extension candidates. Maximal degree in co-relation 58580. Up to 31185 conditions per place. [2025-03-04 15:22:59,130 INFO L140 encePairwiseOnDemand]: 126/162 looper letters, 72 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2025-03-04 15:22:59,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 134 transitions, 434 flow [2025-03-04 15:22:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 344 transitions. [2025-03-04 15:22:59,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2025-03-04 15:22:59,132 INFO L175 Difference]: Start difference. First operand has 131 places, 162 transitions, 340 flow. Second operand 4 states and 344 transitions. [2025-03-04 15:22:59,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 134 transitions, 434 flow [2025-03-04 15:22:59,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 134 transitions, 434 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:59,135 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 304 flow [2025-03-04 15:22:59,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=136, PETRI_TRANSITIONS=134} [2025-03-04 15:22:59,135 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 5 predicate places. [2025-03-04 15:22:59,135 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 304 flow [2025-03-04 15:22:59,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:59,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:59,136 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:22:59,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:22:59,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:59,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1089708300, now seen corresponding path program 1 times [2025-03-04 15:22:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:59,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133123618] [2025-03-04 15:22:59,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:59,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:59,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:59,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:59,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:59,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:59,189 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:59,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:59,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133123618] [2025-03-04 15:22:59,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133123618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:22:59,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155414358] [2025-03-04 15:22:59,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:59,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:22:59,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:59,192 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:59,194 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:59,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:22:59,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:22:59,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:59,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:59,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:22:59,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:22:59,280 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:59,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:22:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155414358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:59,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:22:59,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:22:59,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920124784] [2025-03-04 15:22:59,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:59,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:59,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:59,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:59,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:22:59,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:22:59,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 59.833333333333336) internal successors, (359), 6 states have internal predecessors, (359), 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:59,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:59,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:22:59,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:01,569 INFO L124 PetriNetUnfolderBase]: 20921/43349 cut-off events. [2025-03-04 15:23:01,570 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-03-04 15:23:01,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74659 conditions, 43349 events. 20921/43349 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 435214 event pairs, 19440 based on Foata normal form. 1/38647 useless extension candidates. Maximal degree in co-relation 74640. Up to 31180 conditions per place. [2025-03-04 15:23:01,788 INFO L140 encePairwiseOnDemand]: 157/162 looper letters, 68 selfloop transitions, 6 changer transitions 0/133 dead transitions. [2025-03-04 15:23:01,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 448 flow [2025-03-04 15:23:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:23:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:23:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2025-03-04 15:23:01,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44135802469135804 [2025-03-04 15:23:01,790 INFO L175 Difference]: Start difference. First operand has 136 places, 134 transitions, 304 flow. Second operand 6 states and 429 transitions. [2025-03-04 15:23:01,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 448 flow [2025-03-04 15:23:01,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 133 transitions, 446 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:01,793 INFO L231 Difference]: Finished difference. Result has 139 places, 133 transitions, 310 flow [2025-03-04 15:23:01,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=139, PETRI_TRANSITIONS=133} [2025-03-04 15:23:01,794 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 8 predicate places. [2025-03-04 15:23:01,795 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 133 transitions, 310 flow [2025-03-04 15:23:01,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.833333333333336) internal successors, (359), 6 states have internal predecessors, (359), 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,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:01,795 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:23:01,809 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:23:01,995 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,SelfDestructingSolverStorable10 [2025-03-04 15:23:01,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:01,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash 578781795, now seen corresponding path program 1 times [2025-03-04 15:23:01,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:01,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911280235] [2025-03-04 15:23:01,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:01,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:02,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:23:02,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:23:02,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:02,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:02,022 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:23:02,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:02,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911280235] [2025-03-04 15:23:02,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911280235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:02,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:02,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:02,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575049284] [2025-03-04 15:23:02,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:02,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:02,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:02,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:02,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:02,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:02,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 133 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:02,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:02,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:04,437 INFO L124 PetriNetUnfolderBase]: 20921/43348 cut-off events. [2025-03-04 15:23:04,437 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2025-03-04 15:23:04,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74661 conditions, 43348 events. 20921/43348 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 435122 event pairs, 19440 based on Foata normal form. 1/38647 useless extension candidates. Maximal degree in co-relation 74636. Up to 31183 conditions per place. [2025-03-04 15:23:04,631 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 69 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-03-04 15:23:04,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 132 transitions, 452 flow [2025-03-04 15:23:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-03-04 15:23:04,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5123456790123457 [2025-03-04 15:23:04,636 INFO L175 Difference]: Start difference. First operand has 139 places, 133 transitions, 310 flow. Second operand 3 states and 249 transitions. [2025-03-04 15:23:04,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 132 transitions, 452 flow [2025-03-04 15:23:04,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 132 transitions, 430 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:23:04,639 INFO L231 Difference]: Finished difference. Result has 134 places, 132 transitions, 292 flow [2025-03-04 15:23:04,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=134, PETRI_TRANSITIONS=132} [2025-03-04 15:23:04,640 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 3 predicate places. [2025-03-04 15:23:04,640 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 132 transitions, 292 flow [2025-03-04 15:23:04,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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:04,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:04,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:04,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:23:04,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:04,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2136231000, now seen corresponding path program 1 times [2025-03-04 15:23:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:04,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919669450] [2025-03-04 15:23:04,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:04,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:23:04,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:23:04,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:04,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:04,689 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:23:04,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919669450] [2025-03-04 15:23:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919669450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694453099] [2025-03-04 15:23:04,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:04,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:04,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:04,691 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:23:04,694 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:23:04,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:23:04,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:23:04,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:04,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:04,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:23:04,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:04,774 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:23:04,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:04,793 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:23:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694453099] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:04,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:04,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:23:04,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464952219] [2025-03-04 15:23:04,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:04,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:23:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:04,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:23:04,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:23:04,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:04,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 132 transitions, 292 flow. Second operand has 10 states, 10 states have (on average 60.3) internal successors, (603), 10 states have internal predecessors, (603), 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:04,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:04,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:04,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:07,085 INFO L124 PetriNetUnfolderBase]: 20921/43352 cut-off events. [2025-03-04 15:23:07,085 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-03-04 15:23:07,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74664 conditions, 43352 events. 20921/43352 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 435091 event pairs, 19440 based on Foata normal form. 2/38653 useless extension candidates. Maximal degree in co-relation 74629. Up to 31181 conditions per place. [2025-03-04 15:23:07,286 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 69 selfloop transitions, 7 changer transitions 0/135 dead transitions. [2025-03-04 15:23:07,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 135 transitions, 459 flow [2025-03-04 15:23:07,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:23:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:23:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 491 transitions. [2025-03-04 15:23:07,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4329805996472663 [2025-03-04 15:23:07,288 INFO L175 Difference]: Start difference. First operand has 134 places, 132 transitions, 292 flow. Second operand 7 states and 491 transitions. [2025-03-04 15:23:07,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 135 transitions, 459 flow [2025-03-04 15:23:07,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 135 transitions, 445 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:07,291 INFO L231 Difference]: Finished difference. Result has 140 places, 135 transitions, 318 flow [2025-03-04 15:23:07,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=140, PETRI_TRANSITIONS=135} [2025-03-04 15:23:07,293 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 9 predicate places. [2025-03-04 15:23:07,293 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 135 transitions, 318 flow [2025-03-04 15:23:07,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 60.3) internal successors, (603), 10 states have internal predecessors, (603), 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:07,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:07,293 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:07,300 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:23:07,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:07,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:07,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:07,494 INFO L85 PathProgramCache]: Analyzing trace with hash 801772232, now seen corresponding path program 2 times [2025-03-04 15:23:07,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:07,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266830075] [2025-03-04 15:23:07,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:07,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:07,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:23:07,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:23:07,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:07,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:07,538 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:23:07,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:07,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266830075] [2025-03-04 15:23:07,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266830075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:07,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:07,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:07,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643084251] [2025-03-04 15:23:07,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:07,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:07,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:07,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:07,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:07,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 162 [2025-03-04 15:23:07,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 135 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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:07,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:07,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 162 [2025-03-04 15:23:07,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:10,207 INFO L124 PetriNetUnfolderBase]: 23017/45811 cut-off events. [2025-03-04 15:23:10,207 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-04 15:23:10,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80506 conditions, 45811 events. 23017/45811 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 449239 event pairs, 11716 based on Foata normal form. 21/40675 useless extension candidates. Maximal degree in co-relation 80466. Up to 34500 conditions per place. [2025-03-04 15:23:10,381 INFO L140 encePairwiseOnDemand]: 156/162 looper letters, 119 selfloop transitions, 3 changer transitions 0/178 dead transitions. [2025-03-04 15:23:10,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 178 transitions, 648 flow [2025-03-04 15:23:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2025-03-04 15:23:10,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2025-03-04 15:23:10,383 INFO L175 Difference]: Start difference. First operand has 140 places, 135 transitions, 318 flow. Second operand 4 states and 352 transitions. [2025-03-04 15:23:10,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 178 transitions, 648 flow [2025-03-04 15:23:10,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 178 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:10,386 INFO L231 Difference]: Finished difference. Result has 143 places, 137 transitions, 338 flow [2025-03-04 15:23:10,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=338, PETRI_PLACES=143, PETRI_TRANSITIONS=137} [2025-03-04 15:23:10,386 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 12 predicate places. [2025-03-04 15:23:10,386 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 137 transitions, 338 flow [2025-03-04 15:23:10,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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:10,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:10,387 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:10,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:23:10,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:10,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1705316873, now seen corresponding path program 1 times [2025-03-04 15:23:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:10,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004228733] [2025-03-04 15:23:10,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:10,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:10,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:23:10,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:23:10,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:10,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:10,438 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:23:10,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:10,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004228733] [2025-03-04 15:23:10,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004228733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:10,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:10,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:10,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317347282] [2025-03-04 15:23:10,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:10,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:10,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:10,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:10,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:10,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 137 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:10,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:10,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:10,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:13,081 INFO L124 PetriNetUnfolderBase]: 21407/40320 cut-off events. [2025-03-04 15:23:13,081 INFO L125 PetriNetUnfolderBase]: For 1134/2063 co-relation queries the response was YES. [2025-03-04 15:23:13,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73580 conditions, 40320 events. 21407/40320 cut-off events. For 1134/2063 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 384955 event pairs, 440 based on Foata normal form. 526/37106 useless extension candidates. Maximal degree in co-relation 73539. Up to 28198 conditions per place. [2025-03-04 15:23:13,270 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 167 selfloop transitions, 3 changer transitions 0/228 dead transitions. [2025-03-04 15:23:13,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 228 transitions, 890 flow [2025-03-04 15:23:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2025-03-04 15:23:13,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6157407407407407 [2025-03-04 15:23:13,274 INFO L175 Difference]: Start difference. First operand has 143 places, 137 transitions, 338 flow. Second operand 4 states and 399 transitions. [2025-03-04 15:23:13,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 228 transitions, 890 flow [2025-03-04 15:23:13,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 228 transitions, 886 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:13,278 INFO L231 Difference]: Finished difference. Result has 144 places, 136 transitions, 340 flow [2025-03-04 15:23:13,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=144, PETRI_TRANSITIONS=136} [2025-03-04 15:23:13,279 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 13 predicate places. [2025-03-04 15:23:13,279 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 136 transitions, 340 flow [2025-03-04 15:23:13,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:13,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:13,280 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:13,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:23:13,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:13,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1325216312, now seen corresponding path program 1 times [2025-03-04 15:23:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:13,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609189664] [2025-03-04 15:23:13,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:13,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:23:13,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:23:13,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:13,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:13,320 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:23:13,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:13,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609189664] [2025-03-04 15:23:13,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609189664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:13,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:13,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:13,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043918296] [2025-03-04 15:23:13,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:13,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:13,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:13,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:13,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:13,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:13,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 136 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:13,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:13,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:13,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:15,798 INFO L124 PetriNetUnfolderBase]: 20832/43282 cut-off events. [2025-03-04 15:23:15,798 INFO L125 PetriNetUnfolderBase]: For 2470/3347 co-relation queries the response was YES. [2025-03-04 15:23:15,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76997 conditions, 43282 events. 20832/43282 cut-off events. For 2470/3347 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 434715 event pairs, 16531 based on Foata normal form. 526/39582 useless extension candidates. Maximal degree in co-relation 76956. Up to 26767 conditions per place. [2025-03-04 15:23:16,010 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 166 selfloop transitions, 3 changer transitions 0/227 dead transitions. [2025-03-04 15:23:16,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 227 transitions, 888 flow [2025-03-04 15:23:16,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2025-03-04 15:23:16,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6141975308641975 [2025-03-04 15:23:16,012 INFO L175 Difference]: Start difference. First operand has 144 places, 136 transitions, 340 flow. Second operand 4 states and 398 transitions. [2025-03-04 15:23:16,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 227 transitions, 888 flow [2025-03-04 15:23:16,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 227 transitions, 882 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:16,017 INFO L231 Difference]: Finished difference. Result has 143 places, 135 transitions, 338 flow [2025-03-04 15:23:16,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=338, PETRI_PLACES=143, PETRI_TRANSITIONS=135} [2025-03-04 15:23:16,018 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 12 predicate places. [2025-03-04 15:23:16,018 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 135 transitions, 338 flow [2025-03-04 15:23:16,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:16,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:16,018 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:16,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:23:16,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:16,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:16,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1429502607, now seen corresponding path program 1 times [2025-03-04 15:23:16,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:16,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947461433] [2025-03-04 15:23:16,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:16,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:16,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:23:16,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:23:16,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:16,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:16,113 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:23:16,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947461433] [2025-03-04 15:23:16,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947461433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017105877] [2025-03-04 15:23:16,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:16,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:16,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:16,116 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:23:16,118 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:23:16,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:23:16,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:23:16,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:16,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:16,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:23:16,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:16,224 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:23:16,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:16,291 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:23:16,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017105877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:16,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:16,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:23:16,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223902560] [2025-03-04 15:23:16,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:16,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:23:16,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:16,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:23:16,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:23:16,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:16,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 135 transitions, 338 flow. Second operand has 18 states, 18 states have (on average 60.27777777777778) internal successors, (1085), 18 states have internal predecessors, (1085), 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:16,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:16,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:16,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:19,262 INFO L124 PetriNetUnfolderBase]: 20919/43590 cut-off events. [2025-03-04 15:23:19,263 INFO L125 PetriNetUnfolderBase]: For 2583/3453 co-relation queries the response was YES. [2025-03-04 15:23:19,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77419 conditions, 43590 events. 20919/43590 cut-off events. For 2583/3453 co-relation queries the response was YES. Maximal size of possible extension queue 1171. Compared 438849 event pairs, 19440 based on Foata normal form. 22/39264 useless extension candidates. Maximal degree in co-relation 77342. Up to 31203 conditions per place. [2025-03-04 15:23:19,448 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 70 selfloop transitions, 15 changer transitions 0/143 dead transitions. [2025-03-04 15:23:19,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 143 transitions, 556 flow [2025-03-04 15:23:19,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:23:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:23:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 973 transitions. [2025-03-04 15:23:19,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40041152263374485 [2025-03-04 15:23:19,450 INFO L175 Difference]: Start difference. First operand has 143 places, 135 transitions, 338 flow. Second operand 15 states and 973 transitions. [2025-03-04 15:23:19,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 143 transitions, 556 flow [2025-03-04 15:23:19,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 143 transitions, 550 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:19,454 INFO L231 Difference]: Finished difference. Result has 158 places, 143 transitions, 429 flow [2025-03-04 15:23:19,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=429, PETRI_PLACES=158, PETRI_TRANSITIONS=143} [2025-03-04 15:23:19,455 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 27 predicate places. [2025-03-04 15:23:19,455 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 143 transitions, 429 flow [2025-03-04 15:23:19,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 60.27777777777778) internal successors, (1085), 18 states have internal predecessors, (1085), 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:19,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:19,456 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:19,462 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:23:19,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:19,660 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:19,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash -273601457, now seen corresponding path program 2 times [2025-03-04 15:23:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:19,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870647020] [2025-03-04 15:23:19,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:19,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:19,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 15:23:19,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 32 statements. [2025-03-04 15:23:19,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:19,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:19,713 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:23:19,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:19,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870647020] [2025-03-04 15:23:19,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870647020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:19,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:19,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:23:19,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031152450] [2025-03-04 15:23:19,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:19,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:23:19,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:19,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:23:19,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:23:19,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 162 [2025-03-04 15:23:19,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 143 transitions, 429 flow. Second operand has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 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:19,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:19,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 162 [2025-03-04 15:23:19,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:22,947 INFO L124 PetriNetUnfolderBase]: 21731/41748 cut-off events. [2025-03-04 15:23:22,947 INFO L125 PetriNetUnfolderBase]: For 1878/1878 co-relation queries the response was YES. [2025-03-04 15:23:23,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76592 conditions, 41748 events. 21731/41748 cut-off events. For 1878/1878 co-relation queries the response was YES. Maximal size of possible extension queue 1168. Compared 401441 event pairs, 819 based on Foata normal form. 441/38439 useless extension candidates. Maximal degree in co-relation 76491. Up to 26688 conditions per place. [2025-03-04 15:23:23,137 INFO L140 encePairwiseOnDemand]: 157/162 looper letters, 203 selfloop transitions, 6 changer transitions 0/263 dead transitions. [2025-03-04 15:23:23,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 263 transitions, 1085 flow [2025-03-04 15:23:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:23:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:23:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 545 transitions. [2025-03-04 15:23:23,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606995884773662 [2025-03-04 15:23:23,139 INFO L175 Difference]: Start difference. First operand has 158 places, 143 transitions, 429 flow. Second operand 6 states and 545 transitions. [2025-03-04 15:23:23,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 263 transitions, 1085 flow [2025-03-04 15:23:23,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 263 transitions, 1075 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:23:23,143 INFO L231 Difference]: Finished difference. Result has 158 places, 142 transitions, 427 flow [2025-03-04 15:23:23,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=427, PETRI_PLACES=158, PETRI_TRANSITIONS=142} [2025-03-04 15:23:23,143 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 27 predicate places. [2025-03-04 15:23:23,143 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 142 transitions, 427 flow [2025-03-04 15:23:23,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 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:23,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:23,144 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:23,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:23:23,144 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:23,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:23,144 INFO L85 PathProgramCache]: Analyzing trace with hash 108290165, now seen corresponding path program 1 times [2025-03-04 15:23:23,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:23,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104687546] [2025-03-04 15:23:23,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:23,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:23,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:23:23,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:23:23,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:23,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:23,201 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:23:23,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:23,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104687546] [2025-03-04 15:23:23,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104687546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:23,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785674940] [2025-03-04 15:23:23,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:23,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:23,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:23,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:23,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:23,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 162 [2025-03-04 15:23:23,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 142 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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:23,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:23,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 162 [2025-03-04 15:23:23,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:25,690 INFO L124 PetriNetUnfolderBase]: 21290/40509 cut-off events. [2025-03-04 15:23:25,690 INFO L125 PetriNetUnfolderBase]: For 3442/3442 co-relation queries the response was YES. [2025-03-04 15:23:25,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75471 conditions, 40509 events. 21290/40509 cut-off events. For 3442/3442 co-relation queries the response was YES. Maximal size of possible extension queue 1110. Compared 382927 event pairs, 1280 based on Foata normal form. 441/37801 useless extension candidates. Maximal degree in co-relation 75374. Up to 28410 conditions per place. [2025-03-04 15:23:26,075 INFO L140 encePairwiseOnDemand]: 157/162 looper letters, 162 selfloop transitions, 6 changer transitions 0/222 dead transitions. [2025-03-04 15:23:26,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 921 flow [2025-03-04 15:23:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 386 transitions. [2025-03-04 15:23:26,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.595679012345679 [2025-03-04 15:23:26,077 INFO L175 Difference]: Start difference. First operand has 158 places, 142 transitions, 427 flow. Second operand 4 states and 386 transitions. [2025-03-04 15:23:26,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 921 flow [2025-03-04 15:23:26,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 222 transitions, 905 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:23:26,120 INFO L231 Difference]: Finished difference. Result has 156 places, 142 transitions, 427 flow [2025-03-04 15:23:26,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=427, PETRI_PLACES=156, PETRI_TRANSITIONS=142} [2025-03-04 15:23:26,121 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 25 predicate places. [2025-03-04 15:23:26,121 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 142 transitions, 427 flow [2025-03-04 15:23:26,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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:26,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:26,121 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:26,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:23:26,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:26,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash -935200368, now seen corresponding path program 1 times [2025-03-04 15:23:26,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:26,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826955125] [2025-03-04 15:23:26,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:26,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:26,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:23:26,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:23:26,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:26,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:26,173 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:23:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:26,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826955125] [2025-03-04 15:23:26,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826955125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:26,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:26,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100908461] [2025-03-04 15:23:26,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:26,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:26,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:26,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:26,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:26,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:26,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 142 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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:26,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:26,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:26,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:28,915 INFO L124 PetriNetUnfolderBase]: 21406/40544 cut-off events. [2025-03-04 15:23:28,915 INFO L125 PetriNetUnfolderBase]: For 4069/4069 co-relation queries the response was YES. [2025-03-04 15:23:29,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74840 conditions, 40544 events. 21406/40544 cut-off events. For 4069/4069 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 379946 event pairs, 900 based on Foata normal form. 487/37270 useless extension candidates. Maximal degree in co-relation 74745. Up to 27381 conditions per place. [2025-03-04 15:23:29,117 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 172 selfloop transitions, 3 changer transitions 0/229 dead transitions. [2025-03-04 15:23:29,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 229 transitions, 975 flow [2025-03-04 15:23:29,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2025-03-04 15:23:29,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6126543209876543 [2025-03-04 15:23:29,119 INFO L175 Difference]: Start difference. First operand has 156 places, 142 transitions, 427 flow. Second operand 4 states and 397 transitions. [2025-03-04 15:23:29,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 229 transitions, 975 flow [2025-03-04 15:23:29,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 229 transitions, 963 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:29,122 INFO L231 Difference]: Finished difference. Result has 156 places, 141 transitions, 423 flow [2025-03-04 15:23:29,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=423, PETRI_PLACES=156, PETRI_TRANSITIONS=141} [2025-03-04 15:23:29,123 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 25 predicate places. [2025-03-04 15:23:29,123 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 141 transitions, 423 flow [2025-03-04 15:23:29,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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:29,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:29,123 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:29,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:23:29,123 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:23:29,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:29,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1057433333, now seen corresponding path program 1 times [2025-03-04 15:23:29,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:29,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122882634] [2025-03-04 15:23:29,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:29,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:29,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:23:29,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:23:29,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:29,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:29,296 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:29,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:29,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122882634] [2025-03-04 15:23:29,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122882634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:29,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970141209] [2025-03-04 15:23:29,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:29,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:29,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:29,298 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:29,299 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:29,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:23:29,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:23:29,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:29,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:29,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:23:29,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:29,429 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:29,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:29,552 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:29,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970141209] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:29,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:29,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-04 15:23:29,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44640208] [2025-03-04 15:23:29,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:29,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:23:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:29,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:23:29,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:23:29,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-04 15:23:29,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 141 transitions, 423 flow. Second operand has 23 states, 23 states have (on average 60.52173913043478) internal successors, (1392), 23 states have internal predecessors, (1392), 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:29,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:29,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-04 15:23:29,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand