./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.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/36-apron_22-traces-write-centered-vs-meet-mutex_true.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 06df70e2c877077d498da3926e9f72c42a471662422ce9d5f7c400ba5859ac91 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:01:20,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:01:20,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:01:20,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:01:20,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:01:20,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:01:20,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:01:20,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:01:20,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:01:20,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:01:20,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:01:20,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:01:20,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:01:20,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:01:20,122 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:01:20,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:01:20,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:01:20,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:01:20,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:01:20,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:01:20,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:01:20,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:01:20,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:01:20,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:01:20,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:01:20,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:01:20,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:01:20,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:01:20,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:01:20,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:01:20,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:01:20,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:01:20,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:01:20,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:01:20,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:01:20,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:01:20,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:01:20,124 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 -> 06df70e2c877077d498da3926e9f72c42a471662422ce9d5f7c400ba5859ac91 [2025-04-29 11:01:20,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:01:20,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:01:20,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:01:20,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:01:20,395 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:01:20,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.c [2025-04-29 11:01:21,721 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df1e4524/1f5cd610ab5742e5808081a8efbf3a87/FLAGe083de8a4 [2025-04-29 11:01:21,907 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:01:21,908 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.c [2025-04-29 11:01:21,909 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:01:21,909 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:01:21,932 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df1e4524/1f5cd610ab5742e5808081a8efbf3a87/FLAGe083de8a4 [2025-04-29 11:01:22,722 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df1e4524/1f5cd610ab5742e5808081a8efbf3a87 [2025-04-29 11:01:22,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:01:22,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:01:22,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:01:22,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:01:22,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:01:22,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b55e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22, skipping insertion in model container [2025-04-29 11:01:22,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:01:22,891 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:01:22,897 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:01:22,923 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:01:22,934 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:01:22,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22 WrapperNode [2025-04-29 11:01:22,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:01:22,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:01:22,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:01:22,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:01:22,939 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:01:22" (1/1) ... [2025-04-29 11:01:22,944 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:01:22" (1/1) ... [2025-04-29 11:01:22,960 INFO L138 Inliner]: procedures = 15, calls = 27, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 123 [2025-04-29 11:01:22,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:01:22,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:01:22,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:01:22,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:01:22,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,974 INFO L175 MemorySlicer]: Split 3 memory accesses to 3 slices as follows [1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 1, 1]. The 0 writes are split as follows [0, 0, 0]. [2025-04-29 11:01:22,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:01:22,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:01:22,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:01:22,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:01:22,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22" (1/1) ... [2025-04-29 11:01:22,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:01:22,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:23,005 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:01:23,010 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:01:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:01:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:01:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:01:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:01:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 11:01:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:01:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:01:23,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:01:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:01:23,023 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:01:23,023 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:01:23,091 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:01:23,092 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:01:23,232 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:01:23,232 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:01:23,339 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:01:23,339 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:01:23,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:01:23 BoogieIcfgContainer [2025-04-29 11:01:23,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:01:23,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:01:23,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:01:23,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:01:23,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:01:22" (1/3) ... [2025-04-29 11:01:23,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c24280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:01:23, skipping insertion in model container [2025-04-29 11:01:23,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:22" (2/3) ... [2025-04-29 11:01:23,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c24280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:01:23, skipping insertion in model container [2025-04-29 11:01:23,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:01:23" (3/3) ... [2025-04-29 11:01:23,346 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true.c [2025-04-29 11:01:23,355 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:01:23,356 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true.c that has 2 procedures, 46 locations, 46 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-29 11:01:23,356 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:01:23,398 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:01:23,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 47 transitions, 98 flow [2025-04-29 11:01:23,449 INFO L116 PetriNetUnfolderBase]: 1/47 cut-off events. [2025-04-29 11:01:23,452 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:23,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 47 events. 1/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-04-29 11:01:23,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 47 transitions, 98 flow [2025-04-29 11:01:23,458 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 45 transitions, 93 flow [2025-04-29 11:01:23,466 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:01:23,475 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;@3a7109c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:01:23,475 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:01:23,480 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:01:23,480 INFO L116 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-04-29 11:01:23,480 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:23,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:23,481 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:23,481 INFO L403 AbstractCegarLoop]: === Iteration 1 === 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:01:23,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:23,487 INFO L85 PathProgramCache]: Analyzing trace with hash 622465439, now seen corresponding path program 1 times [2025-04-29 11:01:23,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:23,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378884592] [2025-04-29 11:01:23,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:23,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:01:23,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:01:23,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:23,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:23,652 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:01:23,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:23,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378884592] [2025-04-29 11:01:23,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378884592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:23,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:23,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:01:23,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709697533] [2025-04-29 11:01:23,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:23,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:01:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:23,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:01:23,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:01:23,695 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-04-29 11:01:23,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:01:23,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:23,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-04-29 11:01:23,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:23,871 INFO L116 PetriNetUnfolderBase]: 193/501 cut-off events. [2025-04-29 11:01:23,871 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:23,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 501 events. 193/501 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2427 event pairs, 165 based on Foata normal form. 12/483 useless extension candidates. Maximal degree in co-relation 893. Up to 373 conditions per place. [2025-04-29 11:01:23,879 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 35 selfloop transitions, 2 changer transitions 4/55 dead transitions. [2025-04-29 11:01:23,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 195 flow [2025-04-29 11:01:23,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:01:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:01:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-04-29 11:01:23,893 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2025-04-29 11:01:23,895 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 93 flow. Second operand 3 states and 87 transitions. [2025-04-29 11:01:23,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 195 flow [2025-04-29 11:01:23,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:01:23,900 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 94 flow [2025-04-29 11:01:23,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-04-29 11:01:23,905 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2025-04-29 11:01:23,907 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 94 flow [2025-04-29 11:01:23,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:01:23,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:23,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:23,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:01:23,908 INFO L403 AbstractCegarLoop]: === Iteration 2 === 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:01:23,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2116559769, now seen corresponding path program 1 times [2025-04-29 11:01:23,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:23,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526144066] [2025-04-29 11:01:23,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:23,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:01:23,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:01:23,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:23,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:23,965 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:01:23,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:23,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526144066] [2025-04-29 11:01:23,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526144066] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:23,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:23,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:01:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414016697] [2025-04-29 11:01:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:23,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:01:23,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:23,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:01:23,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:01:23,972 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-04-29 11:01:23,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:01:23,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:23,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-04-29 11:01:23,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:24,072 INFO L116 PetriNetUnfolderBase]: 181/471 cut-off events. [2025-04-29 11:01:24,073 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:24,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 471 events. 181/471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2176 event pairs, 154 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 851. Up to 350 conditions per place. [2025-04-29 11:01:24,077 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 30 selfloop transitions, 2 changer transitions 11/54 dead transitions. [2025-04-29 11:01:24,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 194 flow [2025-04-29 11:01:24,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:01:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:01:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-04-29 11:01:24,079 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6099290780141844 [2025-04-29 11:01:24,079 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 94 flow. Second operand 3 states and 86 transitions. [2025-04-29 11:01:24,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 194 flow [2025-04-29 11:01:24,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:01:24,080 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 78 flow [2025-04-29 11:01:24,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2025-04-29 11:01:24,081 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2025-04-29 11:01:24,081 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 78 flow [2025-04-29 11:01:24,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:01:24,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:24,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:24,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:01:24,082 INFO L403 AbstractCegarLoop]: === Iteration 3 === 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:01:24,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:24,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1634944190, now seen corresponding path program 1 times [2025-04-29 11:01:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:24,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483175364] [2025-04-29 11:01:24,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:24,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:24,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:01:24,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:01:24,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:24,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:24,191 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:01:24,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:24,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483175364] [2025-04-29 11:01:24,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483175364] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:24,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:24,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:01:24,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824542291] [2025-04-29 11:01:24,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:24,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:01:24,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:24,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:01:24,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:01:24,200 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-04-29 11:01:24,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:01:24,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:24,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-04-29 11:01:24,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:24,342 INFO L116 PetriNetUnfolderBase]: 159/427 cut-off events. [2025-04-29 11:01:24,342 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:24,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 427 events. 159/427 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1924 event pairs, 75 based on Foata normal form. 32/454 useless extension candidates. Maximal degree in co-relation 796. Up to 223 conditions per place. [2025-04-29 11:01:24,345 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 28 selfloop transitions, 2 changer transitions 22/61 dead transitions. [2025-04-29 11:01:24,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 234 flow [2025-04-29 11:01:24,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:01:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:01:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-04-29 11:01:24,346 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5574468085106383 [2025-04-29 11:01:24,346 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 78 flow. Second operand 5 states and 131 transitions. [2025-04-29 11:01:24,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 234 flow [2025-04-29 11:01:24,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:01:24,348 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 90 flow [2025-04-29 11:01:24,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-04-29 11:01:24,348 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-04-29 11:01:24,349 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 90 flow [2025-04-29 11:01:24,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:01:24,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:24,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:24,349 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:01:24,349 INFO L403 AbstractCegarLoop]: === Iteration 4 === 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:01:24,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:24,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1204767852, now seen corresponding path program 1 times [2025-04-29 11:01:24,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:24,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970594925] [2025-04-29 11:01:24,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:24,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:24,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:01:24,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:01:24,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:24,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:24,447 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:01:24,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:24,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970594925] [2025-04-29 11:01:24,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970594925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:24,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:24,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:24,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843250432] [2025-04-29 11:01:24,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:24,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:24,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:24,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:24,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:24,458 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-04-29 11:01:24,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:01:24,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:24,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-04-29 11:01:24,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:24,584 INFO L116 PetriNetUnfolderBase]: 149/394 cut-off events. [2025-04-29 11:01:24,585 INFO L117 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-04-29 11:01:24,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 394 events. 149/394 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1791 event pairs, 62 based on Foata normal form. 12/401 useless extension candidates. Maximal degree in co-relation 817. Up to 183 conditions per place. [2025-04-29 11:01:24,587 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 55 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2025-04-29 11:01:24,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 286 flow [2025-04-29 11:01:24,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2025-04-29 11:01:24,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2025-04-29 11:01:24,588 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 90 flow. Second operand 6 states and 152 transitions. [2025-04-29 11:01:24,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 286 flow [2025-04-29 11:01:24,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 266 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-29 11:01:24,590 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 113 flow [2025-04-29 11:01:24,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-04-29 11:01:24,591 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2025-04-29 11:01:24,591 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 113 flow [2025-04-29 11:01:24,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:01:24,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:24,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:24,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:01:24,591 INFO L403 AbstractCegarLoop]: === Iteration 5 === 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:01:24,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1306902627, now seen corresponding path program 1 times [2025-04-29 11:01:24,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:24,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173074500] [2025-04-29 11:01:24,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:24,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:24,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:01:24,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:01:24,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:24,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:24,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173074500] [2025-04-29 11:01:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173074500] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:24,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439446371] [2025-04-29 11:01:24,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:24,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:24,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:24,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:24,689 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-04-29 11:01:24,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:01:24,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:24,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-04-29 11:01:24,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:24,877 INFO L116 PetriNetUnfolderBase]: 138/384 cut-off events. [2025-04-29 11:01:24,877 INFO L117 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-04-29 11:01:24,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 384 events. 138/384 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1766 event pairs, 62 based on Foata normal form. 12/391 useless extension candidates. Maximal degree in co-relation 785. Up to 183 conditions per place. [2025-04-29 11:01:24,878 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 37 selfloop transitions, 3 changer transitions 29/78 dead transitions. [2025-04-29 11:01:24,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 331 flow [2025-04-29 11:01:24,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:01:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:01:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2025-04-29 11:01:24,881 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5079787234042553 [2025-04-29 11:01:24,881 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 113 flow. Second operand 8 states and 191 transitions. [2025-04-29 11:01:24,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 331 flow [2025-04-29 11:01:24,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 326 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-29 11:01:24,882 INFO L231 Difference]: Finished difference. Result has 57 places, 36 transitions, 100 flow [2025-04-29 11:01:24,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2025-04-29 11:01:24,883 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2025-04-29 11:01:24,883 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 100 flow [2025-04-29 11:01:24,883 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:01:24,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:24,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:24,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:01:24,885 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:01:24,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1667149228, now seen corresponding path program 1 times [2025-04-29 11:01:24,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:24,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027731121] [2025-04-29 11:01:24,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:24,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:24,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:01:24,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:01:24,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:24,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:24,958 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:01:24,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:24,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027731121] [2025-04-29 11:01:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027731121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:24,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:24,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:01:24,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077970822] [2025-04-29 11:01:24,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:24,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:24,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:24,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:24,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:24,974 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2025-04-29 11:01:24,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:01:24,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:24,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2025-04-29 11:01:24,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:25,081 INFO L116 PetriNetUnfolderBase]: 95/258 cut-off events. [2025-04-29 11:01:25,082 INFO L117 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-04-29 11:01:25,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 258 events. 95/258 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 973 event pairs, 42 based on Foata normal form. 11/267 useless extension candidates. Maximal degree in co-relation 538. Up to 103 conditions per place. [2025-04-29 11:01:25,083 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 38 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2025-04-29 11:01:25,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 224 flow [2025-04-29 11:01:25,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-04-29 11:01:25,085 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2025-04-29 11:01:25,085 INFO L175 Difference]: Start difference. First operand has 57 places, 36 transitions, 100 flow. Second operand 6 states and 118 transitions. [2025-04-29 11:01:25,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 224 flow [2025-04-29 11:01:25,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 204 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-04-29 11:01:25,087 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 95 flow [2025-04-29 11:01:25,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=95, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-04-29 11:01:25,088 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2025-04-29 11:01:25,088 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 95 flow [2025-04-29 11:01:25,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:01:25,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:25,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:25,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:01:25,089 INFO L403 AbstractCegarLoop]: === Iteration 7 === 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:01:25,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 142018891, now seen corresponding path program 1 times [2025-04-29 11:01:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:25,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507286473] [2025-04-29 11:01:25,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:25,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:25,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:01:25,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:01:25,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:25,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:25,167 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:01:25,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:25,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507286473] [2025-04-29 11:01:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507286473] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:25,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:01:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035613873] [2025-04-29 11:01:25,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:25,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:25,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:25,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:25,195 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-04-29 11:01:25,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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:01:25,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:25,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-04-29 11:01:25,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:25,318 INFO L116 PetriNetUnfolderBase]: 85/252 cut-off events. [2025-04-29 11:01:25,318 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-29 11:01:25,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 252 events. 85/252 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 950 event pairs, 36 based on Foata normal form. 11/261 useless extension candidates. Maximal degree in co-relation 504. Up to 108 conditions per place. [2025-04-29 11:01:25,320 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 31 selfloop transitions, 5 changer transitions 14/60 dead transitions. [2025-04-29 11:01:25,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 247 flow [2025-04-29 11:01:25,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:01:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:01:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2025-04-29 11:01:25,321 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.541033434650456 [2025-04-29 11:01:25,321 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 95 flow. Second operand 7 states and 178 transitions. [2025-04-29 11:01:25,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 247 flow [2025-04-29 11:01:25,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:01:25,322 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 114 flow [2025-04-29 11:01:25,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=114, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2025-04-29 11:01:25,323 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2025-04-29 11:01:25,323 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 114 flow [2025-04-29 11:01:25,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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:01:25,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:25,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:25,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:01:25,324 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:01:25,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash 670443825, now seen corresponding path program 1 times [2025-04-29 11:01:25,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:25,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135636828] [2025-04-29 11:01:25,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:25,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:01:25,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:01:25,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:25,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:25,448 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:01:25,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:25,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135636828] [2025-04-29 11:01:25,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135636828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:25,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585357473] [2025-04-29 11:01:25,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:25,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:01:25,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:25,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:01:25,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:01:25,450 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-04-29 11:01:25,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:01:25,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:25,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-04-29 11:01:25,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:25,530 INFO L116 PetriNetUnfolderBase]: 69/208 cut-off events. [2025-04-29 11:01:25,530 INFO L117 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-04-29 11:01:25,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 208 events. 69/208 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 701 event pairs, 23 based on Foata normal form. 7/213 useless extension candidates. Maximal degree in co-relation 490. Up to 91 conditions per place. [2025-04-29 11:01:25,532 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 34 selfloop transitions, 7 changer transitions 2/53 dead transitions. [2025-04-29 11:01:25,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 256 flow [2025-04-29 11:01:25,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:01:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:01:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-04-29 11:01:25,533 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6063829787234043 [2025-04-29 11:01:25,533 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 114 flow. Second operand 4 states and 114 transitions. [2025-04-29 11:01:25,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 256 flow [2025-04-29 11:01:25,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 230 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:01:25,537 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 122 flow [2025-04-29 11:01:25,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-04-29 11:01:25,538 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2025-04-29 11:01:25,539 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 122 flow [2025-04-29 11:01:25,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:01:25,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:25,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:25,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:01:25,540 INFO L403 AbstractCegarLoop]: === Iteration 9 === 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:01:25,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1665744935, now seen corresponding path program 1 times [2025-04-29 11:01:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:25,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746666655] [2025-04-29 11:01:25,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:25,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:25,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:01:25,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:01:25,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:25,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:25,721 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:01:25,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:25,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746666655] [2025-04-29 11:01:25,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746666655] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:25,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:25,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:01:25,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247142071] [2025-04-29 11:01:25,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:25,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:25,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:25,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:25,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:25,724 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-04-29 11:01:25,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:25,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:25,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-04-29 11:01:25,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:25,786 INFO L116 PetriNetUnfolderBase]: 70/210 cut-off events. [2025-04-29 11:01:25,786 INFO L117 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-04-29 11:01:25,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 210 events. 70/210 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 724 event pairs, 31 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 488. Up to 102 conditions per place. [2025-04-29 11:01:25,788 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 33 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2025-04-29 11:01:25,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 236 flow [2025-04-29 11:01:25,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:01:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:01:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-29 11:01:25,789 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5797872340425532 [2025-04-29 11:01:25,789 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 122 flow. Second operand 4 states and 109 transitions. [2025-04-29 11:01:25,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 236 flow [2025-04-29 11:01:25,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:01:25,791 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 149 flow [2025-04-29 11:01:25,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-04-29 11:01:25,792 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2025-04-29 11:01:25,792 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 149 flow [2025-04-29 11:01:25,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:25,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:25,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:25,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:01:25,793 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:01:25,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:25,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1040288479, now seen corresponding path program 1 times [2025-04-29 11:01:25,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:25,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081562786] [2025-04-29 11:01:25,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:25,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:25,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:01:25,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:01:25,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:25,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:01:25,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:01:25,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:01:25,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:01:25,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:25,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:01:25,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:01:25,852 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:01:25,853 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-04-29 11:01:25,855 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-04-29 11:01:25,855 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 7 remaining) [2025-04-29 11:01:25,855 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-29 11:01:25,855 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-04-29 11:01:25,855 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-04-29 11:01:25,855 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-04-29 11:01:25,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:01:25,856 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:25,909 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:01:25,910 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:01:25,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:01:25 BasicIcfg [2025-04-29 11:01:25,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:01:25,915 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:01:25,915 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:01:25,915 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:01:25,916 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:01:23" (3/4) ... [2025-04-29 11:01:25,917 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:01:25,964 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-04-29 11:01:26,003 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:01:26,003 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:01:26,003 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:01:26,004 INFO L158 Benchmark]: Toolchain (without parser) took 3278.05ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 114.4MB in the beginning and 211.8MB in the end (delta: -97.4MB). Peak memory consumption was 173.6MB. Max. memory is 16.1GB. [2025-04-29 11:01:26,004 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory was 124.4MB in the beginning and 124.1MB in the end (delta: 294.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:01:26,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.85ms. Allocated memory is still 142.6MB. Free memory was 114.4MB in the beginning and 100.4MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:01:26,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.47ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:01:26,005 INFO L158 Benchmark]: Boogie Preprocessor took 20.08ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 97.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:01:26,005 INFO L158 Benchmark]: RCFGBuilder took 358.50ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 67.4MB in the end (delta: 29.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-29 11:01:26,005 INFO L158 Benchmark]: TraceAbstraction took 2572.97ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 66.6MB in the beginning and 220.4MB in the end (delta: -153.8MB). Peak memory consumption was 123.3MB. Max. memory is 16.1GB. [2025-04-29 11:01:26,005 INFO L158 Benchmark]: Witness Printer took 88.33ms. Allocated memory is still 419.4MB. Free memory was 220.4MB in the beginning and 211.8MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:01:26,006 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.22ms. Allocated memory is still 201.3MB. Free memory was 124.4MB in the beginning and 124.1MB in the end (delta: 294.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.85ms. Allocated memory is still 142.6MB. Free memory was 114.4MB in the beginning and 100.4MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.47ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.08ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 97.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 358.50ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 67.4MB in the end (delta: 29.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2572.97ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 66.6MB in the beginning and 220.4MB in the end (delta: -153.8MB). Peak memory consumption was 123.3MB. Max. memory is 16.1GB. * Witness Printer took 88.33ms. Allocated memory is still 419.4MB. Free memory was 220.4MB in the beginning and 211.8MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: integer overflow possible integer overflow possible We found a FailurePath: [L17] 0 int g = 0; [L18] 0 int h = 0; [L19] 0 int i = 0; [L20] 0 pthread_mutex_t A = PTHREAD_MUTEX_INITIALIZER; [L20] 0 pthread_mutex_t A = PTHREAD_MUTEX_INITIALIZER; [L21] 0 pthread_mutex_t B = PTHREAD_MUTEX_INITIALIZER; [L21] 0 pthread_mutex_t B = PTHREAD_MUTEX_INITIALIZER; [L22] 0 pthread_mutex_t C = PTHREAD_MUTEX_INITIALIZER; [L22] 0 pthread_mutex_t C = PTHREAD_MUTEX_INITIALIZER; [L47] 0 int x = __VERIFIER_nondet_int(); [L48] COND TRUE 0 x > -1000 [L49] 0 pthread_t id; [L50] FCALL, FORK 0 pthread_create(&id, NULL, t_fun, NULL) VAL [A={1:0}, B={2:0}, C={3:0}, g=0, h=0, i=0, id=-1, x=2147483617] [L25] 1 int x = __VERIFIER_nondet_int(); [L26] 1 int y = __VERIFIER_nondet_int(); [L27] 1 int z = __VERIFIER_nondet_int(); [L28] COND TRUE 1 x < 1000 VAL [A={1:0}, B={2:0}, C={3:0}, \at(arg, Pre)={0:0}, arg={0:0}, g=0, h=0, i=0, x=0, y=0, z=0] [L54] 0 i = 11 [L55] 0 g = x VAL [A={1:0}, B={2:0}, C={3:0}, g=2147483617, h=0, i=11, id=-1, x=2147483617] [L56] EXPR 0 x - 17 [L56] 0 h = x - 17 VAL [A={1:0}, B={2:0}, C={3:0}, g=2147483617, h=2147483600, i=11, id=-1, x=2147483617] [L59] 0 h = x VAL [A={1:0}, B={2:0}, C={3:0}, g=2147483617, h=2147483617, i=11, id=-1, x=2147483617] [L31] 1 x = g [L32] 1 y = h [L33] CALL 1 __VERIFIER_assert(y <= x) [L11] COND FALSE 1 !(!(cond)) [L33] RET 1 __VERIFIER_assert(y <= x) [L35] CALL 1 __VERIFIER_assert(x == y) [L11] COND FALSE 1 !(!(cond)) [L35] RET 1 __VERIFIER_assert(x == y) [L37] 1 x + 31 VAL [A={1:0}, B={2:0}, C={3:0}, \at(arg, Pre)={0:0}, arg={0:0}, g=2147483617, h=2147483617, i=11, x=2147483617, y=2147483617, z=0] - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 67 locations, 68 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: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 401 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 344 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 865 IncrementalHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 8 mSDtfsCounter, 865 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=9, InterpolantAutomatonStates: 46, 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.8s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 RESULT: Ultimate proved your program to be incorrect! [2025-04-29 11:01:26,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)