./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:06:57,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:06:57,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:06:57,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:06:57,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:06:57,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:06:57,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:06:57,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:06:57,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:06:57,397 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:06:57,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:06:57,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:06:57,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:06:57,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:06:57,400 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:06:57,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:06:57,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:06:57,400 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:06:57,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:06:57,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:06:57,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:06:57,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:06:57,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:06:57,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:06:57,401 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:06:57,401 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:06:57,401 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:06:57,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:06:57,401 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:06:57,401 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:06:57,402 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:06:57,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:06:57,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:06:57,403 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc [2025-02-08 14:06:57,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:06:57,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:06:57,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:06:57,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:06:57,716 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:06:57,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2025-02-08 14:06:59,020 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbab59d77/213fbb3e6ec44f5ea9b5fe8f12d968e4/FLAG3a93bad81 [2025-02-08 14:06:59,357 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:06:59,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2025-02-08 14:06:59,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbab59d77/213fbb3e6ec44f5ea9b5fe8f12d968e4/FLAG3a93bad81 [2025-02-08 14:06:59,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dbab59d77/213fbb3e6ec44f5ea9b5fe8f12d968e4 [2025-02-08 14:06:59,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:06:59,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:06:59,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:06:59,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:06:59,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:06:59,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:06:59" (1/1) ... [2025-02-08 14:06:59,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70bda0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:59, skipping insertion in model container [2025-02-08 14:06:59,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:06:59" (1/1) ... [2025-02-08 14:06:59,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:06:59,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:06:59,951 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:07:00,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:07:00,076 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:07:00,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00 WrapperNode [2025-02-08 14:07:00,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:07:00,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:07:00,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:07:00,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:07:00,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (1/1) ... [2025-02-08 14:07:00,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (1/1) ... [2025-02-08 14:07:00,147 INFO L138 Inliner]: procedures = 272, calls = 65, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 230 [2025-02-08 14:07:00,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:07:00,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:07:00,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:07:00,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:07:00,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (1/1) ... [2025-02-08 14:07:00,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (1/1) ... [2025-02-08 14:07:00,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (1/1) ... [2025-02-08 14:07:00,179 INFO L175 MemorySlicer]: Split 35 memory accesses to 4 slices as follows [2, 5, 26, 2]. 74 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 5, 16, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-02-08 14:07:00,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (1/1) ... [2025-02-08 14:07:00,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (1/1) ... [2025-02-08 14:07:00,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (1/1) ... [2025-02-08 14:07:00,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (1/1) ... [2025-02-08 14:07:00,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (1/1) ... [2025-02-08 14:07:00,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (1/1) ... [2025-02-08 14:07:00,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:07:00,194 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:07:00,194 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:07:00,194 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:07:00,195 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (1/1) ... [2025-02-08 14:07:00,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:07:00,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:07:00,219 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 14:07:00,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 14:07:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:07:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:07:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 14:07:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:07:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:07:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:07:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:07:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:07:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:07:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:07:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:07:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 14:07:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:07:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 14:07:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 14:07:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:07:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:07:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:07:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:07:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:07:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:07:00,239 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:07:00,368 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:07:00,370 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:07:00,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 14:07:00,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 14:07:00,707 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:07:00,707 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:07:00,906 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:07:00,908 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:07:00,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:07:00 BoogieIcfgContainer [2025-02-08 14:07:00,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:07:00,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:07:00,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:07:00,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:07:00,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:06:59" (1/3) ... [2025-02-08 14:07:00,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4913bba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:07:00, skipping insertion in model container [2025-02-08 14:07:00,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:07:00" (2/3) ... [2025-02-08 14:07:00,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4913bba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:07:00, skipping insertion in model container [2025-02-08 14:07:00,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:07:00" (3/3) ... [2025-02-08 14:07:00,918 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_79-equ_racefree.i [2025-02-08 14:07:00,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:07:00,931 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_79-equ_racefree.i that has 2 procedures, 100 locations, 1 initial locations, 12 loop locations, and 16 error locations. [2025-02-08 14:07:00,932 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:07:00,998 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 14:07:01,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 125 transitions, 257 flow [2025-02-08 14:07:01,090 INFO L124 PetriNetUnfolderBase]: 36/176 cut-off events. [2025-02-08 14:07:01,093 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:07:01,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 176 events. 36/176 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 676 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 103. Up to 8 conditions per place. [2025-02-08 14:07:01,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 125 transitions, 257 flow [2025-02-08 14:07:01,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 123 transitions, 253 flow [2025-02-08 14:07:01,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:07:01,125 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;@7f8570b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:07:01,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-08 14:07:01,132 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:07:01,132 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-02-08 14:07:01,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:07:01,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:01,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:01,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:07:01,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:01,138 INFO L85 PathProgramCache]: Analyzing trace with hash 17833073, now seen corresponding path program 1 times [2025-02-08 14:07:01,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:01,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441559613] [2025-02-08 14:07:01,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:01,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:01,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:01,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:01,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:01,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441559613] [2025-02-08 14:07:01,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441559613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:01,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:01,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:07:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706693628] [2025-02-08 14:07:01,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:01,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:07:01,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:01,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:07:01,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:07:01,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 125 [2025-02-08 14:07:01,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 123 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-02-08 14:07:01,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:01,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 125 [2025-02-08 14:07:01,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:02,064 INFO L124 PetriNetUnfolderBase]: 869/2813 cut-off events. [2025-02-08 14:07:02,064 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 14:07:02,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4545 conditions, 2813 events. 869/2813 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 23161 event pairs, 748 based on Foata normal form. 777/3263 useless extension candidates. Maximal degree in co-relation 2203. Up to 888 conditions per place. [2025-02-08 14:07:02,089 INFO L140 encePairwiseOnDemand]: 99/125 looper letters, 88 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2025-02-08 14:07:02,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 145 transitions, 489 flow [2025-02-08 14:07:02,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:07:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:07:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2025-02-08 14:07:02,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.684 [2025-02-08 14:07:02,109 INFO L175 Difference]: Start difference. First operand has 103 places, 123 transitions, 253 flow. Second operand 4 states and 342 transitions. [2025-02-08 14:07:02,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 145 transitions, 489 flow [2025-02-08 14:07:02,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 145 transitions, 489 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:07:02,120 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 230 flow [2025-02-08 14:07:02,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2025-02-08 14:07:02,127 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 3 predicate places. [2025-02-08 14:07:02,127 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 230 flow [2025-02-08 14:07:02,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-02-08 14:07:02,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:02,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:02,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:07:02,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:07:02,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:02,129 INFO L85 PathProgramCache]: Analyzing trace with hash 17833041, now seen corresponding path program 1 times [2025-02-08 14:07:02,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:02,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974406602] [2025-02-08 14:07:02,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:02,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:02,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:02,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:02,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:02,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:02,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:02,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974406602] [2025-02-08 14:07:02,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974406602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:02,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:02,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:07:02,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963455859] [2025-02-08 14:07:02,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:02,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:02,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:02,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:02,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:02,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 125 [2025-02-08 14:07:02,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-02-08 14:07:02,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:02,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 125 [2025-02-08 14:07:02,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:02,617 INFO L124 PetriNetUnfolderBase]: 869/2819 cut-off events. [2025-02-08 14:07:02,618 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 14:07:02,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4616 conditions, 2819 events. 869/2819 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 23229 event pairs, 765 based on Foata normal form. 1/2493 useless extension candidates. Maximal degree in co-relation 2306. Up to 1722 conditions per place. [2025-02-08 14:07:02,638 INFO L140 encePairwiseOnDemand]: 122/125 looper letters, 49 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2025-02-08 14:07:02,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 330 flow [2025-02-08 14:07:02,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2025-02-08 14:07:02,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.552 [2025-02-08 14:07:02,640 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 230 flow. Second operand 3 states and 207 transitions. [2025-02-08 14:07:02,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 102 transitions, 330 flow [2025-02-08 14:07:02,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 102 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:07:02,646 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 227 flow [2025-02-08 14:07:02,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2025-02-08 14:07:02,649 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 2 predicate places. [2025-02-08 14:07:02,649 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 227 flow [2025-02-08 14:07:02,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-02-08 14:07:02,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:02,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:07:02,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:07:02,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:07:02,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash 552824759, now seen corresponding path program 1 times [2025-02-08 14:07:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:02,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48039270] [2025-02-08 14:07:02,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:02,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:07:02,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:07:02,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:02,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:02,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48039270] [2025-02-08 14:07:02,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48039270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:02,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:02,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:07:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66822818] [2025-02-08 14:07:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:02,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:02,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:02,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:02,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 125 [2025-02-08 14:07:02,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-02-08 14:07:02,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:02,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 125 [2025-02-08 14:07:02,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:03,134 INFO L124 PetriNetUnfolderBase]: 869/2818 cut-off events. [2025-02-08 14:07:03,135 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 14:07:03,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4595 conditions, 2818 events. 869/2818 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 23213 event pairs, 765 based on Foata normal form. 1/2492 useless extension candidates. Maximal degree in co-relation 2306. Up to 1722 conditions per place. [2025-02-08 14:07:03,156 INFO L140 encePairwiseOnDemand]: 122/125 looper letters, 48 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-02-08 14:07:03,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 101 transitions, 325 flow [2025-02-08 14:07:03,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2025-02-08 14:07:03,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5493333333333333 [2025-02-08 14:07:03,159 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 227 flow. Second operand 3 states and 206 transitions. [2025-02-08 14:07:03,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 101 transitions, 325 flow [2025-02-08 14:07:03,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 101 transitions, 321 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:07:03,162 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 225 flow [2025-02-08 14:07:03,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2025-02-08 14:07:03,165 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 1 predicate places. [2025-02-08 14:07:03,165 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 225 flow [2025-02-08 14:07:03,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-02-08 14:07:03,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:03,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:07:03,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:07:03,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:07:03,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash 552825711, now seen corresponding path program 1 times [2025-02-08 14:07:03,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:03,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146303392] [2025-02-08 14:07:03,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:03,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:03,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:07:03,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:07:03,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:03,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:03,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:03,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146303392] [2025-02-08 14:07:03,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146303392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:03,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:03,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:07:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889200242] [2025-02-08 14:07:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:03,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:07:03,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:03,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:07:03,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:07:03,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 125 [2025-02-08 14:07:03,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:03,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:03,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 125 [2025-02-08 14:07:03,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:03,716 INFO L124 PetriNetUnfolderBase]: 869/2810 cut-off events. [2025-02-08 14:07:03,716 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 14:07:03,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4587 conditions, 2810 events. 869/2810 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 23111 event pairs, 748 based on Foata normal form. 1/2486 useless extension candidates. Maximal degree in co-relation 2299. Up to 1663 conditions per place. [2025-02-08 14:07:03,733 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 52 selfloop transitions, 7 changer transitions 8/117 dead transitions. [2025-02-08 14:07:03,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 117 transitions, 391 flow [2025-02-08 14:07:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:07:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:07:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 327 transitions. [2025-02-08 14:07:03,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5232 [2025-02-08 14:07:03,735 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 225 flow. Second operand 5 states and 327 transitions. [2025-02-08 14:07:03,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 117 transitions, 391 flow [2025-02-08 14:07:03,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 117 transitions, 387 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:07:03,739 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 233 flow [2025-02-08 14:07:03,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2025-02-08 14:07:03,740 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 2 predicate places. [2025-02-08 14:07:03,740 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 233 flow [2025-02-08 14:07:03,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:07:03,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:03,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:07:03,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:07:03,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:07:03,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:03,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1066641117, now seen corresponding path program 1 times [2025-02-08 14:07:03,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:03,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731042510] [2025-02-08 14:07:03,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:03,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:03,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:07:03,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:07:03,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:03,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:03,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:03,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731042510] [2025-02-08 14:07:03,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731042510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:03,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:03,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:07:03,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009313100] [2025-02-08 14:07:03,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:03,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:07:03,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:03,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:07:03,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:07:03,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 125 [2025-02-08 14:07:03,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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-02-08 14:07:03,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:03,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 125 [2025-02-08 14:07:03,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:04,291 INFO L124 PetriNetUnfolderBase]: 902/2570 cut-off events. [2025-02-08 14:07:04,292 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 14:07:04,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4420 conditions, 2570 events. 902/2570 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20617 event pairs, 0 based on Foata normal form. 36/2363 useless extension candidates. Maximal degree in co-relation 2181. Up to 1647 conditions per place. [2025-02-08 14:07:04,308 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 83 selfloop transitions, 3 changer transitions 0/133 dead transitions. [2025-02-08 14:07:04,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 133 transitions, 471 flow [2025-02-08 14:07:04,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:07:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:07:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 292 transitions. [2025-02-08 14:07:04,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584 [2025-02-08 14:07:04,313 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 233 flow. Second operand 4 states and 292 transitions. [2025-02-08 14:07:04,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 133 transitions, 471 flow [2025-02-08 14:07:04,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 133 transitions, 457 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:07:04,322 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 225 flow [2025-02-08 14:07:04,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2025-02-08 14:07:04,323 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 0 predicate places. [2025-02-08 14:07:04,324 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 225 flow [2025-02-08 14:07:04,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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-02-08 14:07:04,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:04,324 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:07:04,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:07:04,324 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:07:04,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:04,327 INFO L85 PathProgramCache]: Analyzing trace with hash -571840906, now seen corresponding path program 1 times [2025-02-08 14:07:04,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:04,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56999913] [2025-02-08 14:07:04,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:04,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:04,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:07:04,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:07:04,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:04,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:07:04,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:07:04,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:07:04,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:07:04,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:04,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:07:04,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:07:04,401 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:07:04,402 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-02-08 14:07:04,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2025-02-08 14:07:04,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2025-02-08 14:07:04,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2025-02-08 14:07:04,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2025-02-08 14:07:04,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2025-02-08 14:07:04,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2025-02-08 14:07:04,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2025-02-08 14:07:04,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2025-02-08 14:07:04,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2025-02-08 14:07:04,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2025-02-08 14:07:04,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2025-02-08 14:07:04,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2025-02-08 14:07:04,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2025-02-08 14:07:04,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2025-02-08 14:07:04,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2025-02-08 14:07:04,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2025-02-08 14:07:04,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2025-02-08 14:07:04,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2025-02-08 14:07:04,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2025-02-08 14:07:04,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2025-02-08 14:07:04,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:07:04,406 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 14:07:04,409 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:07:04,409 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:07:04,451 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:07:04,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 174 transitions, 364 flow [2025-02-08 14:07:04,494 INFO L124 PetriNetUnfolderBase]: 60/296 cut-off events. [2025-02-08 14:07:04,494 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:07:04,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 296 events. 60/296 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1362 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 178. Up to 12 conditions per place. [2025-02-08 14:07:04,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 174 transitions, 364 flow [2025-02-08 14:07:04,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 173 transitions, 362 flow [2025-02-08 14:07:04,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:07:04,505 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;@7f8570b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:07:04,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-02-08 14:07:04,507 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:07:04,507 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-02-08 14:07:04,507 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:07:04,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:04,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:04,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 14:07:04,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:04,508 INFO L85 PathProgramCache]: Analyzing trace with hash 23189489, now seen corresponding path program 1 times [2025-02-08 14:07:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382472716] [2025-02-08 14:07:04,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:04,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:04,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:04,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:04,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:04,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:04,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382472716] [2025-02-08 14:07:04,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382472716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:04,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:04,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:07:04,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86795763] [2025-02-08 14:07:04,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:04,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:07:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:04,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:07:04,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:07:04,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 174 [2025-02-08 14:07:04,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 173 transitions, 362 flow. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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-02-08 14:07:04,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:04,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 174 [2025-02-08 14:07:04,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:09,593 INFO L124 PetriNetUnfolderBase]: 31927/70295 cut-off events. [2025-02-08 14:07:09,594 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-02-08 14:07:09,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118002 conditions, 70295 events. 31927/70295 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 2077. Compared 810891 event pairs, 28458 based on Foata normal form. 22557/85065 useless extension candidates. Maximal degree in co-relation 50957. Up to 24452 conditions per place. [2025-02-08 14:07:10,091 INFO L140 encePairwiseOnDemand]: 138/174 looper letters, 128 selfloop transitions, 5 changer transitions 0/205 dead transitions. [2025-02-08 14:07:10,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 205 transitions, 706 flow [2025-02-08 14:07:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:07:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:07:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2025-02-08 14:07:10,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6925287356321839 [2025-02-08 14:07:10,094 INFO L175 Difference]: Start difference. First operand has 142 places, 173 transitions, 362 flow. Second operand 4 states and 482 transitions. [2025-02-08 14:07:10,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 205 transitions, 706 flow [2025-02-08 14:07:10,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 205 transitions, 706 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:07:10,101 INFO L231 Difference]: Finished difference. Result has 145 places, 143 transitions, 319 flow [2025-02-08 14:07:10,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=145, PETRI_TRANSITIONS=143} [2025-02-08 14:07:10,103 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 3 predicate places. [2025-02-08 14:07:10,104 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 319 flow [2025-02-08 14:07:10,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 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-02-08 14:07:10,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:10,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:10,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:07:10,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 14:07:10,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash 23189457, now seen corresponding path program 1 times [2025-02-08 14:07:10,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:10,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801436297] [2025-02-08 14:07:10,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:10,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:10,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:10,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:10,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:10,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:10,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:10,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801436297] [2025-02-08 14:07:10,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801436297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:10,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:10,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:07:10,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263546881] [2025-02-08 14:07:10,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:10,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:10,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:10,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:10,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:10,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 174 [2025-02-08 14:07:10,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-02-08 14:07:10,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:10,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 174 [2025-02-08 14:07:10,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:14,091 INFO L124 PetriNetUnfolderBase]: 31941/70588 cut-off events. [2025-02-08 14:07:14,092 INFO L125 PetriNetUnfolderBase]: For 650/650 co-relation queries the response was YES. [2025-02-08 14:07:14,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119400 conditions, 70588 events. 31941/70588 cut-off events. For 650/650 co-relation queries the response was YES. Maximal size of possible extension queue 2078. Compared 816202 event pairs, 29104 based on Foata normal form. 1/62678 useless extension candidates. Maximal degree in co-relation 58681. Up to 47528 conditions per place. [2025-02-08 14:07:14,560 INFO L140 encePairwiseOnDemand]: 171/174 looper letters, 69 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-02-08 14:07:14,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 142 transitions, 459 flow [2025-02-08 14:07:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-02-08 14:07:14,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5498084291187739 [2025-02-08 14:07:14,566 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 319 flow. Second operand 3 states and 287 transitions. [2025-02-08 14:07:14,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 142 transitions, 459 flow [2025-02-08 14:07:14,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 142 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:07:14,573 INFO L231 Difference]: Finished difference. Result has 144 places, 142 transitions, 316 flow [2025-02-08 14:07:14,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=144, PETRI_TRANSITIONS=142} [2025-02-08 14:07:14,574 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2025-02-08 14:07:14,574 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 142 transitions, 316 flow [2025-02-08 14:07:14,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-02-08 14:07:14,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:14,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:07:14,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:07:14,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 14:07:14,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:14,576 INFO L85 PathProgramCache]: Analyzing trace with hash 718874781, now seen corresponding path program 1 times [2025-02-08 14:07:14,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:14,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884219636] [2025-02-08 14:07:14,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:14,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:14,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:07:14,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:07:14,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:14,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:14,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884219636] [2025-02-08 14:07:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884219636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:07:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338505971] [2025-02-08 14:07:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:14,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:07:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:14,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:07:14,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:07:14,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 174 [2025-02-08 14:07:14,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 142 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 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-02-08 14:07:14,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:14,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 174 [2025-02-08 14:07:14,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:18,766 INFO L124 PetriNetUnfolderBase]: 31927/70293 cut-off events. [2025-02-08 14:07:18,766 INFO L125 PetriNetUnfolderBase]: For 650/650 co-relation queries the response was YES. [2025-02-08 14:07:18,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118729 conditions, 70293 events. 31927/70293 cut-off events. For 650/650 co-relation queries the response was YES. Maximal size of possible extension queue 2077. Compared 810479 event pairs, 28458 based on Foata normal form. 1/62454 useless extension candidates. Maximal degree in co-relation 60033. Up to 46119 conditions per place. [2025-02-08 14:07:19,050 INFO L140 encePairwiseOnDemand]: 167/174 looper letters, 97 selfloop transitions, 7 changer transitions 0/175 dead transitions. [2025-02-08 14:07:19,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 175 transitions, 590 flow [2025-02-08 14:07:19,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:07:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:07:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2025-02-08 14:07:19,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-02-08 14:07:19,053 INFO L175 Difference]: Start difference. First operand has 144 places, 142 transitions, 316 flow. Second operand 5 states and 464 transitions. [2025-02-08 14:07:19,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 175 transitions, 590 flow [2025-02-08 14:07:19,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 175 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:07:19,056 INFO L231 Difference]: Finished difference. Result has 145 places, 141 transitions, 324 flow [2025-02-08 14:07:19,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=145, PETRI_TRANSITIONS=141} [2025-02-08 14:07:19,058 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 3 predicate places. [2025-02-08 14:07:19,058 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 141 transitions, 324 flow [2025-02-08 14:07:19,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 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-02-08 14:07:19,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:19,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:07:19,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:07:19,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 14:07:19,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash 718873829, now seen corresponding path program 1 times [2025-02-08 14:07:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83196450] [2025-02-08 14:07:19,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:19,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:07:19,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:07:19,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:19,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83196450] [2025-02-08 14:07:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83196450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:19,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:19,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:07:19,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184970235] [2025-02-08 14:07:19,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:07:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:19,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:07:19,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:07:19,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 174 [2025-02-08 14:07:19,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 141 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-02-08 14:07:19,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:19,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 174 [2025-02-08 14:07:19,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:22,764 INFO L124 PetriNetUnfolderBase]: 31941/70586 cut-off events. [2025-02-08 14:07:22,765 INFO L125 PetriNetUnfolderBase]: For 1806/1806 co-relation queries the response was YES. [2025-02-08 14:07:22,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119761 conditions, 70586 events. 31941/70586 cut-off events. For 1806/1806 co-relation queries the response was YES. Maximal size of possible extension queue 2078. Compared 815698 event pairs, 29104 based on Foata normal form. 1/62676 useless extension candidates. Maximal degree in co-relation 57598. Up to 47528 conditions per place. [2025-02-08 14:07:23,053 INFO L140 encePairwiseOnDemand]: 171/174 looper letters, 68 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2025-02-08 14:07:23,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 140 transitions, 462 flow [2025-02-08 14:07:23,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:07:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:07:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-02-08 14:07:23,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5478927203065134 [2025-02-08 14:07:23,055 INFO L175 Difference]: Start difference. First operand has 145 places, 141 transitions, 324 flow. Second operand 3 states and 286 transitions. [2025-02-08 14:07:23,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 140 transitions, 462 flow [2025-02-08 14:07:23,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 140 transitions, 448 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:07:23,082 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 312 flow [2025-02-08 14:07:23,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=142, PETRI_TRANSITIONS=140} [2025-02-08 14:07:23,082 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 0 predicate places. [2025-02-08 14:07:23,082 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 312 flow [2025-02-08 14:07:23,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-02-08 14:07:23,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:23,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:07:23,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:07:23,083 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 14:07:23,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:23,083 INFO L85 PathProgramCache]: Analyzing trace with hash 719450964, now seen corresponding path program 1 times [2025-02-08 14:07:23,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:23,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794802931] [2025-02-08 14:07:23,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:23,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:07:23,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:07:23,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:23,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:23,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794802931] [2025-02-08 14:07:23,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794802931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:23,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:23,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:07:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033169849] [2025-02-08 14:07:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:23,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:07:23,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:23,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:07:23,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:07:23,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 174 [2025-02-08 14:07:23,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 140 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 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-02-08 14:07:23,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:23,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 174 [2025-02-08 14:07:23,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:26,882 INFO L124 PetriNetUnfolderBase]: 34860/73971 cut-off events. [2025-02-08 14:07:26,883 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2025-02-08 14:07:26,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127084 conditions, 73971 events. 34860/73971 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 2117. Compared 839530 event pairs, 15759 based on Foata normal form. 36/66039 useless extension candidates. Maximal degree in co-relation 64269. Up to 52082 conditions per place. [2025-02-08 14:07:27,366 INFO L140 encePairwiseOnDemand]: 168/174 looper letters, 107 selfloop transitions, 3 changer transitions 0/177 dead transitions. [2025-02-08 14:07:27,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 177 transitions, 606 flow [2025-02-08 14:07:27,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:07:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:07:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2025-02-08 14:07:27,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2025-02-08 14:07:27,368 INFO L175 Difference]: Start difference. First operand has 142 places, 140 transitions, 312 flow. Second operand 4 states and 396 transitions. [2025-02-08 14:07:27,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 177 transitions, 606 flow [2025-02-08 14:07:27,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 177 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:07:27,372 INFO L231 Difference]: Finished difference. Result has 145 places, 142 transitions, 332 flow [2025-02-08 14:07:27,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=145, PETRI_TRANSITIONS=142} [2025-02-08 14:07:27,374 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 3 predicate places. [2025-02-08 14:07:27,375 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 142 transitions, 332 flow [2025-02-08 14:07:27,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 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-02-08 14:07:27,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:27,375 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:07:27,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:07:27,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 14:07:27,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:27,376 INFO L85 PathProgramCache]: Analyzing trace with hash -718638125, now seen corresponding path program 1 times [2025-02-08 14:07:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:27,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332547303] [2025-02-08 14:07:27,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:27,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:27,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:07:27,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:07:27,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:27,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:27,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:27,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332547303] [2025-02-08 14:07:27,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332547303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:27,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:27,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:07:27,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496457315] [2025-02-08 14:07:27,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:27,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:07:27,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:27,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:07:27,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:07:27,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 174 [2025-02-08 14:07:27,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 142 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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-02-08 14:07:27,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:27,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 174 [2025-02-08 14:07:27,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:31,158 INFO L124 PetriNetUnfolderBase]: 34030/68029 cut-off events. [2025-02-08 14:07:31,159 INFO L125 PetriNetUnfolderBase]: For 2818/2818 co-relation queries the response was YES. [2025-02-08 14:07:31,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122542 conditions, 68029 events. 34030/68029 cut-off events. For 2818/2818 co-relation queries the response was YES. Maximal size of possible extension queue 2054. Compared 742495 event pairs, 1848 based on Foata normal form. 648/62639 useless extension candidates. Maximal degree in co-relation 59504. Up to 41606 conditions per place. [2025-02-08 14:07:31,670 INFO L140 encePairwiseOnDemand]: 169/174 looper letters, 171 selfloop transitions, 6 changer transitions 0/244 dead transitions. [2025-02-08 14:07:31,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 244 transitions, 888 flow [2025-02-08 14:07:31,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:07:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:07:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 603 transitions. [2025-02-08 14:07:31,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5775862068965517 [2025-02-08 14:07:31,672 INFO L175 Difference]: Start difference. First operand has 145 places, 142 transitions, 332 flow. Second operand 6 states and 603 transitions. [2025-02-08 14:07:31,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 244 transitions, 888 flow [2025-02-08 14:07:31,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 244 transitions, 886 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:07:31,677 INFO L231 Difference]: Finished difference. Result has 148 places, 141 transitions, 338 flow [2025-02-08 14:07:31,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=148, PETRI_TRANSITIONS=141} [2025-02-08 14:07:31,678 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 6 predicate places. [2025-02-08 14:07:31,678 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 141 transitions, 338 flow [2025-02-08 14:07:31,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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-02-08 14:07:31,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:31,679 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:07:31,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 14:07:31,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 14:07:31,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash -802944793, now seen corresponding path program 1 times [2025-02-08 14:07:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:31,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920276008] [2025-02-08 14:07:31,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:31,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:31,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:07:31,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:07:31,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:31,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:31,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:31,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920276008] [2025-02-08 14:07:31,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920276008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:31,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:31,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:07:31,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346014308] [2025-02-08 14:07:31,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:31,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:07:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:31,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:07:31,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:07:31,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 174 [2025-02-08 14:07:31,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 141 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 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-02-08 14:07:31,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:31,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 174 [2025-02-08 14:07:31,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:07:35,408 INFO L124 PetriNetUnfolderBase]: 33104/66956 cut-off events. [2025-02-08 14:07:35,409 INFO L125 PetriNetUnfolderBase]: For 6194/6194 co-relation queries the response was YES. [2025-02-08 14:07:35,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121621 conditions, 66956 events. 33104/66956 cut-off events. For 6194/6194 co-relation queries the response was YES. Maximal size of possible extension queue 1934. Compared 722473 event pairs, 7778 based on Foata normal form. 648/62167 useless extension candidates. Maximal degree in co-relation 58967. Up to 44302 conditions per place. [2025-02-08 14:07:35,741 INFO L140 encePairwiseOnDemand]: 169/174 looper letters, 136 selfloop transitions, 6 changer transitions 0/209 dead transitions. [2025-02-08 14:07:35,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 209 transitions, 756 flow [2025-02-08 14:07:35,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:07:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:07:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2025-02-08 14:07:35,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2025-02-08 14:07:35,743 INFO L175 Difference]: Start difference. First operand has 148 places, 141 transitions, 338 flow. Second operand 4 states and 424 transitions. [2025-02-08 14:07:35,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 209 transitions, 756 flow [2025-02-08 14:07:35,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 209 transitions, 740 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 14:07:35,761 INFO L231 Difference]: Finished difference. Result has 146 places, 141 transitions, 338 flow [2025-02-08 14:07:35,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=338, PETRI_PLACES=146, PETRI_TRANSITIONS=141} [2025-02-08 14:07:35,762 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 4 predicate places. [2025-02-08 14:07:35,762 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 141 transitions, 338 flow [2025-02-08 14:07:35,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 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-02-08 14:07:35,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:35,763 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:07:35,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:07:35,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 14:07:35,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:35,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1464190245, now seen corresponding path program 1 times [2025-02-08 14:07:35,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:35,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651171393] [2025-02-08 14:07:35,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:35,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:35,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:07:35,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:07:35,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:35,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:07:35,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:07:35,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:07:35,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:07:35,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:35,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:07:35,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:07:35,810 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:07:35,811 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-02-08 14:07:35,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2025-02-08 14:07:35,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2025-02-08 14:07:35,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2025-02-08 14:07:35,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2025-02-08 14:07:35,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2025-02-08 14:07:35,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2025-02-08 14:07:35,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2025-02-08 14:07:35,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2025-02-08 14:07:35,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2025-02-08 14:07:35,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2025-02-08 14:07:35,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2025-02-08 14:07:35,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2025-02-08 14:07:35,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2025-02-08 14:07:35,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2025-02-08 14:07:35,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2025-02-08 14:07:35,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2025-02-08 14:07:35,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2025-02-08 14:07:35,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2025-02-08 14:07:36,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2025-02-08 14:07:36,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2025-02-08 14:07:36,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2025-02-08 14:07:36,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2025-02-08 14:07:36,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2025-02-08 14:07:36,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2025-02-08 14:07:36,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 14:07:36,019 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:07:36,020 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:07:36,020 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:07:36,062 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:07:36,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 223 transitions, 473 flow [2025-02-08 14:07:36,115 INFO L124 PetriNetUnfolderBase]: 87/437 cut-off events. [2025-02-08 14:07:36,115 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 14:07:36,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 437 events. 87/437 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2232 event pairs, 1 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 304. Up to 16 conditions per place. [2025-02-08 14:07:36,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 223 transitions, 473 flow [2025-02-08 14:07:36,127 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 222 transitions, 471 flow [2025-02-08 14:07:36,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:07:36,129 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;@7f8570b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:07:36,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-08 14:07:36,131 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:07:36,132 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-02-08 14:07:36,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:07:36,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:07:36,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:07:36,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-02-08 14:07:36,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:07:36,133 INFO L85 PathProgramCache]: Analyzing trace with hash 30054321, now seen corresponding path program 1 times [2025-02-08 14:07:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:07:36,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111170408] [2025-02-08 14:07:36,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:07:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:07:36,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:07:36,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:07:36,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:07:36,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:07:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:07:36,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:07:36,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111170408] [2025-02-08 14:07:36,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111170408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:07:36,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:07:36,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:07:36,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657046072] [2025-02-08 14:07:36,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:07:36,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:07:36,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:07:36,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:07:36,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:07:36,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 223 [2025-02-08 14:07:36,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 222 transitions, 471 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-02-08 14:07:36,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:07:36,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 223 [2025-02-08 14:07:36,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand