./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_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 b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:21:27,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:21:27,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:21:27,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:21:27,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:21:27,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:21:27,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:21:27,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:21:27,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:21:27,992 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:21:27,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:21:27,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:21:27,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:21:27,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:21:27,993 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:21:27,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:21:27,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:21:27,993 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:21:27,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:21:27,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:21:27,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:21:27,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:21:27,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:21:27,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:21:27,995 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:21:27,995 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:21:27,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:21:27,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:21:27,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:21:27,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:21:27,997 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 -> b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 [2025-03-04 15:21:28,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:21:28,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:21:28,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:21:28,224 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:21:28,225 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:21:28,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2025-03-04 15:21:29,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/862bb5b86/5013977b9ebf4182ada8347e30f2ac49/FLAGc66792e23 [2025-03-04 15:21:29,728 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:21:29,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2025-03-04 15:21:29,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/862bb5b86/5013977b9ebf4182ada8347e30f2ac49/FLAGc66792e23 [2025-03-04 15:21:29,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/862bb5b86/5013977b9ebf4182ada8347e30f2ac49 [2025-03-04 15:21:29,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:21:29,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:21:29,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:21:29,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:21:29,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:21:29,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:29,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aadf523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29, skipping insertion in model container [2025-03-04 15:21:29,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:29,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:21:30,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:21:30,184 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:21:30,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:21:30,253 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:21:30,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:30 WrapperNode [2025-03-04 15:21:30,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:21:30,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:21:30,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:21:30,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:21:30,259 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:21:30" (1/1) ... [2025-03-04 15:21:30,267 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:21:30" (1/1) ... [2025-03-04 15:21:30,281 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2025-03-04 15:21:30,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:21:30,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:21:30,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:21:30,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:21:30,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:30" (1/1) ... [2025-03-04 15:21:30,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:30" (1/1) ... [2025-03-04 15:21:30,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:30" (1/1) ... [2025-03-04 15:21:30,301 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-03-04 15:21:30,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:30" (1/1) ... [2025-03-04 15:21:30,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:30" (1/1) ... [2025-03-04 15:21:30,307 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:30" (1/1) ... [2025-03-04 15:21:30,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:30" (1/1) ... [2025-03-04 15:21:30,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:30" (1/1) ... [2025-03-04 15:21:30,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:30" (1/1) ... [2025-03-04 15:21:30,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:21:30,317 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:21:30,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:21:30,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:21:30,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:30" (1/1) ... [2025-03-04 15:21:30,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:21:30,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:21:30,347 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:21:30,350 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:21:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:21:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:21:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:21:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:21:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:21:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:21:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:21:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:21:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:21:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:21:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:21:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:21:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:21:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:21:30,367 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:21:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:21:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:21:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:21:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:21:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:21:30,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:21:30,368 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:21:30,497 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:21:30,500 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:21:30,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:21:30,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 15:21:30,739 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:21:30,739 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:21:30,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:21:30,929 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:21:30,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:21:30 BoogieIcfgContainer [2025-03-04 15:21:30,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:21:30,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:21:30,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:21:30,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:21:30,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:21:29" (1/3) ... [2025-03-04 15:21:30,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16394e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:21:30, skipping insertion in model container [2025-03-04 15:21:30,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:30" (2/3) ... [2025-03-04 15:21:30,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16394e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:21:30, skipping insertion in model container [2025-03-04 15:21:30,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:21:30" (3/3) ... [2025-03-04 15:21:30,937 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2025-03-04 15:21:30,947 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:21:30,948 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_08-cond_racefree.i that has 2 procedures, 54 locations, 1 initial locations, 5 loop locations, and 8 error locations. [2025-03-04 15:21:30,949 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:21:30,990 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:21:31,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 66 transitions, 139 flow [2025-03-04 15:21:31,049 INFO L124 PetriNetUnfolderBase]: 17/88 cut-off events. [2025-03-04 15:21:31,052 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:21:31,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 88 events. 17/88 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 271 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 57. Up to 6 conditions per place. [2025-03-04 15:21:31,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 66 transitions, 139 flow [2025-03-04 15:21:31,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 65 transitions, 137 flow [2025-03-04 15:21:31,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:31,075 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;@35e1cdc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:31,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 15:21:31,081 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:31,081 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-03-04 15:21:31,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:31,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:31,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:31,082 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-04 15:21:31,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash 419073452, now seen corresponding path program 1 times [2025-03-04 15:21:31,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:31,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523498197] [2025-03-04 15:21:31,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:31,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:31,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:31,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:31,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:31,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:31,412 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:21:31,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:31,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523498197] [2025-03-04 15:21:31,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523498197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:31,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:31,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758979652] [2025-03-04 15:21:31,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:31,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:31,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:31,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:31,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 66 [2025-03-04 15:21:31,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 65 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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:21:31,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:31,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 66 [2025-03-04 15:21:31,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:31,683 INFO L124 PetriNetUnfolderBase]: 165/483 cut-off events. [2025-03-04 15:21:31,684 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:21:31,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 483 events. 165/483 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2477 event pairs, 62 based on Foata normal form. 64/481 useless extension candidates. Maximal degree in co-relation 779. Up to 279 conditions per place. [2025-03-04 15:21:31,687 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 47 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2025-03-04 15:21:31,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 263 flow [2025-03-04 15:21:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2025-03-04 15:21:31,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7007575757575758 [2025-03-04 15:21:31,697 INFO L175 Difference]: Start difference. First operand has 57 places, 65 transitions, 137 flow. Second operand 4 states and 185 transitions. [2025-03-04 15:21:31,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 263 flow [2025-03-04 15:21:31,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 263 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:31,702 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 127 flow [2025-03-04 15:21:31,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2025-03-04 15:21:31,706 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-03-04 15:21:31,706 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 127 flow [2025-03-04 15:21:31,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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:21:31,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:31,706 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:31,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:21:31,707 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-04 15:21:31,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:31,707 INFO L85 PathProgramCache]: Analyzing trace with hash -852372324, now seen corresponding path program 1 times [2025-03-04 15:21:31,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:31,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194326744] [2025-03-04 15:21:31,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:31,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:31,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:21:31,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:21:31,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:31,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:31,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:21:31,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:21:31,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:21:31,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:31,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:31,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:21:31,803 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:21:31,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 15:21:31,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-04 15:21:31,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-04 15:21:31,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-04 15:21:31,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-04 15:21:31,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-04 15:21:31,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-04 15:21:31,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-04 15:21:31,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-04 15:21:31,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-04 15:21:31,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-04 15:21:31,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-04 15:21:31,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-04 15:21:31,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:21:31,807 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 15:21:31,808 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:21:31,808 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:21:31,831 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:21:31,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 98 transitions, 212 flow [2025-03-04 15:21:31,857 INFO L124 PetriNetUnfolderBase]: 30/161 cut-off events. [2025-03-04 15:21:31,857 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:21:31,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 161 events. 30/161 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 592 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 96. Up to 9 conditions per place. [2025-03-04 15:21:31,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 98 transitions, 212 flow [2025-03-04 15:21:31,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 98 transitions, 212 flow [2025-03-04 15:21:31,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:31,864 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;@35e1cdc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:31,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 15:21:31,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:31,867 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-03-04 15:21:31,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:31,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:31,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:31,869 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-04 15:21:31,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:31,869 INFO L85 PathProgramCache]: Analyzing trace with hash 512624172, now seen corresponding path program 1 times [2025-03-04 15:21:31,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:31,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056723043] [2025-03-04 15:21:31,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:31,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:31,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:31,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:31,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:31,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:31,968 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:21:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:31,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056723043] [2025-03-04 15:21:31,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056723043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:31,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:31,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:31,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715165728] [2025-03-04 15:21:31,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:31,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:31,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:31,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:31,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:31,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 98 [2025-03-04 15:21:31,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 98 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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:21:31,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:31,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 98 [2025-03-04 15:21:31,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:32,868 INFO L124 PetriNetUnfolderBase]: 4725/9646 cut-off events. [2025-03-04 15:21:32,869 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-04 15:21:32,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16845 conditions, 9646 events. 4725/9646 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 79946 event pairs, 2350 based on Foata normal form. 1337/9828 useless extension candidates. Maximal degree in co-relation 2398. Up to 7095 conditions per place. [2025-03-04 15:21:32,916 INFO L140 encePairwiseOnDemand]: 78/98 looper letters, 65 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-03-04 15:21:32,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 109 transitions, 370 flow [2025-03-04 15:21:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2025-03-04 15:21:32,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6658163265306123 [2025-03-04 15:21:32,919 INFO L175 Difference]: Start difference. First operand has 84 places, 98 transitions, 212 flow. Second operand 4 states and 261 transitions. [2025-03-04 15:21:32,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 109 transitions, 370 flow [2025-03-04 15:21:32,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 109 transitions, 370 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:32,925 INFO L231 Difference]: Finished difference. Result has 89 places, 86 transitions, 208 flow [2025-03-04 15:21:32,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=89, PETRI_TRANSITIONS=86} [2025-03-04 15:21:32,926 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 5 predicate places. [2025-03-04 15:21:32,926 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 208 flow [2025-03-04 15:21:32,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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:21:32,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:32,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:32,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:21:32,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:32,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:32,927 INFO L85 PathProgramCache]: Analyzing trace with hash -773510930, now seen corresponding path program 1 times [2025-03-04 15:21:32,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:32,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345362099] [2025-03-04 15:21:32,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:32,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:32,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:21:32,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:21:32,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:32,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:33,045 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:21:33,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:33,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345362099] [2025-03-04 15:21:33,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345362099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:33,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:33,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:33,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316012619] [2025-03-04 15:21:33,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:33,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:33,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:33,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:33,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-03-04 15:21:33,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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:21:33,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:33,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-03-04 15:21:33,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:34,000 INFO L124 PetriNetUnfolderBase]: 6297/12854 cut-off events. [2025-03-04 15:21:34,000 INFO L125 PetriNetUnfolderBase]: For 456/791 co-relation queries the response was YES. [2025-03-04 15:21:34,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22942 conditions, 12854 events. 6297/12854 cut-off events. For 456/791 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 111105 event pairs, 1495 based on Foata normal form. 232/11745 useless extension candidates. Maximal degree in co-relation 22842. Up to 6450 conditions per place. [2025-03-04 15:21:34,070 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 122 selfloop transitions, 12 changer transitions 0/177 dead transitions. [2025-03-04 15:21:34,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 177 transitions, 698 flow [2025-03-04 15:21:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:21:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:21:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2025-03-04 15:21:34,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7040816326530612 [2025-03-04 15:21:34,075 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 208 flow. Second operand 5 states and 345 transitions. [2025-03-04 15:21:34,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 177 transitions, 698 flow [2025-03-04 15:21:34,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 177 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:21:34,078 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 300 flow [2025-03-04 15:21:34,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=96, PETRI_TRANSITIONS=97} [2025-03-04 15:21:34,079 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 12 predicate places. [2025-03-04 15:21:34,079 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 300 flow [2025-03-04 15:21:34,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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:21:34,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:34,080 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:34,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:21:34,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:34,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1810277478, now seen corresponding path program 1 times [2025-03-04 15:21:34,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:34,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886465658] [2025-03-04 15:21:34,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:34,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:21:34,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:21:34,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:34,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:34,180 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:21:34,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:34,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886465658] [2025-03-04 15:21:34,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886465658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:34,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:34,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:21:34,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375066888] [2025-03-04 15:21:34,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:34,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:21:34,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:34,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:21:34,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:21:34,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 98 [2025-03-04 15:21:34,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 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:21:34,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:34,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 98 [2025-03-04 15:21:34,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:35,215 INFO L124 PetriNetUnfolderBase]: 5605/12067 cut-off events. [2025-03-04 15:21:35,216 INFO L125 PetriNetUnfolderBase]: For 3569/3569 co-relation queries the response was YES. [2025-03-04 15:21:35,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24061 conditions, 12067 events. 5605/12067 cut-off events. For 3569/3569 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 107275 event pairs, 561 based on Foata normal form. 152/10790 useless extension candidates. Maximal degree in co-relation 20679. Up to 6589 conditions per place. [2025-03-04 15:21:35,271 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 126 selfloop transitions, 6 changer transitions 0/173 dead transitions. [2025-03-04 15:21:35,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 173 transitions, 798 flow [2025-03-04 15:21:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:21:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:21:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 358 transitions. [2025-03-04 15:21:35,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608843537414966 [2025-03-04 15:21:35,277 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 300 flow. Second operand 6 states and 358 transitions. [2025-03-04 15:21:35,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 173 transitions, 798 flow [2025-03-04 15:21:35,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 173 transitions, 798 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:35,288 INFO L231 Difference]: Finished difference. Result has 100 places, 96 transitions, 308 flow [2025-03-04 15:21:35,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=100, PETRI_TRANSITIONS=96} [2025-03-04 15:21:35,290 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 16 predicate places. [2025-03-04 15:21:35,290 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 96 transitions, 308 flow [2025-03-04 15:21:35,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 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:21:35,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:35,291 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:21:35,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:21:35,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:35,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:35,291 INFO L85 PathProgramCache]: Analyzing trace with hash 284027416, now seen corresponding path program 1 times [2025-03-04 15:21:35,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:35,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541330115] [2025-03-04 15:21:35,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:35,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:35,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:21:35,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:21:35,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:35,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:35,359 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:21:35,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:35,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541330115] [2025-03-04 15:21:35,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541330115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:35,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:35,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:21:35,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970014006] [2025-03-04 15:21:35,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:35,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:35,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:35,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:35,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:35,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 98 [2025-03-04 15:21:35,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 96 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:35,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:35,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 98 [2025-03-04 15:21:35,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:36,032 INFO L124 PetriNetUnfolderBase]: 5336/11392 cut-off events. [2025-03-04 15:21:36,033 INFO L125 PetriNetUnfolderBase]: For 4009/4009 co-relation queries the response was YES. [2025-03-04 15:21:36,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23199 conditions, 11392 events. 5336/11392 cut-off events. For 4009/4009 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 99003 event pairs, 504 based on Foata normal form. 152/10298 useless extension candidates. Maximal degree in co-relation 19864. Up to 7059 conditions per place. [2025-03-04 15:21:36,086 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 103 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2025-03-04 15:21:36,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 150 transitions, 696 flow [2025-03-04 15:21:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-03-04 15:21:36,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6403061224489796 [2025-03-04 15:21:36,088 INFO L175 Difference]: Start difference. First operand has 100 places, 96 transitions, 308 flow. Second operand 4 states and 251 transitions. [2025-03-04 15:21:36,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 150 transitions, 696 flow [2025-03-04 15:21:36,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 150 transitions, 680 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:21:36,095 INFO L231 Difference]: Finished difference. Result has 98 places, 96 transitions, 308 flow [2025-03-04 15:21:36,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=98, PETRI_TRANSITIONS=96} [2025-03-04 15:21:36,096 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 14 predicate places. [2025-03-04 15:21:36,096 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 96 transitions, 308 flow [2025-03-04 15:21:36,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:36,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:36,096 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 15:21:36,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:21:36,097 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-04 15:21:36,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1927542814, now seen corresponding path program 1 times [2025-03-04 15:21:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433580529] [2025-03-04 15:21:36,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:36,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:21:36,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:21:36,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:36,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:36,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:21:36,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:21:36,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:21:36,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:36,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:36,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:21:36,149 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:21:36,149 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-04 15:21:36,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-04 15:21:36,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-04 15:21:36,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-04 15:21:36,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-04 15:21:36,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-04 15:21:36,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-04 15:21:36,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-04 15:21:36,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-04 15:21:36,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-04 15:21:36,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-04 15:21:36,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-04 15:21:36,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-04 15:21:36,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-04 15:21:36,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-04 15:21:36,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-04 15:21:36,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-04 15:21:36,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:21:36,151 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 15:21:36,151 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:21:36,151 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:21:36,177 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:21:36,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 130 transitions, 287 flow [2025-03-04 15:21:36,192 INFO L124 PetriNetUnfolderBase]: 46/253 cut-off events. [2025-03-04 15:21:36,192 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:21:36,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 253 events. 46/253 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1026 event pairs, 1 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2025-03-04 15:21:36,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 130 transitions, 287 flow [2025-03-04 15:21:36,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 130 transitions, 287 flow [2025-03-04 15:21:36,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:36,197 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;@35e1cdc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:36,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 15:21:36,199 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:36,200 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-03-04 15:21:36,200 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:36,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:36,200 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:36,200 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:21:36,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:36,203 INFO L85 PathProgramCache]: Analyzing trace with hash 636712652, now seen corresponding path program 1 times [2025-03-04 15:21:36,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:36,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788956700] [2025-03-04 15:21:36,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:36,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:36,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:36,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:36,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:36,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:36,249 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:21:36,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:36,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788956700] [2025-03-04 15:21:36,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788956700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:36,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:36,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:36,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308400333] [2025-03-04 15:21:36,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:36,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:36,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:36,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:36,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:36,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 130 [2025-03-04 15:21:36,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 130 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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:21:36,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:36,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 130 [2025-03-04 15:21:36,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:44,197 INFO L124 PetriNetUnfolderBase]: 87851/154426 cut-off events. [2025-03-04 15:21:44,198 INFO L125 PetriNetUnfolderBase]: For 1911/1911 co-relation queries the response was YES. [2025-03-04 15:21:44,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274549 conditions, 154426 events. 87851/154426 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 3544. Compared 1593286 event pairs, 52468 based on Foata normal form. 23872/163104 useless extension candidates. Maximal degree in co-relation 17989. Up to 118961 conditions per place. [2025-03-04 15:21:45,113 INFO L140 encePairwiseOnDemand]: 104/130 looper letters, 78 selfloop transitions, 3 changer transitions 0/135 dead transitions. [2025-03-04 15:21:45,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 135 transitions, 459 flow [2025-03-04 15:21:45,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2025-03-04 15:21:45,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6384615384615384 [2025-03-04 15:21:45,115 INFO L175 Difference]: Start difference. First operand has 111 places, 130 transitions, 287 flow. Second operand 4 states and 332 transitions. [2025-03-04 15:21:45,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 135 transitions, 459 flow [2025-03-04 15:21:45,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 135 transitions, 459 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:45,118 INFO L231 Difference]: Finished difference. Result has 116 places, 112 transitions, 271 flow [2025-03-04 15:21:45,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=116, PETRI_TRANSITIONS=112} [2025-03-04 15:21:45,119 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places. [2025-03-04 15:21:45,119 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 112 transitions, 271 flow [2025-03-04 15:21:45,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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:21:45,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:45,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:45,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:21:45,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:21:45,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1005244558, now seen corresponding path program 1 times [2025-03-04 15:21:45,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:45,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845206485] [2025-03-04 15:21:45,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:45,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:45,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:21:45,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:21:45,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:45,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:45,184 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:21:45,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:45,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845206485] [2025-03-04 15:21:45,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845206485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:45,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:45,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:45,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343942888] [2025-03-04 15:21:45,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:45,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:45,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:45,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:45,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:45,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 130 [2025-03-04 15:21:45,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 112 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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:21:45,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:45,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 130 [2025-03-04 15:21:45,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:57,082 INFO L124 PetriNetUnfolderBase]: 125005/214397 cut-off events. [2025-03-04 15:21:57,082 INFO L125 PetriNetUnfolderBase]: For 7242/11757 co-relation queries the response was YES. [2025-03-04 15:21:57,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390781 conditions, 214397 events. 125005/214397 cut-off events. For 7242/11757 co-relation queries the response was YES. Maximal size of possible extension queue 4978. Compared 2224827 event pairs, 39782 based on Foata normal form. 3015/197428 useless extension candidates. Maximal degree in co-relation 390680. Up to 116991 conditions per place. [2025-03-04 15:21:58,284 INFO L140 encePairwiseOnDemand]: 119/130 looper letters, 174 selfloop transitions, 16 changer transitions 0/246 dead transitions. [2025-03-04 15:21:58,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 246 transitions, 989 flow [2025-03-04 15:21:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:21:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:21:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2025-03-04 15:21:58,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7169230769230769 [2025-03-04 15:21:58,286 INFO L175 Difference]: Start difference. First operand has 116 places, 112 transitions, 271 flow. Second operand 5 states and 466 transitions. [2025-03-04 15:21:58,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 246 transitions, 989 flow [2025-03-04 15:21:58,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 246 transitions, 985 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:21:58,295 INFO L231 Difference]: Finished difference. Result has 123 places, 127 transitions, 397 flow [2025-03-04 15:21:58,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=397, PETRI_PLACES=123, PETRI_TRANSITIONS=127} [2025-03-04 15:21:58,296 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 12 predicate places. [2025-03-04 15:21:58,296 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 127 transitions, 397 flow [2025-03-04 15:21:58,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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:21:58,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:58,296 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:58,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:21:58,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:21:58,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:58,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1926498406, now seen corresponding path program 1 times [2025-03-04 15:21:58,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:58,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858507983] [2025-03-04 15:21:58,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:58,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:58,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:21:58,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:21:58,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:58,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:58,503 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:21:58,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:58,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858507983] [2025-03-04 15:21:58,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858507983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:58,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:58,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:21:58,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312790823] [2025-03-04 15:21:58,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:58,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:21:58,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:58,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:21:58,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:21:58,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 130 [2025-03-04 15:21:58,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 127 transitions, 397 flow. Second operand has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 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:21:58,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:58,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 130 [2025-03-04 15:21:58,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand