./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/04-mutex_12-ptr_nr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/goblint-regression/04-mutex_12-ptr_nr.c -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 1dd2689238e974a5a6beab17b666b89a0b0645e31d6367436eb5595936b1dda8 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:00:43,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:00:43,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:00:43,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:00:43,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:00:43,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:00:43,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:00:43,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:00:43,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:00:43,116 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:00:43,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:00:43,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:00:43,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:00:43,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:00:43,119 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:00:43,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:00:43,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:00:43,119 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:00:43,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:00:43,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:00:43,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:00:43,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:00:43,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:00:43,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:00:43,120 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:00:43,120 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:00:43,120 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:00:43,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:00:43,120 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:00:43,120 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:00:43,120 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:00:43,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:43,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:43,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:43,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:43,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:00:43,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:43,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:43,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:43,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:43,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:00:43,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:00:43,121 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:00:43,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:00:43,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:00:43,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:00:43,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:00:43,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:00:43,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:00:43,122 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 -> 1dd2689238e974a5a6beab17b666b89a0b0645e31d6367436eb5595936b1dda8 [2025-04-29 11:00:43,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:00:43,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:00:43,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:00:43,354 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:00:43,354 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:00:43,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_12-ptr_nr.c [2025-04-29 11:00:44,621 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/613e263c6/619f325fc7d34b40a8a8e90b026c98e4/FLAG60e61c10d [2025-04-29 11:00:44,831 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:00:44,835 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_12-ptr_nr.c [2025-04-29 11:00:44,836 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:44,836 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:44,855 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/613e263c6/619f325fc7d34b40a8a8e90b026c98e4/FLAG60e61c10d [2025-04-29 11:00:45,622 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/613e263c6/619f325fc7d34b40a8a8e90b026c98e4 [2025-04-29 11:00:45,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:00:45,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:00:45,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:45,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:00:45,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:00:45,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd34b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45, skipping insertion in model container [2025-04-29 11:00:45,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:00:45,796 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:45,811 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:00:45,827 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:45,838 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:00:45,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45 WrapperNode [2025-04-29 11:00:45,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:45,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:45,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:00:45,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:00:45,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,873 INFO L138 Inliner]: procedures = 11, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2025-04-29 11:00:45,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:45,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:00:45,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:00:45,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:00:45,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,888 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [5, 1]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 2 writes are split as follows [2, 0]. [2025-04-29 11:00:45,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:00:45,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:00:45,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:00:45,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:00:45,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (1/1) ... [2025-04-29 11:00:45,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:45,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:45,930 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-04-29 11:00:45,932 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-04-29 11:00:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:00:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:00:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:00:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:00:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:00:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:00:45,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:00:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:00:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:00:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:00:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:00:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:00:45,949 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:00:45,949 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:00:46,012 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:00:46,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:00:46,109 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:00:46,110 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:00:46,159 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:00:46,159 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:00:46,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:46 BoogieIcfgContainer [2025-04-29 11:00:46,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:00:46,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:00:46,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:00:46,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:00:46,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:00:45" (1/3) ... [2025-04-29 11:00:46,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566b4b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:46, skipping insertion in model container [2025-04-29 11:00:46,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:45" (2/3) ... [2025-04-29 11:00:46,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566b4b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:46, skipping insertion in model container [2025-04-29 11:00:46,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:46" (3/3) ... [2025-04-29 11:00:46,168 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_12-ptr_nr.c [2025-04-29 11:00:46,178 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:00:46,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_12-ptr_nr.c that has 2 procedures, 24 locations, 22 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-29 11:00:46,179 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:00:46,208 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:00:46,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 23 transitions, 53 flow [2025-04-29 11:00:46,252 INFO L116 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-04-29 11:00:46,255 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:00:46,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-29 11:00:46,256 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 23 transitions, 53 flow [2025-04-29 11:00:46,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 43 flow [2025-04-29 11:00:46,266 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:00:46,277 INFO L340 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;@54b7b759, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:00:46,278 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:00:46,282 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:00:46,284 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-29 11:00:46,284 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:00:46,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:46,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:00:46,285 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:46,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash -138321389, now seen corresponding path program 1 times [2025-04-29 11:00:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:46,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129386581] [2025-04-29 11:00:46,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:46,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:00:46,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:00:46,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:46,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:46,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:46,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129386581] [2025-04-29 11:00:46,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129386581] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:46,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:46,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:46,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017472489] [2025-04-29 11:00:46,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:46,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:00:46,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:46,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:00:46,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:00:46,522 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-04-29 11:00:46,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 43 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-04-29 11:00:46,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:46,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-04-29 11:00:46,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:46,691 INFO L116 PetriNetUnfolderBase]: 33/98 cut-off events. [2025-04-29 11:00:46,692 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:00:46,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 98 events. 33/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 313 event pairs, 7 based on Foata normal form. 6/101 useless extension candidates. Maximal degree in co-relation 176. Up to 55 conditions per place. [2025-04-29 11:00:46,694 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 22 selfloop transitions, 6 changer transitions 5/38 dead transitions. [2025-04-29 11:00:46,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 38 transitions, 145 flow [2025-04-29 11:00:46,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:00:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2025-04-29 11:00:46,703 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2025-04-29 11:00:46,705 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 43 flow. Second operand 6 states and 73 transitions. [2025-04-29 11:00:46,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 38 transitions, 145 flow [2025-04-29 11:00:46,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:00:46,709 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 80 flow [2025-04-29 11:00:46,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2025-04-29 11:00:46,712 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2025-04-29 11:00:46,712 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 80 flow [2025-04-29 11:00:46,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-04-29 11:00:46,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:46,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:00:46,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:00:46,713 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:46,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash -138574263, now seen corresponding path program 1 times [2025-04-29 11:00:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:46,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294037934] [2025-04-29 11:00:46,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:46,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:00:46,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:00:46,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:46,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:46,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:46,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294037934] [2025-04-29 11:00:46,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294037934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:46,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:46,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:46,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979247304] [2025-04-29 11:00:46,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:46,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:46,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:46,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:46,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:46,782 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-04-29 11:00:46,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-04-29 11:00:46,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:46,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-04-29 11:00:46,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:46,846 INFO L116 PetriNetUnfolderBase]: 26/91 cut-off events. [2025-04-29 11:00:46,846 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-29 11:00:46,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 91 events. 26/91 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 300 event pairs, 13 based on Foata normal form. 14/105 useless extension candidates. Maximal degree in co-relation 201. Up to 44 conditions per place. [2025-04-29 11:00:46,849 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 19 selfloop transitions, 5 changer transitions 4/33 dead transitions. [2025-04-29 11:00:46,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 167 flow [2025-04-29 11:00:46,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:00:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:00:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-04-29 11:00:46,850 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5304347826086957 [2025-04-29 11:00:46,850 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 80 flow. Second operand 5 states and 61 transitions. [2025-04-29 11:00:46,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 167 flow [2025-04-29 11:00:46,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 158 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:00:46,854 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 100 flow [2025-04-29 11:00:46,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2025-04-29 11:00:46,855 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2025-04-29 11:00:46,855 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 100 flow [2025-04-29 11:00:46,855 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-04-29 11:00:46,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:46,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:46,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:00:46,855 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:46,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash 572258908, now seen corresponding path program 1 times [2025-04-29 11:00:46,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:46,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301495352] [2025-04-29 11:00:46,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:46,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:00:46,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:00:46,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:46,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:46,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:46,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301495352] [2025-04-29 11:00:46,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301495352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:46,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:46,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:46,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959417641] [2025-04-29 11:00:46,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:46,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:46,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:46,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:46,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:46,940 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 23 [2025-04-29 11:00:46,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04-29 11:00:46,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:46,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 23 [2025-04-29 11:00:46,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:46,974 INFO L116 PetriNetUnfolderBase]: 12/56 cut-off events. [2025-04-29 11:00:46,975 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-29 11:00:46,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 56 events. 12/56 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 3 based on Foata normal form. 6/62 useless extension candidates. Maximal degree in co-relation 136. Up to 26 conditions per place. [2025-04-29 11:00:46,975 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 17 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2025-04-29 11:00:46,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 156 flow [2025-04-29 11:00:46,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:00:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-29 11:00:46,976 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2025-04-29 11:00:46,976 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 100 flow. Second operand 3 states and 42 transitions. [2025-04-29 11:00:46,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 156 flow [2025-04-29 11:00:46,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 148 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:00:46,977 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 100 flow [2025-04-29 11:00:46,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2025-04-29 11:00:46,979 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2025-04-29 11:00:46,979 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 100 flow [2025-04-29 11:00:46,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04-29 11:00:46,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:46,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:46,980 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:00:46,980 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:46,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:46,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1934437749, now seen corresponding path program 1 times [2025-04-29 11:00:46,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:46,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766177201] [2025-04-29 11:00:46,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:46,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:47,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:00:47,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:00:47,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:47,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:47,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:47,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766177201] [2025-04-29 11:00:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766177201] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:47,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:47,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:47,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265962328] [2025-04-29 11:00:47,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:47,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:47,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:47,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:47,183 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:47,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 100 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:47,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:47,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:47,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:47,276 INFO L116 PetriNetUnfolderBase]: 13/54 cut-off events. [2025-04-29 11:00:47,276 INFO L117 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2025-04-29 11:00:47,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 54 events. 13/54 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 119 event pairs, 1 based on Foata normal form. 4/58 useless extension candidates. Maximal degree in co-relation 140. Up to 12 conditions per place. [2025-04-29 11:00:47,276 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 21 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2025-04-29 11:00:47,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 178 flow [2025-04-29 11:00:47,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:00:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:00:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2025-04-29 11:00:47,278 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35403726708074534 [2025-04-29 11:00:47,278 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 100 flow. Second operand 7 states and 57 transitions. [2025-04-29 11:00:47,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 178 flow [2025-04-29 11:00:47,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:00:47,279 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 106 flow [2025-04-29 11:00:47,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=106, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2025-04-29 11:00:47,280 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 15 predicate places. [2025-04-29 11:00:47,280 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 106 flow [2025-04-29 11:00:47,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:47,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:47,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:47,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:00:47,280 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:47,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:47,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1458606834, now seen corresponding path program 1 times [2025-04-29 11:00:47,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:47,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103063902] [2025-04-29 11:00:47,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:47,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:47,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:00:47,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:00:47,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:47,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:47,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:47,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103063902] [2025-04-29 11:00:47,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103063902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:47,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:47,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:47,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058431621] [2025-04-29 11:00:47,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:47,380 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:47,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:47,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:47,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:47,396 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:47,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 106 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:47,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:47,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:47,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:47,505 INFO L116 PetriNetUnfolderBase]: 12/62 cut-off events. [2025-04-29 11:00:47,506 INFO L117 PetriNetUnfolderBase]: For 69/71 co-relation queries the response was YES. [2025-04-29 11:00:47,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 62 events. 12/62 cut-off events. For 69/71 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 170 event pairs, 7 based on Foata normal form. 3/65 useless extension candidates. Maximal degree in co-relation 164. Up to 28 conditions per place. [2025-04-29 11:00:47,506 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 20 selfloop transitions, 9 changer transitions 0/32 dead transitions. [2025-04-29 11:00:47,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 202 flow [2025-04-29 11:00:47,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:00:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:00:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2025-04-29 11:00:47,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33152173913043476 [2025-04-29 11:00:47,509 INFO L175 Difference]: Start difference. First operand has 39 places, 23 transitions, 106 flow. Second operand 8 states and 61 transitions. [2025-04-29 11:00:47,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 202 flow [2025-04-29 11:00:47,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 182 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-04-29 11:00:47,511 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 148 flow [2025-04-29 11:00:47,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2025-04-29 11:00:47,511 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 21 predicate places. [2025-04-29 11:00:47,511 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 148 flow [2025-04-29 11:00:47,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:47,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:47,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:47,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:00:47,512 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:47,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2090532630, now seen corresponding path program 2 times [2025-04-29 11:00:47,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:47,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000527779] [2025-04-29 11:00:47,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:47,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:47,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:00:47,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:00:47,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:47,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:47,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:47,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000527779] [2025-04-29 11:00:47,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000527779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:47,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:47,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488196739] [2025-04-29 11:00:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:47,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:47,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:47,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:47,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:47,630 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:47,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:47,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:47,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:47,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:47,719 INFO L116 PetriNetUnfolderBase]: 11/68 cut-off events. [2025-04-29 11:00:47,721 INFO L117 PetriNetUnfolderBase]: For 114/118 co-relation queries the response was YES. [2025-04-29 11:00:47,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 68 events. 11/68 cut-off events. For 114/118 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 220 event pairs, 4 based on Foata normal form. 5/73 useless extension candidates. Maximal degree in co-relation 186. Up to 31 conditions per place. [2025-04-29 11:00:47,723 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 23 selfloop transitions, 11 changer transitions 0/37 dead transitions. [2025-04-29 11:00:47,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 37 transitions, 256 flow [2025-04-29 11:00:47,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:00:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:00:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2025-04-29 11:00:47,724 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2025-04-29 11:00:47,725 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 148 flow. Second operand 8 states and 64 transitions. [2025-04-29 11:00:47,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 37 transitions, 256 flow [2025-04-29 11:00:47,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 37 transitions, 245 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-29 11:00:47,728 INFO L231 Difference]: Finished difference. Result has 54 places, 30 transitions, 202 flow [2025-04-29 11:00:47,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=54, PETRI_TRANSITIONS=30} [2025-04-29 11:00:47,729 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 30 predicate places. [2025-04-29 11:00:47,729 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 30 transitions, 202 flow [2025-04-29 11:00:47,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:47,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:47,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:47,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:00:47,729 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:47,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:47,731 INFO L85 PathProgramCache]: Analyzing trace with hash -45025058, now seen corresponding path program 3 times [2025-04-29 11:00:47,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:47,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411405678] [2025-04-29 11:00:47,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:00:47,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:47,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:00:47,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:00:47,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:00:47,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:47,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:47,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411405678] [2025-04-29 11:00:47,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411405678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:47,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:47,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:47,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859518693] [2025-04-29 11:00:47,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:47,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:47,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:47,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:47,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:47,826 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:47,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 30 transitions, 202 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:47,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:47,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:47,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:47,915 INFO L116 PetriNetUnfolderBase]: 11/66 cut-off events. [2025-04-29 11:00:47,916 INFO L117 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-04-29 11:00:47,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 66 events. 11/66 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 203 event pairs, 7 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 201. Up to 19 conditions per place. [2025-04-29 11:00:47,917 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 20 selfloop transitions, 11 changer transitions 0/34 dead transitions. [2025-04-29 11:00:47,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 34 transitions, 270 flow [2025-04-29 11:00:47,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:00:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:00:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2025-04-29 11:00:47,918 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32065217391304346 [2025-04-29 11:00:47,918 INFO L175 Difference]: Start difference. First operand has 54 places, 30 transitions, 202 flow. Second operand 8 states and 59 transitions. [2025-04-29 11:00:47,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 34 transitions, 270 flow [2025-04-29 11:00:47,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 34 transitions, 252 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:00:47,919 INFO L231 Difference]: Finished difference. Result has 56 places, 29 transitions, 198 flow [2025-04-29 11:00:47,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=198, PETRI_PLACES=56, PETRI_TRANSITIONS=29} [2025-04-29 11:00:47,920 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 32 predicate places. [2025-04-29 11:00:47,920 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 29 transitions, 198 flow [2025-04-29 11:00:47,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:47,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:47,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:47,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:00:47,920 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:47,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:47,923 INFO L85 PathProgramCache]: Analyzing trace with hash 300603186, now seen corresponding path program 1 times [2025-04-29 11:00:47,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:47,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137534657] [2025-04-29 11:00:47,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:47,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:00:47,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:00:47,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:47,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:48,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:48,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137534657] [2025-04-29 11:00:48,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137534657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:48,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:48,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:48,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203812136] [2025-04-29 11:00:48,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:48,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:48,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:48,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:48,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:48,024 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:48,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 29 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:48,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:48,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:48,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:48,111 INFO L116 PetriNetUnfolderBase]: 11/65 cut-off events. [2025-04-29 11:00:48,112 INFO L117 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-04-29 11:00:48,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 65 events. 11/65 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 200 event pairs, 4 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 200. Up to 32 conditions per place. [2025-04-29 11:00:48,113 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 20 selfloop transitions, 7 changer transitions 6/36 dead transitions. [2025-04-29 11:00:48,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 36 transitions, 276 flow [2025-04-29 11:00:48,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:00:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:00:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2025-04-29 11:00:48,114 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3423913043478261 [2025-04-29 11:00:48,115 INFO L175 Difference]: Start difference. First operand has 56 places, 29 transitions, 198 flow. Second operand 8 states and 63 transitions. [2025-04-29 11:00:48,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 36 transitions, 276 flow [2025-04-29 11:00:48,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 36 transitions, 238 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-04-29 11:00:48,118 INFO L231 Difference]: Finished difference. Result has 55 places, 25 transitions, 141 flow [2025-04-29 11:00:48,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=25} [2025-04-29 11:00:48,119 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 31 predicate places. [2025-04-29 11:00:48,120 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 25 transitions, 141 flow [2025-04-29 11:00:48,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:48,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:48,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:48,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:00:48,121 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:48,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:48,121 INFO L85 PathProgramCache]: Analyzing trace with hash -243370846, now seen corresponding path program 1 times [2025-04-29 11:00:48,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:48,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251802362] [2025-04-29 11:00:48,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:48,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:48,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:00:48,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:00:48,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:48,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:48,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:48,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251802362] [2025-04-29 11:00:48,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251802362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:48,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:48,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263779706] [2025-04-29 11:00:48,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:48,211 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:48,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:48,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:48,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:48,222 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:48,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 25 transitions, 141 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:48,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:48,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:48,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:48,295 INFO L116 PetriNetUnfolderBase]: 10/54 cut-off events. [2025-04-29 11:00:48,296 INFO L117 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-04-29 11:00:48,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 54 events. 10/54 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 139 event pairs, 2 based on Foata normal form. 2/56 useless extension candidates. Maximal degree in co-relation 157. Up to 14 conditions per place. [2025-04-29 11:00:48,296 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 10 selfloop transitions, 5 changer transitions 13/31 dead transitions. [2025-04-29 11:00:48,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 31 transitions, 210 flow [2025-04-29 11:00:48,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:00:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:00:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2025-04-29 11:00:48,297 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30434782608695654 [2025-04-29 11:00:48,297 INFO L175 Difference]: Start difference. First operand has 55 places, 25 transitions, 141 flow. Second operand 9 states and 63 transitions. [2025-04-29 11:00:48,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 31 transitions, 210 flow [2025-04-29 11:00:48,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 31 transitions, 183 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-29 11:00:48,299 INFO L231 Difference]: Finished difference. Result has 49 places, 18 transitions, 92 flow [2025-04-29 11:00:48,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=18} [2025-04-29 11:00:48,299 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 25 predicate places. [2025-04-29 11:00:48,299 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 18 transitions, 92 flow [2025-04-29 11:00:48,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:48,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:48,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:48,300 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:00:48,300 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:48,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:48,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2027828554, now seen corresponding path program 2 times [2025-04-29 11:00:48,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:48,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560532079] [2025-04-29 11:00:48,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:48,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:00:48,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:00:48,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:48,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:48,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-04-29 11:00:48,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:48,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560532079] [2025-04-29 11:00:48,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560532079] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:48,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:48,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:48,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870589015] [2025-04-29 11:00:48,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:48,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:48,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:48,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:48,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:48,447 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:48,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 18 transitions, 92 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:48,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:48,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:48,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:48,505 INFO L116 PetriNetUnfolderBase]: 1/23 cut-off events. [2025-04-29 11:00:48,505 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-29 11:00:48,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 23 events. 1/23 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 1 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 62. Up to 9 conditions per place. [2025-04-29 11:00:48,505 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 8 selfloop transitions, 3 changer transitions 5/19 dead transitions. [2025-04-29 11:00:48,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 19 transitions, 123 flow [2025-04-29 11:00:48,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:00:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:00:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2025-04-29 11:00:48,506 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2795031055900621 [2025-04-29 11:00:48,507 INFO L175 Difference]: Start difference. First operand has 49 places, 18 transitions, 92 flow. Second operand 7 states and 45 transitions. [2025-04-29 11:00:48,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 19 transitions, 123 flow [2025-04-29 11:00:48,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 19 transitions, 96 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-04-29 11:00:48,507 INFO L231 Difference]: Finished difference. Result has 34 places, 14 transitions, 51 flow [2025-04-29 11:00:48,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=51, PETRI_PLACES=34, PETRI_TRANSITIONS=14} [2025-04-29 11:00:48,508 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2025-04-29 11:00:48,508 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 14 transitions, 51 flow [2025-04-29 11:00:48,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:48,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:48,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:48,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:00:48,508 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:48,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1589716056, now seen corresponding path program 3 times [2025-04-29 11:00:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:48,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87667323] [2025-04-29 11:00:48,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:00:48,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:48,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:00:48,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:00:48,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:00:48,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:48,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:48,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87667323] [2025-04-29 11:00:48,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87667323] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:48,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:48,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:48,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669653594] [2025-04-29 11:00:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:48,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:48,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:48,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:48,609 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:48,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 14 transitions, 51 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:48,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:48,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:48,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:48,670 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-29 11:00:48,670 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:00:48,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 15 events. 1/15 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 6 event pairs, 0 based on Foata normal form. 1/16 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2025-04-29 11:00:48,670 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2025-04-29 11:00:48,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 14 transitions, 71 flow [2025-04-29 11:00:48,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:00:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:00:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2025-04-29 11:00:48,670 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2484472049689441 [2025-04-29 11:00:48,670 INFO L175 Difference]: Start difference. First operand has 34 places, 14 transitions, 51 flow. Second operand 7 states and 40 transitions. [2025-04-29 11:00:48,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 14 transitions, 71 flow [2025-04-29 11:00:48,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 14 transitions, 57 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-29 11:00:48,671 INFO L231 Difference]: Finished difference. Result has 24 places, 0 transitions, 0 flow [2025-04-29 11:00:48,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=24, PETRI_TRANSITIONS=0} [2025-04-29 11:00:48,671 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2025-04-29 11:00:48,671 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 0 transitions, 0 flow [2025-04-29 11:00:48,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-29 11:00:48,675 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-04-29 11:00:48,675 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-04-29 11:00:48,675 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-29 11:00:48,675 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2025-04-29 11:00:48,675 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-04-29 11:00:48,675 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-04-29 11:00:48,675 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-04-29 11:00:48,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:00:48,676 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2025-04-29 11:00:48,679 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:00:48,679 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:00:48,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:00:48 BasicIcfg [2025-04-29 11:00:48,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:00:48,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:00:48,686 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:00:48,686 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:00:48,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:46" (3/4) ... [2025-04-29 11:00:48,687 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:00:48,689 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-29 11:00:48,692 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-04-29 11:00:48,692 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-29 11:00:48,692 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 11:00:48,741 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:00:48,741 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:00:48,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:00:48,742 INFO L158 Benchmark]: Toolchain (without parser) took 3116.23ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 86.5MB in the end (delta: 37.1MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2025-04-29 11:00:48,742 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:48,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.64ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 110.6MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:00:48,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.95ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 108.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:00:48,742 INFO L158 Benchmark]: Boogie Preprocessor took 21.89ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 107.6MB in the end (delta: 995.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:48,743 INFO L158 Benchmark]: RCFGBuilder took 263.40ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 91.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:00:48,743 INFO L158 Benchmark]: TraceAbstraction took 2524.15ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 91.9MB in the end (delta: -1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:48,743 INFO L158 Benchmark]: Witness Printer took 55.79ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 86.5MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:48,744 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.64ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 110.6MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.95ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 108.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.89ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 107.6MB in the end (delta: 995.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 263.40ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 91.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2524.15ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 91.9MB in the end (delta: -1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 55.79ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 86.5MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 35 locations, 34 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 309 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 984 IncrementalHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 16 mSDtfsCounter, 984 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=6, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:00:48,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE