./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_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_02-simple_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 b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:04:49,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:04:49,156 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:04:49,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:04:49,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:04:49,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:04:49,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:04:49,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:04:49,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:04:49,183 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:04:49,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:04:49,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:04:49,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:04:49,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:04:49,184 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:04:49,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:04:49,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:04:49,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:04:49,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:04:49,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:04:49,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:04:49,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:04:49,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:04:49,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:04:49,185 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:04:49,185 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:04:49,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:04:49,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:04:49,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:04:49,185 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:04:49,186 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:04:49,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:04:49,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:04:49,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:04:49,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:04:49,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:04:49,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:04:49,186 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:04:49,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:04:49,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:04:49,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:04:49,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:04:49,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:04:49,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:04:49,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:04:49,187 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 -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2025-02-08 14:04:49,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:04:49,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:04:49,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:04:49,464 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:04:49,465 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:04:49,465 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_02-simple_racefree.i [2025-02-08 14:04:50,558 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/262f1068b/215446e9d17d476a80b4cbf4200a370f/FLAG4cf1a889d [2025-02-08 14:04:50,831 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:04:50,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2025-02-08 14:04:50,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/262f1068b/215446e9d17d476a80b4cbf4200a370f/FLAG4cf1a889d [2025-02-08 14:04:50,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/262f1068b/215446e9d17d476a80b4cbf4200a370f [2025-02-08 14:04:50,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:04:50,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:04:50,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:04:50,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:04:50,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:04:50,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1074077e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50, skipping insertion in model container [2025-02-08 14:04:50,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:04:51,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:04:51,188 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:04:51,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:04:51,270 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:04:51,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:51 WrapperNode [2025-02-08 14:04:51,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:04:51,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:04:51,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:04:51,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:04:51,278 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:04:51" (1/1) ... [2025-02-08 14:04:51,289 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:04:51" (1/1) ... [2025-02-08 14:04:51,306 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 130 [2025-02-08 14:04:51,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:04:51,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:04:51,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:04:51,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:04:51,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:51" (1/1) ... [2025-02-08 14:04:51,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:51" (1/1) ... [2025-02-08 14:04:51,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:51" (1/1) ... [2025-02-08 14:04:51,338 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-02-08 14:04:51,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:51" (1/1) ... [2025-02-08 14:04:51,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:51" (1/1) ... [2025-02-08 14:04:51,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:51" (1/1) ... [2025-02-08 14:04:51,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:51" (1/1) ... [2025-02-08 14:04:51,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:51" (1/1) ... [2025-02-08 14:04:51,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:51" (1/1) ... [2025-02-08 14:04:51,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:04:51,360 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:04:51,363 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:04:51,363 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:04:51,364 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:51" (1/1) ... [2025-02-08 14:04:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:04:51,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:04:51,391 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:04:51,393 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:04:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:04:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:04:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:04:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:04:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:04:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:04:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:04:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:04:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 14:04:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:04:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:04:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 14:04:51,413 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 14:04:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:04:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:04:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:04:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:04:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:04:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 14:04:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:04:51,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:04:51,415 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:04:51,533 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:04:51,535 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:04:51,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 14:04:51,707 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 14:04:51,735 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:04:51,735 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:04:51,907 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:04:51,907 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:04:51,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:04:51 BoogieIcfgContainer [2025-02-08 14:04:51,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:04:51,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:04:51,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:04:51,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:04:51,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:04:50" (1/3) ... [2025-02-08 14:04:51,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29112122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:04:51, skipping insertion in model container [2025-02-08 14:04:51,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:51" (2/3) ... [2025-02-08 14:04:51,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29112122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:04:51, skipping insertion in model container [2025-02-08 14:04:51,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:04:51" (3/3) ... [2025-02-08 14:04:51,915 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2025-02-08 14:04:51,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:04:51,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_02-simple_racefree.i that has 2 procedures, 54 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-02-08 14:04:51,927 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:04:51,968 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 14:04:51,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 63 transitions, 133 flow [2025-02-08 14:04:52,028 INFO L124 PetriNetUnfolderBase]: 11/79 cut-off events. [2025-02-08 14:04:52,032 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:04:52,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 79 events. 11/79 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 241 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2025-02-08 14:04:52,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 63 transitions, 133 flow [2025-02-08 14:04:52,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 62 transitions, 131 flow [2025-02-08 14:04:52,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:04:52,060 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;@7c293fa8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:04:52,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 14:04:52,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:04:52,096 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 14:04:52,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:04:52,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:52,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:04:52,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:04:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash 402136170, now seen corresponding path program 1 times [2025-02-08 14:04:52,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:52,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702975848] [2025-02-08 14:04:52,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:52,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:52,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:04:52,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:04:52,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:52,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:52,386 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:04:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702975848] [2025-02-08 14:04:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702975848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:52,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:52,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:04:52,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236559519] [2025-02-08 14:04:52,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:52,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:52,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:52,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:52,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 63 [2025-02-08 14:04:52,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:04:52,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:52,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 63 [2025-02-08 14:04:52,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:52,676 INFO L124 PetriNetUnfolderBase]: 132/382 cut-off events. [2025-02-08 14:04:52,676 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:04:52,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 382 events. 132/382 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1865 event pairs, 20 based on Foata normal form. 114/459 useless extension candidates. Maximal degree in co-relation 650. Up to 255 conditions per place. [2025-02-08 14:04:52,682 INFO L140 encePairwiseOnDemand]: 49/63 looper letters, 46 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-02-08 14:04:52,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 255 flow [2025-02-08 14:04:52,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:04:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:04:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2025-02-08 14:04:52,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-02-08 14:04:52,697 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 131 flow. Second operand 4 states and 176 transitions. [2025-02-08 14:04:52,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 255 flow [2025-02-08 14:04:52,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 255 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:04:52,705 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 121 flow [2025-02-08 14:04:52,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2025-02-08 14:04:52,710 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-02-08 14:04:52,711 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 121 flow [2025-02-08 14:04:52,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:04:52,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:52,712 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:04:52,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:04:52,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:04:52,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1375183878, now seen corresponding path program 1 times [2025-02-08 14:04:52,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:52,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330432191] [2025-02-08 14:04:52,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:52,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:04:52,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:04:52,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:52,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:04:52,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:04:52,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:04:52,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:04:52,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:52,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:04:52,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:04:52,799 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:04:52,800 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 14:04:52,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-08 14:04:52,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-08 14:04:52,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-08 14:04:52,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-08 14:04:52,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-08 14:04:52,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-08 14:04:52,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-08 14:04:52,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-08 14:04:52,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-08 14:04:52,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-08 14:04:52,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-08 14:04:52,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-08 14:04:52,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:04:52,803 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 14:04:52,809 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:04:52,809 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:04:52,872 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:04:52,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 98 transitions, 212 flow [2025-02-08 14:04:52,895 INFO L124 PetriNetUnfolderBase]: 21/149 cut-off events. [2025-02-08 14:04:52,895 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:04:52,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 149 events. 21/149 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 565 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 96. Up to 6 conditions per place. [2025-02-08 14:04:52,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 98 transitions, 212 flow [2025-02-08 14:04:52,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 98 transitions, 212 flow [2025-02-08 14:04:52,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:04:52,902 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;@7c293fa8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:04:52,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-08 14:04:52,909 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:04:52,909 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 14:04:52,909 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:04:52,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:52,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:04:52,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:52,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash 495689773, now seen corresponding path program 1 times [2025-02-08 14:04:52,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:52,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71473672] [2025-02-08 14:04:52,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:52,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:52,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:04:52,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:04:52,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:52,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:53,017 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:04:53,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:53,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71473672] [2025-02-08 14:04:53,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71473672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:53,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:53,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:04:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903002201] [2025-02-08 14:04:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:53,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:53,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:53,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:53,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-02-08 14:04:53,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 98 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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:04:53,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:53,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-02-08 14:04:53,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:53,991 INFO L124 PetriNetUnfolderBase]: 4028/9087 cut-off events. [2025-02-08 14:04:53,992 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 14:04:54,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15565 conditions, 9087 events. 4028/9087 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 78032 event pairs, 3802 based on Foata normal form. 2490/10578 useless extension candidates. Maximal degree in co-relation 12188. Up to 6374 conditions per place. [2025-02-08 14:04:54,076 INFO L140 encePairwiseOnDemand]: 78/98 looper letters, 64 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-02-08 14:04:54,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 109 transitions, 368 flow [2025-02-08 14:04:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:04:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:04:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2025-02-08 14:04:54,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2025-02-08 14:04:54,081 INFO L175 Difference]: Start difference. First operand has 87 places, 98 transitions, 212 flow. Second operand 4 states and 264 transitions. [2025-02-08 14:04:54,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 109 transitions, 368 flow [2025-02-08 14:04:54,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 109 transitions, 368 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:04:54,084 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 208 flow [2025-02-08 14:04:54,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2025-02-08 14:04:54,085 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2025-02-08 14:04:54,086 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 208 flow [2025-02-08 14:04:54,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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:04:54,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:54,086 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:04:54,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:04:54,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:54,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash 236573831, now seen corresponding path program 1 times [2025-02-08 14:04:54,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:54,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120968881] [2025-02-08 14:04:54,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:54,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:54,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:04:54,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:04:54,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:54,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:54,183 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:04:54,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:54,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120968881] [2025-02-08 14:04:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120968881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:54,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:54,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:04:54,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029853005] [2025-02-08 14:04:54,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:54,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:04:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:54,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:04:54,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:04:54,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-02-08 14:04:54,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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:04:54,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:54,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-02-08 14:04:54,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:55,020 INFO L124 PetriNetUnfolderBase]: 3764/7668 cut-off events. [2025-02-08 14:04:55,021 INFO L125 PetriNetUnfolderBase]: For 678/678 co-relation queries the response was YES. [2025-02-08 14:04:55,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14378 conditions, 7668 events. 3764/7668 cut-off events. For 678/678 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 62023 event pairs, 622 based on Foata normal form. 144/7282 useless extension candidates. Maximal degree in co-relation 13008. Up to 4012 conditions per place. [2025-02-08 14:04:55,060 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 104 selfloop transitions, 6 changer transitions 0/152 dead transitions. [2025-02-08 14:04:55,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 152 transitions, 558 flow [2025-02-08 14:04:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:04:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:04:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 363 transitions. [2025-02-08 14:04:55,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6173469387755102 [2025-02-08 14:04:55,063 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 208 flow. Second operand 6 states and 363 transitions. [2025-02-08 14:04:55,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 152 transitions, 558 flow [2025-02-08 14:04:55,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 152 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:04:55,067 INFO L231 Difference]: Finished difference. Result has 95 places, 85 transitions, 214 flow [2025-02-08 14:04:55,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=95, PETRI_TRANSITIONS=85} [2025-02-08 14:04:55,068 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 8 predicate places. [2025-02-08 14:04:55,069 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 85 transitions, 214 flow [2025-02-08 14:04:55,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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:04:55,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:55,069 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:04:55,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:04:55,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:55,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1256145401, now seen corresponding path program 1 times [2025-02-08 14:04:55,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:55,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769983558] [2025-02-08 14:04:55,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:55,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:55,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:04:55,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:04:55,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:55,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:55,177 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:04:55,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:55,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769983558] [2025-02-08 14:04:55,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769983558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:55,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:55,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:04:55,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158802245] [2025-02-08 14:04:55,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:55,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:55,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:55,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:55,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:55,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-02-08 14:04:55,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 85 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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:04:55,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:55,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-02-08 14:04:55,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:55,740 INFO L124 PetriNetUnfolderBase]: 3500/6908 cut-off events. [2025-02-08 14:04:55,741 INFO L125 PetriNetUnfolderBase]: For 1169/1169 co-relation queries the response was YES. [2025-02-08 14:04:55,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13523 conditions, 6908 events. 3500/6908 cut-off events. For 1169/1169 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 53714 event pairs, 252 based on Foata normal form. 144/6717 useless extension candidates. Maximal degree in co-relation 9864. Up to 4443 conditions per place. [2025-02-08 14:04:55,773 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 81 selfloop transitions, 6 changer transitions 0/129 dead transitions. [2025-02-08 14:04:55,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 129 transitions, 474 flow [2025-02-08 14:04:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:04:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:04:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2025-02-08 14:04:55,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6479591836734694 [2025-02-08 14:04:55,775 INFO L175 Difference]: Start difference. First operand has 95 places, 85 transitions, 214 flow. Second operand 4 states and 254 transitions. [2025-02-08 14:04:55,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 129 transitions, 474 flow [2025-02-08 14:04:55,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 129 transitions, 458 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 14:04:55,780 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 214 flow [2025-02-08 14:04:55,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2025-02-08 14:04:55,780 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 6 predicate places. [2025-02-08 14:04:55,782 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 214 flow [2025-02-08 14:04:55,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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:04:55,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:55,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:04:55,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:04:55,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:55,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1805087928, now seen corresponding path program 1 times [2025-02-08 14:04:55,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:55,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037138326] [2025-02-08 14:04:55,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:55,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:04:55,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:04:55,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:55,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:55,831 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:04:55,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:55,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037138326] [2025-02-08 14:04:55,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037138326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:55,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:55,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:04:55,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441053366] [2025-02-08 14:04:55,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:55,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:55,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:55,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:55,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:55,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 98 [2025-02-08 14:04:55,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:04:55,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:55,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 98 [2025-02-08 14:04:55,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:56,619 INFO L124 PetriNetUnfolderBase]: 5811/12297 cut-off events. [2025-02-08 14:04:56,619 INFO L125 PetriNetUnfolderBase]: For 1838/1838 co-relation queries the response was YES. [2025-02-08 14:04:56,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22519 conditions, 12297 events. 5811/12297 cut-off events. For 1838/1838 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 108169 event pairs, 1739 based on Foata normal form. 209/11194 useless extension candidates. Maximal degree in co-relation 18487. Up to 4468 conditions per place. [2025-02-08 14:04:56,664 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 119 selfloop transitions, 14 changer transitions 0/175 dead transitions. [2025-02-08 14:04:56,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 175 transitions, 719 flow [2025-02-08 14:04:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:04:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:04:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 346 transitions. [2025-02-08 14:04:56,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7061224489795919 [2025-02-08 14:04:56,666 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 214 flow. Second operand 5 states and 346 transitions. [2025-02-08 14:04:56,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 175 transitions, 719 flow [2025-02-08 14:04:56,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 175 transitions, 703 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:04:56,669 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 312 flow [2025-02-08 14:04:56,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=99, PETRI_TRANSITIONS=98} [2025-02-08 14:04:56,671 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 12 predicate places. [2025-02-08 14:04:56,672 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 312 flow [2025-02-08 14:04:56,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:04:56,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:56,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:04:56,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:04:56,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:56,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash 123151411, now seen corresponding path program 1 times [2025-02-08 14:04:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:56,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80949174] [2025-02-08 14:04:56,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:56,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:04:56,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:04:56,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:56,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:56,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:04:56,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:56,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80949174] [2025-02-08 14:04:56,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80949174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:56,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:56,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:04:56,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576677142] [2025-02-08 14:04:56,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:56,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:56,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:56,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:56,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:56,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 98 [2025-02-08 14:04:56,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 98 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:04:56,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:56,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 98 [2025-02-08 14:04:56,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:57,691 INFO L124 PetriNetUnfolderBase]: 6089/13180 cut-off events. [2025-02-08 14:04:57,691 INFO L125 PetriNetUnfolderBase]: For 6369/6411 co-relation queries the response was YES. [2025-02-08 14:04:57,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27253 conditions, 13180 events. 6089/13180 cut-off events. For 6369/6411 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 119908 event pairs, 1525 based on Foata normal form. 227/12451 useless extension candidates. Maximal degree in co-relation 22821. Up to 6239 conditions per place. [2025-02-08 14:04:57,756 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 120 selfloop transitions, 19 changer transitions 0/181 dead transitions. [2025-02-08 14:04:57,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 181 transitions, 847 flow [2025-02-08 14:04:57,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:04:57,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:04:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 344 transitions. [2025-02-08 14:04:57,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7020408163265306 [2025-02-08 14:04:57,758 INFO L175 Difference]: Start difference. First operand has 99 places, 98 transitions, 312 flow. Second operand 5 states and 344 transitions. [2025-02-08 14:04:57,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 181 transitions, 847 flow [2025-02-08 14:04:57,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 181 transitions, 847 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:04:57,770 INFO L231 Difference]: Finished difference. Result has 105 places, 106 transitions, 429 flow [2025-02-08 14:04:57,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=429, PETRI_PLACES=105, PETRI_TRANSITIONS=106} [2025-02-08 14:04:57,770 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 18 predicate places. [2025-02-08 14:04:57,771 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 106 transitions, 429 flow [2025-02-08 14:04:57,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:04:57,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:57,771 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:04:57,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:04:57,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:57,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:57,774 INFO L85 PathProgramCache]: Analyzing trace with hash -269904116, now seen corresponding path program 1 times [2025-02-08 14:04:57,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:57,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558845397] [2025-02-08 14:04:57,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:57,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:04:57,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:04:57,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:57,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:04:57,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:04:57,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:04:57,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:04:57,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:57,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:04:57,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:04:57,840 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:04:57,840 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-08 14:04:57,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-08 14:04:57,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-08 14:04:57,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-08 14:04:57,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-08 14:04:57,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-08 14:04:57,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-08 14:04:57,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-08 14:04:57,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-08 14:04:57,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-08 14:04:57,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-08 14:04:57,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-08 14:04:57,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-08 14:04:57,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-08 14:04:57,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-08 14:04:57,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-08 14:04:57,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-08 14:04:57,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:04:57,841 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 14:04:57,842 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:04:57,842 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:04:57,872 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:04:57,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 133 transitions, 293 flow [2025-02-08 14:04:57,898 INFO L124 PetriNetUnfolderBase]: 34/238 cut-off events. [2025-02-08 14:04:57,899 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 14:04:57,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 238 events. 34/238 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1004 event pairs, 1 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 164. Up to 12 conditions per place. [2025-02-08 14:04:57,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 133 transitions, 293 flow [2025-02-08 14:04:57,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 133 transitions, 293 flow [2025-02-08 14:04:57,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:04:57,904 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;@7c293fa8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:04:57,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-08 14:04:57,907 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:04:57,907 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 14:04:57,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:04:57,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:57,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:04:57,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:04:57,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash 622644051, now seen corresponding path program 1 times [2025-02-08 14:04:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:57,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232790656] [2025-02-08 14:04:57,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:57,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:57,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:04:57,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:04:57,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:57,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:57,973 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:04:57,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:57,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232790656] [2025-02-08 14:04:57,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232790656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:57,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:57,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:04:57,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354610940] [2025-02-08 14:04:57,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:57,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:57,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:57,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:57,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:57,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 133 [2025-02-08 14:04:57,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 133 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:04:57,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:57,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 133 [2025-02-08 14:04:57,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:05,762 INFO L124 PetriNetUnfolderBase]: 76325/139769 cut-off events. [2025-02-08 14:05:05,763 INFO L125 PetriNetUnfolderBase]: For 1627/1627 co-relation queries the response was YES. [2025-02-08 14:05:06,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246866 conditions, 139769 events. 76325/139769 cut-off events. For 1627/1627 co-relation queries the response was YES. Maximal size of possible extension queue 3162. Compared 1484090 event pairs, 73710 based on Foata normal form. 44347/170848 useless extension candidates. Maximal degree in co-relation 126395. Up to 105935 conditions per place. [2025-02-08 14:05:06,583 INFO L140 encePairwiseOnDemand]: 107/133 looper letters, 77 selfloop transitions, 3 changer transitions 0/138 dead transitions. [2025-02-08 14:05:06,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 138 transitions, 463 flow [2025-02-08 14:05:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2025-02-08 14:05:06,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6522556390977443 [2025-02-08 14:05:06,585 INFO L175 Difference]: Start difference. First operand has 117 places, 133 transitions, 293 flow. Second operand 4 states and 347 transitions. [2025-02-08 14:05:06,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 138 transitions, 463 flow [2025-02-08 14:05:06,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 138 transitions, 463 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:06,588 INFO L231 Difference]: Finished difference. Result has 122 places, 115 transitions, 277 flow [2025-02-08 14:05:06,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=122, PETRI_TRANSITIONS=115} [2025-02-08 14:05:06,589 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2025-02-08 14:05:06,589 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 115 transitions, 277 flow [2025-02-08 14:05:06,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:05:06,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:06,589 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:06,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:05:06,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:05:06,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:06,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1040917433, now seen corresponding path program 1 times [2025-02-08 14:05:06,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:06,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449002632] [2025-02-08 14:05:06,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:06,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:06,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:06,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:06,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:06,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:06,651 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:05:06,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:06,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449002632] [2025-02-08 14:05:06,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449002632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:06,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:06,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:06,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365729641] [2025-02-08 14:05:06,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:06,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:05:06,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:06,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:05:06,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:05:06,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 133 [2025-02-08 14:05:06,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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:05:06,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:06,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 133 [2025-02-08 14:05:06,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:13,363 INFO L124 PetriNetUnfolderBase]: 71309/117175 cut-off events. [2025-02-08 14:05:13,364 INFO L125 PetriNetUnfolderBase]: For 7069/7069 co-relation queries the response was YES. [2025-02-08 14:05:13,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224936 conditions, 117175 events. 71309/117175 cut-off events. For 7069/7069 co-relation queries the response was YES. Maximal size of possible extension queue 2681. Compared 1117318 event pairs, 8196 based on Foata normal form. 1872/112251 useless extension candidates. Maximal degree in co-relation 18776. Up to 66277 conditions per place. [2025-02-08 14:05:13,969 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 139 selfloop transitions, 6 changer transitions 0/203 dead transitions. [2025-02-08 14:05:13,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 203 transitions, 741 flow [2025-02-08 14:05:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:05:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:05:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-02-08 14:05:13,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-02-08 14:05:13,971 INFO L175 Difference]: Start difference. First operand has 122 places, 115 transitions, 277 flow. Second operand 6 states and 494 transitions. [2025-02-08 14:05:13,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 203 transitions, 741 flow [2025-02-08 14:05:13,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 203 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:13,978 INFO L231 Difference]: Finished difference. Result has 125 places, 114 transitions, 283 flow [2025-02-08 14:05:13,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=125, PETRI_TRANSITIONS=114} [2025-02-08 14:05:13,979 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2025-02-08 14:05:13,979 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 114 transitions, 283 flow [2025-02-08 14:05:13,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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:05:13,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:13,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:13,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:05:13,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:05:13,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash 316155454, now seen corresponding path program 1 times [2025-02-08 14:05:13,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:13,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914261120] [2025-02-08 14:05:13,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:13,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:14,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:14,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:14,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:14,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:14,043 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:05:14,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:14,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914261120] [2025-02-08 14:05:14,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914261120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:14,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:14,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:14,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744220088] [2025-02-08 14:05:14,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:14,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:14,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:14,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:14,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:14,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 133 [2025-02-08 14:05:14,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 114 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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:05:14,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:14,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 133 [2025-02-08 14:05:14,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:26,031 INFO L124 PetriNetUnfolderBase]: 122469/212886 cut-off events. [2025-02-08 14:05:26,032 INFO L125 PetriNetUnfolderBase]: For 19930/22731 co-relation queries the response was YES. [2025-02-08 14:05:26,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396011 conditions, 212886 events. 122469/212886 cut-off events. For 19930/22731 co-relation queries the response was YES. Maximal size of possible extension queue 5134. Compared 2261500 event pairs, 40461 based on Foata normal form. 2837/195975 useless extension candidates. Maximal degree in co-relation 152540. Up to 90933 conditions per place. [2025-02-08 14:05:27,387 INFO L140 encePairwiseOnDemand]: 122/133 looper letters, 170 selfloop transitions, 18 changer transitions 0/247 dead transitions. [2025-02-08 14:05:27,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 247 transitions, 1009 flow [2025-02-08 14:05:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:05:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:05:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2025-02-08 14:05:27,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.724812030075188 [2025-02-08 14:05:27,389 INFO L175 Difference]: Start difference. First operand has 125 places, 114 transitions, 283 flow. Second operand 5 states and 482 transitions. [2025-02-08 14:05:27,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 247 transitions, 1009 flow [2025-02-08 14:05:27,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 247 transitions, 986 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 14:05:27,400 INFO L231 Difference]: Finished difference. Result has 129 places, 131 transitions, 411 flow [2025-02-08 14:05:27,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=129, PETRI_TRANSITIONS=131} [2025-02-08 14:05:27,400 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 12 predicate places. [2025-02-08 14:05:27,401 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 131 transitions, 411 flow [2025-02-08 14:05:27,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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:05:27,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:27,401 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:05:27,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:05:27,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:05:27,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:27,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2091298508, now seen corresponding path program 1 times [2025-02-08 14:05:27,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:27,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678463362] [2025-02-08 14:05:27,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:27,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:27,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:27,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:27,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:27,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:27,441 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:05:27,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:27,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678463362] [2025-02-08 14:05:27,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678463362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:27,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:27,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:27,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536574651] [2025-02-08 14:05:27,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:27,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:27,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:27,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:27,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:27,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 133 [2025-02-08 14:05:27,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 131 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 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:05:27,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:27,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 133 [2025-02-08 14:05:27,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand