./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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_28-funptr_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2d1ca14c91be6e836759580a015ed2d4b9eb8ea9888f9f925ea579405b630f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:35:34,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:35:34,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:35:34,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:35:34,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:35:34,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:35:34,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:35:34,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:35:34,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:35:34,360 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:35:34,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:35:34,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:35:34,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:35:34,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:35:34,361 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:35:34,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:35:34,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:35:34,362 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:35:34,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:35:34,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:35:34,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:35:34,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:35:34,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:35:34,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:35:34,362 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:35:34,362 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:35:34,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:35:34,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:35:34,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:35:34,363 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 -> 3e2d1ca14c91be6e836759580a015ed2d4b9eb8ea9888f9f925ea579405b630f [2025-03-09 06:35:34,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:35:34,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:35:34,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:35:34,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:35:34,602 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:35:34,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i [2025-03-09 06:35:35,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b9d2cfa/903cd027e40749fd8b1de8bf03ffd68b/FLAG92617f64c [2025-03-09 06:35:36,097 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:35:36,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i [2025-03-09 06:35:36,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b9d2cfa/903cd027e40749fd8b1de8bf03ffd68b/FLAG92617f64c [2025-03-09 06:35:36,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b9d2cfa/903cd027e40749fd8b1de8bf03ffd68b [2025-03-09 06:35:36,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:35:36,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:35:36,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:35:36,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:35:36,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:35:36,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db01a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36, skipping insertion in model container [2025-03-09 06:35:36,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:35:36,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:35:36,768 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:35:36,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:35:36,836 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:35:36,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36 WrapperNode [2025-03-09 06:35:36,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:35:36,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:35:36,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:35:36,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:35:36,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,872 INFO L138 Inliner]: procedures = 252, calls = 52, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2025-03-09 06:35:36,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:35:36,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:35:36,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:35:36,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:35:36,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,894 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2025-03-09 06:35:36,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:35:36,912 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:35:36,913 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:35:36,913 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:35:36,913 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (1/1) ... [2025-03-09 06:35:36,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:35:36,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:35:36,945 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-09 06:35:36,948 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-09 06:35:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 06:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 06:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:35:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 06:35:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 06:35:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:35:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:35:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 06:35:36,967 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 06:35:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:35:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 06:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 06:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:35:36,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:35:36,969 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:35:37,076 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:35:37,078 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:35:37,241 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L911: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-09 06:35:37,241 INFO L1307 $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-09 06:35:37,293 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:35:37,293 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:35:37,403 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:35:37,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:35:37,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:35:37 BoogieIcfgContainer [2025-03-09 06:35:37,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:35:37,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:35:37,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:35:37,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:35:37,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:35:36" (1/3) ... [2025-03-09 06:35:37,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c4535c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:35:37, skipping insertion in model container [2025-03-09 06:35:37,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:36" (2/3) ... [2025-03-09 06:35:37,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c4535c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:35:37, skipping insertion in model container [2025-03-09 06:35:37,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:35:37" (3/3) ... [2025-03-09 06:35:37,414 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_28-funptr_racefree.i [2025-03-09 06:35:37,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:35:37,427 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_28-funptr_racefree.i that has 2 procedures, 58 locations, 1 initial locations, 5 loop locations, and 8 error locations. [2025-03-09 06:35:37,428 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:35:37,480 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 06:35:37,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 67 transitions, 141 flow [2025-03-09 06:35:37,544 INFO L124 PetriNetUnfolderBase]: 11/86 cut-off events. [2025-03-09 06:35:37,547 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:35:37,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 86 events. 11/86 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 245 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2025-03-09 06:35:37,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 67 transitions, 141 flow [2025-03-09 06:35:37,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 66 transitions, 139 flow [2025-03-09 06:35:37,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:35:37,568 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;@70772589, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:35:37,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-09 06:35:37,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:35:37,573 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-09 06:35:37,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:35:37,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:37,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:35:37,574 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-03-09 06:35:37,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:37,578 INFO L85 PathProgramCache]: Analyzing trace with hash 344819486, now seen corresponding path program 1 times [2025-03-09 06:35:37,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:37,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167628880] [2025-03-09 06:35:37,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:37,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:37,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:35:37,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:35:37,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:37,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:37,826 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-09 06:35:37,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:37,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167628880] [2025-03-09 06:35:37,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167628880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:37,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:37,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:35:37,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355116746] [2025-03-09 06:35:37,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:37,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:35:37,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:37,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:35:37,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:35:37,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 67 [2025-03-09 06:35:37,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-09 06:35:37,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:37,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 67 [2025-03-09 06:35:37,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:35:38,064 INFO L124 PetriNetUnfolderBase]: 240/634 cut-off events. [2025-03-09 06:35:38,065 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:35:38,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 634 events. 240/634 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3164 event pairs, 0 based on Foata normal form. 82/675 useless extension candidates. Maximal degree in co-relation 1120. Up to 464 conditions per place. [2025-03-09 06:35:38,070 INFO L140 encePairwiseOnDemand]: 53/67 looper letters, 64 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2025-03-09 06:35:38,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 319 flow [2025-03-09 06:35:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:35:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:35:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2025-03-09 06:35:38,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.664179104477612 [2025-03-09 06:35:38,085 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 139 flow. Second operand 4 states and 178 transitions. [2025-03-09 06:35:38,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 319 flow [2025-03-09 06:35:38,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 319 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:35:38,098 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 129 flow [2025-03-09 06:35:38,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-03-09 06:35:38,103 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2025-03-09 06:35:38,104 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 129 flow [2025-03-09 06:35:38,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-09 06:35:38,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:38,104 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:35:38,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:35:38,105 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-03-09 06:35:38,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:38,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1044190372, now seen corresponding path program 1 times [2025-03-09 06:35:38,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:38,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623553236] [2025-03-09 06:35:38,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:38,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:38,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:35:38,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:35:38,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:38,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:35:38,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:35:38,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:35:38,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:35:38,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:38,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:35:38,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:35:38,165 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:35:38,166 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-09 06:35:38,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-09 06:35:38,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-09 06:35:38,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-09 06:35:38,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-09 06:35:38,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-09 06:35:38,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-09 06:35:38,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-09 06:35:38,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-09 06:35:38,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-09 06:35:38,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-09 06:35:38,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-09 06:35:38,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-09 06:35:38,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:35:38,168 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 06:35:38,170 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:35:38,170 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 06:35:38,193 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:35:38,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 103 transitions, 222 flow [2025-03-09 06:35:38,228 INFO L124 PetriNetUnfolderBase]: 21/160 cut-off events. [2025-03-09 06:35:38,229 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 06:35:38,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 160 events. 21/160 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 584 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 101. Up to 6 conditions per place. [2025-03-09 06:35:38,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 103 transitions, 222 flow [2025-03-09 06:35:38,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 103 transitions, 222 flow [2025-03-09 06:35:38,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:35:38,233 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;@70772589, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:35:38,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-09 06:35:38,235 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:35:38,235 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-09 06:35:38,235 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:35:38,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:38,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:35:38,235 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-03-09 06:35:38,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:38,235 INFO L85 PathProgramCache]: Analyzing trace with hash 443145575, now seen corresponding path program 1 times [2025-03-09 06:35:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:38,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390268711] [2025-03-09 06:35:38,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:38,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:38,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:35:38,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:35:38,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:38,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:38,305 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-09 06:35:38,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:38,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390268711] [2025-03-09 06:35:38,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390268711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:38,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:38,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:35:38,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657591745] [2025-03-09 06:35:38,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:38,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:35:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:38,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:35:38,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:35:38,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 103 [2025-03-09 06:35:38,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 103 transitions, 222 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-09 06:35:38,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:38,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 103 [2025-03-09 06:35:38,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:35:39,866 INFO L124 PetriNetUnfolderBase]: 9858/19384 cut-off events. [2025-03-09 06:35:39,867 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-09 06:35:39,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34900 conditions, 19384 events. 9858/19384 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 162144 event pairs, 4688 based on Foata normal form. 2187/19947 useless extension candidates. Maximal degree in co-relation 1998. Up to 15372 conditions per place. [2025-03-09 06:35:39,984 INFO L140 encePairwiseOnDemand]: 83/103 looper letters, 87 selfloop transitions, 3 changer transitions 0/124 dead transitions. [2025-03-09 06:35:39,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 124 transitions, 444 flow [2025-03-09 06:35:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:35:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:35:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2025-03-09 06:35:39,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6189320388349514 [2025-03-09 06:35:39,986 INFO L175 Difference]: Start difference. First operand has 92 places, 103 transitions, 222 flow. Second operand 4 states and 255 transitions. [2025-03-09 06:35:39,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 124 transitions, 444 flow [2025-03-09 06:35:39,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 124 transitions, 444 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:35:39,990 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 218 flow [2025-03-09 06:35:39,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2025-03-09 06:35:39,991 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 5 predicate places. [2025-03-09 06:35:39,992 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 218 flow [2025-03-09 06:35:39,992 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-09 06:35:39,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:39,992 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:35:39,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:35:39,992 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-03-09 06:35:39,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash -477284407, now seen corresponding path program 1 times [2025-03-09 06:35:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:39,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646571585] [2025-03-09 06:35:39,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:39,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:40,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:35:40,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:35:40,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:40,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:40,111 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-09 06:35:40,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:40,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646571585] [2025-03-09 06:35:40,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646571585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:40,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:40,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:35:40,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314481742] [2025-03-09 06:35:40,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:40,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:35:40,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:40,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:35:40,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:35:40,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 103 [2025-03-09 06:35:40,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:35:40,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:40,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 103 [2025-03-09 06:35:40,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:35:41,467 INFO L124 PetriNetUnfolderBase]: 9314/17140 cut-off events. [2025-03-09 06:35:41,467 INFO L125 PetriNetUnfolderBase]: For 1139/1139 co-relation queries the response was YES. [2025-03-09 06:35:41,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33068 conditions, 17140 events. 9314/17140 cut-off events. For 1139/1139 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 135716 event pairs, 527 based on Foata normal form. 289/16555 useless extension candidates. Maximal degree in co-relation 1948. Up to 10580 conditions per place. [2025-03-09 06:35:41,547 INFO L140 encePairwiseOnDemand]: 98/103 looper letters, 147 selfloop transitions, 6 changer transitions 0/187 dead transitions. [2025-03-09 06:35:41,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 187 transitions, 714 flow [2025-03-09 06:35:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:35:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:35:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 358 transitions. [2025-03-09 06:35:41,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5792880258899676 [2025-03-09 06:35:41,551 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 218 flow. Second operand 6 states and 358 transitions. [2025-03-09 06:35:41,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 187 transitions, 714 flow [2025-03-09 06:35:41,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 187 transitions, 712 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:35:41,557 INFO L231 Difference]: Finished difference. Result has 100 places, 90 transitions, 224 flow [2025-03-09 06:35:41,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=100, PETRI_TRANSITIONS=90} [2025-03-09 06:35:41,558 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 8 predicate places. [2025-03-09 06:35:41,559 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 90 transitions, 224 flow [2025-03-09 06:35:41,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:35:41,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:41,559 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:35:41,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:35:41,559 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-03-09 06:35:41,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1910914352, now seen corresponding path program 1 times [2025-03-09 06:35:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:41,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233819634] [2025-03-09 06:35:41,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:41,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:35:41,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:35:41,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:41,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:41,679 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-09 06:35:41,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:41,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233819634] [2025-03-09 06:35:41,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233819634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:41,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:41,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:35:41,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512880767] [2025-03-09 06:35:41,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:41,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:35:41,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:41,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:35:41,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:35:41,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 103 [2025-03-09 06:35:41,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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-09 06:35:41,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:41,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 103 [2025-03-09 06:35:41,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:35:42,511 INFO L124 PetriNetUnfolderBase]: 8770/15832 cut-off events. [2025-03-09 06:35:42,511 INFO L125 PetriNetUnfolderBase]: For 2441/2441 co-relation queries the response was YES. [2025-03-09 06:35:42,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31540 conditions, 15832 events. 8770/15832 cut-off events. For 2441/2441 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 119971 event pairs, 1424 based on Foata normal form. 289/15657 useless extension candidates. Maximal degree in co-relation 19409. Up to 11446 conditions per place. [2025-03-09 06:35:42,575 INFO L140 encePairwiseOnDemand]: 98/103 looper letters, 114 selfloop transitions, 6 changer transitions 0/154 dead transitions. [2025-03-09 06:35:42,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 154 transitions, 590 flow [2025-03-09 06:35:42,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:35:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:35:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2025-03-09 06:35:42,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6189320388349514 [2025-03-09 06:35:42,578 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 224 flow. Second operand 4 states and 255 transitions. [2025-03-09 06:35:42,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 154 transitions, 590 flow [2025-03-09 06:35:42,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 154 transitions, 574 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-09 06:35:42,600 INFO L231 Difference]: Finished difference. Result has 98 places, 90 transitions, 224 flow [2025-03-09 06:35:42,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=98, PETRI_TRANSITIONS=90} [2025-03-09 06:35:42,602 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 6 predicate places. [2025-03-09 06:35:42,602 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 90 transitions, 224 flow [2025-03-09 06:35:42,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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-09 06:35:42,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:42,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:35:42,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:35:42,602 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-03-09 06:35:42,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:42,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1867360008, now seen corresponding path program 1 times [2025-03-09 06:35:42,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:42,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239116161] [2025-03-09 06:35:42,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:42,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:42,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:35:42,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:35:42,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:42,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:42,677 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-09 06:35:42,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:42,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239116161] [2025-03-09 06:35:42,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239116161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:42,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:42,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:35:42,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685655767] [2025-03-09 06:35:42,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:42,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:35:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:42,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:35:42,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:35:42,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 103 [2025-03-09 06:35:42,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 90 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-09 06:35:42,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:42,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 103 [2025-03-09 06:35:42,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:35:43,883 INFO L124 PetriNetUnfolderBase]: 11365/22956 cut-off events. [2025-03-09 06:35:43,883 INFO L125 PetriNetUnfolderBase]: For 2776/2776 co-relation queries the response was YES. [2025-03-09 06:35:43,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42416 conditions, 22956 events. 11365/22956 cut-off events. For 2776/2776 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 200753 event pairs, 3904 based on Foata normal form. 323/21696 useless extension candidates. Maximal degree in co-relation 30308. Up to 10332 conditions per place. [2025-03-09 06:35:43,971 INFO L140 encePairwiseOnDemand]: 94/103 looper letters, 156 selfloop transitions, 12 changer transitions 0/202 dead transitions. [2025-03-09 06:35:43,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 202 transitions, 843 flow [2025-03-09 06:35:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:35:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:35:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 343 transitions. [2025-03-09 06:35:43,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6660194174757281 [2025-03-09 06:35:43,973 INFO L175 Difference]: Start difference. First operand has 98 places, 90 transitions, 224 flow. Second operand 5 states and 343 transitions. [2025-03-09 06:35:43,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 202 transitions, 843 flow [2025-03-09 06:35:43,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 202 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:35:43,976 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 310 flow [2025-03-09 06:35:43,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2025-03-09 06:35:43,977 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 12 predicate places. [2025-03-09 06:35:43,977 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 310 flow [2025-03-09 06:35:43,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-09 06:35:43,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:43,978 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 06:35:43,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:35:43,978 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:35:43,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:43,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1857324666, now seen corresponding path program 1 times [2025-03-09 06:35:43,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:43,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445352674] [2025-03-09 06:35:43,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:43,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:43,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:35:43,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:35:43,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:43,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:35:43,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:35:43,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:35:44,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:35:44,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:44,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:35:44,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:35:44,017 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:35:44,017 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-09 06:35:44,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-09 06:35:44,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-09 06:35:44,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-09 06:35:44,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-09 06:35:44,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-09 06:35:44,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-09 06:35:44,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-09 06:35:44,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-09 06:35:44,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-09 06:35:44,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-09 06:35:44,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-09 06:35:44,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-09 06:35:44,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-09 06:35:44,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-09 06:35:44,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-09 06:35:44,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-09 06:35:44,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:35:44,020 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-09 06:35:44,020 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:35:44,020 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 06:35:44,046 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 06:35:44,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 139 transitions, 305 flow [2025-03-09 06:35:44,068 INFO L124 PetriNetUnfolderBase]: 34/253 cut-off events. [2025-03-09 06:35:44,069 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-09 06:35:44,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 253 events. 34/253 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1049 event pairs, 1 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 175. Up to 12 conditions per place. [2025-03-09 06:35:44,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 139 transitions, 305 flow [2025-03-09 06:35:44,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 139 transitions, 305 flow [2025-03-09 06:35:44,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:35:44,073 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;@70772589, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:35:44,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-09 06:35:44,075 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:35:44,075 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-09 06:35:44,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:35:44,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:44,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:35:44,076 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-09 06:35:44,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:44,076 INFO L85 PathProgramCache]: Analyzing trace with hash 575826644, now seen corresponding path program 1 times [2025-03-09 06:35:44,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:44,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620820642] [2025-03-09 06:35:44,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:44,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:44,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:35:44,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:35:44,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:44,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:44,119 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-09 06:35:44,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:44,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620820642] [2025-03-09 06:35:44,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620820642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:44,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:44,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:35:44,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605159108] [2025-03-09 06:35:44,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:44,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:35:44,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:44,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:35:44,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:35:44,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 139 [2025-03-09 06:35:44,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 139 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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-09 06:35:44,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:44,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 139 [2025-03-09 06:35:44,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:08,104 INFO L124 PetriNetUnfolderBase]: 260231/445843 cut-off events. [2025-03-09 06:36:08,104 INFO L125 PetriNetUnfolderBase]: For 3306/3306 co-relation queries the response was YES. [2025-03-09 06:36:08,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804928 conditions, 445843 events. 260231/445843 cut-off events. For 3306/3306 co-relation queries the response was YES. Maximal size of possible extension queue 7331. Compared 4762295 event pairs, 170145 based on Foata normal form. 53544/465844 useless extension candidates. Maximal degree in co-relation 36262. Up to 356848 conditions per place. [2025-03-09 06:36:10,675 INFO L140 encePairwiseOnDemand]: 113/139 looper letters, 105 selfloop transitions, 3 changer transitions 0/154 dead transitions. [2025-03-09 06:36:10,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 154 transitions, 551 flow [2025-03-09 06:36:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:36:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:36:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2025-03-09 06:36:10,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5881294964028777 [2025-03-09 06:36:10,677 INFO L175 Difference]: Start difference. First operand has 123 places, 139 transitions, 305 flow. Second operand 4 states and 327 transitions. [2025-03-09 06:36:10,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 154 transitions, 551 flow [2025-03-09 06:36:10,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 154 transitions, 551 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:36:10,685 INFO L231 Difference]: Finished difference. Result has 128 places, 121 transitions, 289 flow [2025-03-09 06:36:10,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=289, PETRI_PLACES=128, PETRI_TRANSITIONS=121} [2025-03-09 06:36:10,686 INFO L279 CegarLoopForPetriNet]: 123 programPoint places, 5 predicate places. [2025-03-09 06:36:10,686 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 121 transitions, 289 flow [2025-03-09 06:36:10,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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-09 06:36:10,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:10,686 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:10,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:36:10,687 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-03-09 06:36:10,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash -371354647, now seen corresponding path program 1 times [2025-03-09 06:36:10,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:10,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308174279] [2025-03-09 06:36:10,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:10,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:10,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:36:10,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:36:10,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:10,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:10,752 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-09 06:36:10,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308174279] [2025-03-09 06:36:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308174279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:10,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:10,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:36:10,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522817263] [2025-03-09 06:36:10,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:10,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:36:10,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:10,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:36:10,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:36:10,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 139 [2025-03-09 06:36:10,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 121 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 47.5) internal successors, (285), 6 states have internal predecessors, (285), 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-09 06:36:10,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:10,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 139 [2025-03-09 06:36:10,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand