./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce37da4bed964b4727d03a98278bc58de76d7006f2d65a8a42fb0f55b5b34a9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:22:03,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:22:04,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:22:04,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:22:04,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:22:04,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:22:04,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:22:04,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:22:04,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:22:04,041 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:22:04,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:22:04,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:22:04,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:22:04,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:22:04,042 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:22:04,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:22:04,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:22:04,042 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:22:04,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:22:04,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:22:04,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:22:04,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:22:04,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:22:04,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:22:04,043 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:22:04,043 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:22:04,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:22:04,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:22:04,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:22:04,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:22:04,043 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:22:04,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:22:04,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:22:04,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:22:04,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:04,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:22:04,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:22:04,044 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:22:04,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:22:04,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:22:04,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:22:04,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:22:04,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:22:04,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:22:04,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:22:04,044 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce37da4bed964b4727d03a98278bc58de76d7006f2d65a8a42fb0f55b5b34a9c [2025-03-04 15:22:04,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:22:04,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:22:04,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:22:04,243 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:22:04,244 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:22:04,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i [2025-03-04 15:22:05,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e6f7409/4f57b4a035604e3e89aa9afbf583c73a/FLAG6f70448f7 [2025-03-04 15:22:05,705 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:22:05,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i [2025-03-04 15:22:05,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e6f7409/4f57b4a035604e3e89aa9afbf583c73a/FLAG6f70448f7 [2025-03-04 15:22:05,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e6f7409/4f57b4a035604e3e89aa9afbf583c73a [2025-03-04 15:22:05,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:22:05,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:22:05,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:05,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:22:05,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:22:05,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:05" (1/1) ... [2025-03-04 15:22:05,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a7dd77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:05, skipping insertion in model container [2025-03-04 15:22:05,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:05" (1/1) ... [2025-03-04 15:22:05,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:22:06,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:06,244 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:22:06,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:06,317 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:22:06,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06 WrapperNode [2025-03-04 15:22:06,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:06,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:06,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:22:06,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:22:06,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (1/1) ... [2025-03-04 15:22:06,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (1/1) ... [2025-03-04 15:22:06,349 INFO L138 Inliner]: procedures = 252, calls = 53, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 174 [2025-03-04 15:22:06,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:06,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:22:06,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:22:06,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:22:06,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (1/1) ... [2025-03-04 15:22:06,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (1/1) ... [2025-03-04 15:22:06,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (1/1) ... [2025-03-04 15:22:06,370 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 2, 5, 5, 5]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 0, 5, 5, 5]. The 1 writes are split as follows [0, 1, 0, 0, 0]. [2025-03-04 15:22:06,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (1/1) ... [2025-03-04 15:22:06,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (1/1) ... [2025-03-04 15:22:06,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (1/1) ... [2025-03-04 15:22:06,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (1/1) ... [2025-03-04 15:22:06,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (1/1) ... [2025-03-04 15:22:06,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (1/1) ... [2025-03-04 15:22:06,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:22:06,380 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:22:06,380 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:22:06,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:22:06,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (1/1) ... [2025-03-04 15:22:06,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:06,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:06,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:22:06,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:22:06,423 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:22:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:22:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:22:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 15:22:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:22:06,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:22:06,425 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:22:06,542 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:22:06,544 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:22:06,700 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L911: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:22:06,700 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L911-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 15:22:06,788 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:22:06,789 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:22:06,905 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:22:06,907 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:22:06,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:06 BoogieIcfgContainer [2025-03-04 15:22:06,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:22:06,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:22:06,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:22:06,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:22:06,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:22:05" (1/3) ... [2025-03-04 15:22:06,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418361db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:06, skipping insertion in model container [2025-03-04 15:22:06,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:06" (2/3) ... [2025-03-04 15:22:06,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418361db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:06, skipping insertion in model container [2025-03-04 15:22:06,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:06" (3/3) ... [2025-03-04 15:22:06,916 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_27-funptr_racing.i [2025-03-04 15:22:06,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:22:06,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_27-funptr_racing.i that has 2 procedures, 80 locations, 1 initial locations, 7 loop locations, and 12 error locations. [2025-03-04 15:22:06,929 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:22:06,982 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:22:07,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 96 transitions, 199 flow [2025-03-04 15:22:07,056 INFO L124 PetriNetUnfolderBase]: 18/115 cut-off events. [2025-03-04 15:22:07,058 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:07,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 115 events. 18/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 408 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 87. Up to 4 conditions per place. [2025-03-04 15:22:07,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 96 transitions, 199 flow [2025-03-04 15:22:07,066 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 95 transitions, 197 flow [2025-03-04 15:22:07,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:07,080 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;@44a0da99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:07,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 15:22:07,088 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:07,088 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:22:07,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:07,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:07,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:07,089 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-03-04 15:22:07,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:07,092 INFO L85 PathProgramCache]: Analyzing trace with hash 424772110, now seen corresponding path program 1 times [2025-03-04 15:22:07,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:07,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345133514] [2025-03-04 15:22:07,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:07,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:07,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:07,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:07,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:07,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:07,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:07,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345133514] [2025-03-04 15:22:07,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345133514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:07,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:07,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:07,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148259165] [2025-03-04 15:22:07,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:07,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:07,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:07,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:07,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:07,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 96 [2025-03-04 15:22:07,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 95 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:07,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:07,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 96 [2025-03-04 15:22:07,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:07,681 INFO L124 PetriNetUnfolderBase]: 420/1065 cut-off events. [2025-03-04 15:22:07,681 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:07,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 1065 events. 420/1065 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6434 event pairs, 0 based on Foata normal form. 152/1138 useless extension candidates. Maximal degree in co-relation 1895. Up to 786 conditions per place. [2025-03-04 15:22:07,691 INFO L140 encePairwiseOnDemand]: 76/96 looper letters, 97 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2025-03-04 15:22:07,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 134 transitions, 475 flow [2025-03-04 15:22:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2025-03-04 15:22:07,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7213541666666666 [2025-03-04 15:22:07,706 INFO L175 Difference]: Start difference. First operand has 83 places, 95 transitions, 197 flow. Second operand 4 states and 277 transitions. [2025-03-04 15:22:07,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 134 transitions, 475 flow [2025-03-04 15:22:07,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 134 transitions, 475 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:07,716 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 175 flow [2025-03-04 15:22:07,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-03-04 15:22:07,720 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 2 predicate places. [2025-03-04 15:22:07,720 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 175 flow [2025-03-04 15:22:07,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:07,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:07,721 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:07,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:22:07,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:22:07,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1412618969, now seen corresponding path program 1 times [2025-03-04 15:22:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:07,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395981253] [2025-03-04 15:22:07,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:07,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:22:07,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:22:07,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:07,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:07,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:07,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:22:07,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:22:07,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:07,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:07,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:07,783 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:07,784 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-03-04 15:22:07,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2025-03-04 15:22:07,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2025-03-04 15:22:07,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2025-03-04 15:22:07,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2025-03-04 15:22:07,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2025-03-04 15:22:07,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2025-03-04 15:22:07,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2025-03-04 15:22:07,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2025-03-04 15:22:07,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2025-03-04 15:22:07,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2025-03-04 15:22:07,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2025-03-04 15:22:07,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2025-03-04 15:22:07,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2025-03-04 15:22:07,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2025-03-04 15:22:07,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2025-03-04 15:22:07,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2025-03-04 15:22:07,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2025-03-04 15:22:07,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2025-03-04 15:22:07,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2025-03-04 15:22:07,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2025-03-04 15:22:07,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:22:07,789 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 15:22:07,791 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:07,791 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:22:07,823 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:22:07,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 161 transitions, 338 flow [2025-03-04 15:22:07,866 INFO L124 PetriNetUnfolderBase]: 35/218 cut-off events. [2025-03-04 15:22:07,868 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:22:07,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 218 events. 35/218 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 980 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 159. Up to 6 conditions per place. [2025-03-04 15:22:07,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 161 transitions, 338 flow [2025-03-04 15:22:07,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 161 transitions, 338 flow [2025-03-04 15:22:07,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:07,877 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;@44a0da99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:07,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-04 15:22:07,880 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:07,880 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 15:22:07,881 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:07,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:07,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:07,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:07,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash 578475758, now seen corresponding path program 1 times [2025-03-04 15:22:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:07,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805790730] [2025-03-04 15:22:07,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:07,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:07,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:07,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:07,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:07,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:07,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:07,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805790730] [2025-03-04 15:22:07,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805790730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:07,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:07,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:07,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957980989] [2025-03-04 15:22:07,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:07,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:07,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:07,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:07,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:07,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 161 [2025-03-04 15:22:07,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 161 transitions, 338 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-03-04 15:22:07,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:07,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 161 [2025-03-04 15:22:07,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:11,198 INFO L124 PetriNetUnfolderBase]: 27146/52944 cut-off events. [2025-03-04 15:22:11,198 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-04 15:22:11,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94474 conditions, 52944 events. 27146/52944 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 1308. Compared 520072 event pairs, 14035 based on Foata normal form. 6808/54382 useless extension candidates. Maximal degree in co-relation 9314. Up to 41299 conditions per place. [2025-03-04 15:22:11,451 INFO L140 encePairwiseOnDemand]: 129/161 looper letters, 131 selfloop transitions, 3 changer transitions 0/192 dead transitions. [2025-03-04 15:22:11,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 192 transitions, 668 flow [2025-03-04 15:22:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2025-03-04 15:22:11,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6506211180124224 [2025-03-04 15:22:11,456 INFO L175 Difference]: Start difference. First operand has 136 places, 161 transitions, 338 flow. Second operand 4 states and 419 transitions. [2025-03-04 15:22:11,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 192 transitions, 668 flow [2025-03-04 15:22:11,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 192 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:11,461 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 310 flow [2025-03-04 15:22:11,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2025-03-04 15:22:11,462 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 5 predicate places. [2025-03-04 15:22:11,462 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 310 flow [2025-03-04 15:22:11,463 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-03-04 15:22:11,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:11,463 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:11,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:22:11,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:11,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:11,464 INFO L85 PathProgramCache]: Analyzing trace with hash 970574619, now seen corresponding path program 1 times [2025-03-04 15:22:11,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:11,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170537672] [2025-03-04 15:22:11,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:11,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:11,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:22:11,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:22:11,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:11,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:11,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:11,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170537672] [2025-03-04 15:22:11,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170537672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:11,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:22:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10252689] [2025-03-04 15:22:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:11,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:11,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:11,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:11,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:11,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 161 [2025-03-04 15:22:11,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 310 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-03-04 15:22:11,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:11,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 161 [2025-03-04 15:22:11,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:14,445 INFO L124 PetriNetUnfolderBase]: 26214/46900 cut-off events. [2025-03-04 15:22:14,446 INFO L125 PetriNetUnfolderBase]: For 2888/2888 co-relation queries the response was YES. [2025-03-04 15:22:14,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90211 conditions, 46900 events. 26214/46900 cut-off events. For 2888/2888 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 427414 event pairs, 1784 based on Foata normal form. 756/44296 useless extension candidates. Maximal degree in co-relation 6324. Up to 29183 conditions per place. [2025-03-04 15:22:14,653 INFO L140 encePairwiseOnDemand]: 156/161 looper letters, 235 selfloop transitions, 6 changer transitions 0/299 dead transitions. [2025-03-04 15:22:14,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 299 transitions, 1114 flow [2025-03-04 15:22:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 590 transitions. [2025-03-04 15:22:14,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6107660455486542 [2025-03-04 15:22:14,655 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 310 flow. Second operand 6 states and 590 transitions. [2025-03-04 15:22:14,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 299 transitions, 1114 flow [2025-03-04 15:22:14,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 299 transitions, 1112 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:14,663 INFO L231 Difference]: Finished difference. Result has 144 places, 136 transitions, 316 flow [2025-03-04 15:22:14,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=144, PETRI_TRANSITIONS=136} [2025-03-04 15:22:14,664 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 8 predicate places. [2025-03-04 15:22:14,665 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 136 transitions, 316 flow [2025-03-04 15:22:14,665 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-03-04 15:22:14,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:14,665 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:22:14,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:22:14,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:14,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:14,666 INFO L85 PathProgramCache]: Analyzing trace with hash 23042622, now seen corresponding path program 1 times [2025-03-04 15:22:14,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:14,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933495553] [2025-03-04 15:22:14,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:14,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:22:14,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:22:14,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:14,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:14,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:14,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933495553] [2025-03-04 15:22:14,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933495553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:14,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:14,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:14,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823371174] [2025-03-04 15:22:14,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:14,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:14,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:14,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:14,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:14,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 161 [2025-03-04 15:22:14,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 136 transitions, 316 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-03-04 15:22:14,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:14,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 161 [2025-03-04 15:22:14,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:16,779 INFO L124 PetriNetUnfolderBase]: 24731/43787 cut-off events. [2025-03-04 15:22:16,779 INFO L125 PetriNetUnfolderBase]: For 5736/5736 co-relation queries the response was YES. [2025-03-04 15:22:16,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86441 conditions, 43787 events. 24731/43787 cut-off events. For 5736/5736 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 388511 event pairs, 2002 based on Foata normal form. 757/42191 useless extension candidates. Maximal degree in co-relation 26283. Up to 31590 conditions per place. [2025-03-04 15:22:16,949 INFO L140 encePairwiseOnDemand]: 156/161 looper letters, 180 selfloop transitions, 6 changer transitions 0/244 dead transitions. [2025-03-04 15:22:16,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 244 transitions, 902 flow [2025-03-04 15:22:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2025-03-04 15:22:16,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6475155279503105 [2025-03-04 15:22:16,951 INFO L175 Difference]: Start difference. First operand has 144 places, 136 transitions, 316 flow. Second operand 4 states and 417 transitions. [2025-03-04 15:22:16,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 244 transitions, 902 flow [2025-03-04 15:22:16,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 244 transitions, 886 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:22:16,970 INFO L231 Difference]: Finished difference. Result has 142 places, 136 transitions, 316 flow [2025-03-04 15:22:16,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=316, PETRI_PLACES=142, PETRI_TRANSITIONS=136} [2025-03-04 15:22:16,971 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 6 predicate places. [2025-03-04 15:22:16,971 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 136 transitions, 316 flow [2025-03-04 15:22:16,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-03-04 15:22:16,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:16,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:16,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:22:16,971 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:16,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1834301168, now seen corresponding path program 1 times [2025-03-04 15:22:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:16,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403010792] [2025-03-04 15:22:16,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:16,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:22:16,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:22:16,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:16,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:17,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-03-04 15:22:17,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:17,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403010792] [2025-03-04 15:22:17,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403010792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:17,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:17,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:17,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458583125] [2025-03-04 15:22:17,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:17,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:17,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:17,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:17,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:17,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 161 [2025-03-04 15:22:17,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 136 transitions, 316 flow. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:17,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:17,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 161 [2025-03-04 15:22:17,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:20,356 INFO L124 PetriNetUnfolderBase]: 31077/62486 cut-off events. [2025-03-04 15:22:20,356 INFO L125 PetriNetUnfolderBase]: For 6844/6844 co-relation queries the response was YES. [2025-03-04 15:22:20,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113909 conditions, 62486 events. 31077/62486 cut-off events. For 6844/6844 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 644647 event pairs, 9947 based on Foata normal form. 515/57846 useless extension candidates. Maximal degree in co-relation 93547. Up to 29046 conditions per place. [2025-03-04 15:22:20,592 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 213 selfloop transitions, 18 changer transitions 0/288 dead transitions. [2025-03-04 15:22:20,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 288 transitions, 1141 flow [2025-03-04 15:22:20,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:22:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:22:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2025-03-04 15:22:20,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6472049689440994 [2025-03-04 15:22:20,594 INFO L175 Difference]: Start difference. First operand has 142 places, 136 transitions, 316 flow. Second operand 5 states and 521 transitions. [2025-03-04 15:22:20,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 288 transitions, 1141 flow [2025-03-04 15:22:20,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 288 transitions, 1125 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:22:20,598 INFO L231 Difference]: Finished difference. Result has 148 places, 153 transitions, 448 flow [2025-03-04 15:22:20,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=448, PETRI_PLACES=148, PETRI_TRANSITIONS=153} [2025-03-04 15:22:20,599 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 12 predicate places. [2025-03-04 15:22:20,599 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 153 transitions, 448 flow [2025-03-04 15:22:20,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:20,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:20,600 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 15:22:20,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:22:20,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-03-04 15:22:20,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash 669141868, now seen corresponding path program 1 times [2025-03-04 15:22:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:20,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888429483] [2025-03-04 15:22:20,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:20,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:20,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:22:20,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:22:20,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:20,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:20,617 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:20,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:22:20,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:22:20,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:20,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:20,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:20,634 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:20,634 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-03-04 15:22:20,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 29 remaining) [2025-03-04 15:22:20,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 29 remaining) [2025-03-04 15:22:20,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 29 remaining) [2025-03-04 15:22:20,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 29 remaining) [2025-03-04 15:22:20,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 29 remaining) [2025-03-04 15:22:20,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 29 remaining) [2025-03-04 15:22:20,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 29 remaining) [2025-03-04 15:22:20,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 29 remaining) [2025-03-04 15:22:20,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 29 remaining) [2025-03-04 15:22:20,636 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 29 remaining) [2025-03-04 15:22:20,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 29 remaining) [2025-03-04 15:22:20,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 29 remaining) [2025-03-04 15:22:20,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 29 remaining) [2025-03-04 15:22:20,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 29 remaining) [2025-03-04 15:22:20,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:22:20,638 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 15:22:20,638 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:20,638 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:22:20,671 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:22:20,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 226 transitions, 479 flow [2025-03-04 15:22:20,693 INFO L124 PetriNetUnfolderBase]: 55/340 cut-off events. [2025-03-04 15:22:20,694 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:22:20,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 340 events. 55/340 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1645 event pairs, 1 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 242. Up to 12 conditions per place. [2025-03-04 15:22:20,697 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 226 transitions, 479 flow [2025-03-04 15:22:20,700 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 226 transitions, 479 flow [2025-03-04 15:22:20,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:20,701 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;@44a0da99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:20,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-03-04 15:22:20,702 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:20,702 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 15:22:20,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:20,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:20,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:20,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-03-04 15:22:20,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:20,703 INFO L85 PathProgramCache]: Analyzing trace with hash 794209231, now seen corresponding path program 1 times [2025-03-04 15:22:20,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:20,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995324008] [2025-03-04 15:22:20,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:20,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:20,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:20,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:20,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:20,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:20,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:20,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995324008] [2025-03-04 15:22:20,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995324008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:20,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:20,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659500609] [2025-03-04 15:22:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:20,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:20,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:20,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:20,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:20,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 226 [2025-03-04 15:22:20,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 226 transitions, 479 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:20,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:20,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 226 [2025-03-04 15:22:20,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand