./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f222d5749b9bb10b4d4c09b2c40e45ee19dec77732a8593ce917652e8ca8a43e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:22:21,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:22:21,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:22:21,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:22:21,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:22:21,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:22:21,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:22:21,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:22:21,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:22:21,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:22:21,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:22:21,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:22:21,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:22:21,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:22:21,797 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:22:21,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:22:21,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:22:21,797 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:22:21,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:22:21,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:22:21,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:22:21,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:22:21,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:22:21,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:22:21,797 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:22:21,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:22:21,799 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:22:21,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:22:21,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:22:21,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:22:21,800 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:22:21,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:22:21,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:22:21,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:22:21,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:21,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:22:21,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:22:21,801 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:22:21,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:22:21,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:22:21,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:22:21,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:22:21,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:22:21,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:22:21,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:22:21,801 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 -> f222d5749b9bb10b4d4c09b2c40e45ee19dec77732a8593ce917652e8ca8a43e [2025-03-04 15:22:22,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:22:22,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:22:22,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:22:22,012 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:22:22,015 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:22:22,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2025-03-04 15:22:23,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c8cdb9a8/84a4b938630645a3bb7f973ffa0dfb5e/FLAGa6f8345c6 [2025-03-04 15:22:23,443 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:22:23,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2025-03-04 15:22:23,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c8cdb9a8/84a4b938630645a3bb7f973ffa0dfb5e/FLAGa6f8345c6 [2025-03-04 15:22:23,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c8cdb9a8/84a4b938630645a3bb7f973ffa0dfb5e [2025-03-04 15:22:23,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:22:23,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:22:23,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:23,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:22:23,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:22:23,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:23" (1/1) ... [2025-03-04 15:22:23,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4d1ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:23, skipping insertion in model container [2025-03-04 15:22:23,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:23" (1/1) ... [2025-03-04 15:22:23,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:22:23,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:23,961 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:22:23,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:24,013 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:22:24,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24 WrapperNode [2025-03-04 15:22:24,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:24,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:24,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:22:24,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:22:24,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (1/1) ... [2025-03-04 15:22:24,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (1/1) ... [2025-03-04 15:22:24,045 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2025-03-04 15:22:24,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:24,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:22:24,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:22:24,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:22:24,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (1/1) ... [2025-03-04 15:22:24,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (1/1) ... [2025-03-04 15:22:24,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (1/1) ... [2025-03-04 15:22:24,075 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 5, 6, 5, 2]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5, 0]. The 3 writes are split as follows [0, 0, 2, 0, 1]. [2025-03-04 15:22:24,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (1/1) ... [2025-03-04 15:22:24,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (1/1) ... [2025-03-04 15:22:24,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (1/1) ... [2025-03-04 15:22:24,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (1/1) ... [2025-03-04 15:22:24,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (1/1) ... [2025-03-04 15:22:24,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (1/1) ... [2025-03-04 15:22:24,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:22:24,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:22:24,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:22:24,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:22:24,098 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (1/1) ... [2025-03-04 15:22:24,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:24,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:24,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:22:24,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:22:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:22:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:22:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:22:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:22:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 15:22:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:22:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:22:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:22:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:22:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 15:22:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:22:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:22:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:22:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:22:24,140 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:22:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:22:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:22:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:22:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:22:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:22:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 15:22:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:22:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:22:24,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:22:24,142 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:22:24,257 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:22:24,258 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:22:24,430 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:22:24,431 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 15:22:24,475 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:22:24,475 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:22:24,673 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:22:24,673 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:22:24,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:24 BoogieIcfgContainer [2025-03-04 15:22:24,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:22:24,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:22:24,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:22:24,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:22:24,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:22:23" (1/3) ... [2025-03-04 15:22:24,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66dc6372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:24, skipping insertion in model container [2025-03-04 15:22:24,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:24" (2/3) ... [2025-03-04 15:22:24,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66dc6372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:24, skipping insertion in model container [2025-03-04 15:22:24,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:24" (3/3) ... [2025-03-04 15:22:24,680 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_51-mutexptr_racefree.i [2025-03-04 15:22:24,690 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:22:24,692 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_51-mutexptr_racefree.i that has 2 procedures, 50 locations, 1 initial locations, 5 loop locations, and 8 error locations. [2025-03-04 15:22:24,692 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:22:24,730 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:22:24,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 59 transitions, 125 flow [2025-03-04 15:22:24,789 INFO L124 PetriNetUnfolderBase]: 11/74 cut-off events. [2025-03-04 15:22:24,791 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:24,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 74 events. 11/74 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 223 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 50. Up to 4 conditions per place. [2025-03-04 15:22:24,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 59 transitions, 125 flow [2025-03-04 15:22:24,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 58 transitions, 123 flow [2025-03-04 15:22:24,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:24,813 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2165292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:24,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 15:22:24,818 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:24,818 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:22:24,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:24,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:24,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:24,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:22:24,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash 419075545, now seen corresponding path program 1 times [2025-03-04 15:22:24,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:24,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460733905] [2025-03-04 15:22:24,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:24,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:24,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:24,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:24,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:24,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:25,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:25,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460733905] [2025-03-04 15:22:25,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460733905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:25,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:25,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:25,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866877833] [2025-03-04 15:22:25,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:25,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:25,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:25,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:25,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:25,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2025-03-04 15:22:25,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:25,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:25,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2025-03-04 15:22:25,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:25,401 INFO L124 PetriNetUnfolderBase]: 144/398 cut-off events. [2025-03-04 15:22:25,402 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:25,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 398 events. 144/398 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1877 event pairs, 0 based on Foata normal form. 65/430 useless extension candidates. Maximal degree in co-relation 689. Up to 277 conditions per place. [2025-03-04 15:22:25,406 INFO L140 encePairwiseOnDemand]: 45/59 looper letters, 49 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2025-03-04 15:22:25,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 257 flow [2025-03-04 15:22:25,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-03-04 15:22:25,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673728813559322 [2025-03-04 15:22:25,418 INFO L175 Difference]: Start difference. First operand has 53 places, 58 transitions, 123 flow. Second operand 4 states and 159 transitions. [2025-03-04 15:22:25,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 257 flow [2025-03-04 15:22:25,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 257 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:25,427 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 113 flow [2025-03-04 15:22:25,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-03-04 15:22:25,431 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-03-04 15:22:25,432 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 113 flow [2025-03-04 15:22:25,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:25,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:25,433 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:25,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:22:25,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:22:25,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash -789987085, now seen corresponding path program 1 times [2025-03-04 15:22:25,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:25,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457629116] [2025-03-04 15:22:25,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:25,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:25,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:22:25,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:22:25,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:25,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:25,486 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:25,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:22:25,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:22:25,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:25,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:25,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:25,513 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:25,514 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 15:22:25,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-04 15:22:25,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-04 15:22:25,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-04 15:22:25,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-04 15:22:25,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-04 15:22:25,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-04 15:22:25,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-04 15:22:25,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-04 15:22:25,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-04 15:22:25,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-04 15:22:25,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-04 15:22:25,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-04 15:22:25,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:22:25,516 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 15:22:25,518 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:25,518 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:22:25,539 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:22:25,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 91 transitions, 198 flow [2025-03-04 15:22:25,562 INFO L124 PetriNetUnfolderBase]: 21/140 cut-off events. [2025-03-04 15:22:25,562 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:22:25,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 140 events. 21/140 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 513 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 89. Up to 6 conditions per place. [2025-03-04 15:22:25,564 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 91 transitions, 198 flow [2025-03-04 15:22:25,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 91 transitions, 198 flow [2025-03-04 15:22:25,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:25,567 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2165292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:25,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 15:22:25,570 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:25,570 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 15:22:25,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:25,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:25,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:25,571 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:22:25,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:25,571 INFO L85 PathProgramCache]: Analyzing trace with hash 505946130, now seen corresponding path program 1 times [2025-03-04 15:22:25,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:25,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216836360] [2025-03-04 15:22:25,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:25,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:25,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:25,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:25,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:25,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:25,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:25,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216836360] [2025-03-04 15:22:25,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216836360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:25,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:25,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892633119] [2025-03-04 15:22:25,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:25,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:25,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:25,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:25,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:25,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 91 [2025-03-04 15:22:25,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:25,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:25,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 91 [2025-03-04 15:22:25,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:26,555 INFO L124 PetriNetUnfolderBase]: 4742/9598 cut-off events. [2025-03-04 15:22:26,556 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-04 15:22:26,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17188 conditions, 9598 events. 4742/9598 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 75835 event pairs, 2644 based on Foata normal form. 1382/10036 useless extension candidates. Maximal degree in co-relation 3434. Up to 7478 conditions per place. [2025-03-04 15:22:26,609 INFO L140 encePairwiseOnDemand]: 71/91 looper letters, 68 selfloop transitions, 3 changer transitions 0/104 dead transitions. [2025-03-04 15:22:26,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 366 flow [2025-03-04 15:22:26,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2025-03-04 15:22:26,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6373626373626373 [2025-03-04 15:22:26,612 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 198 flow. Second operand 4 states and 232 transitions. [2025-03-04 15:22:26,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 366 flow [2025-03-04 15:22:26,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 104 transitions, 366 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:26,615 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 194 flow [2025-03-04 15:22:26,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-03-04 15:22:26,616 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 5 predicate places. [2025-03-04 15:22:26,616 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 194 flow [2025-03-04 15:22:26,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:26,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:26,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:26,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:22:26,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:22:26,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:26,618 INFO L85 PathProgramCache]: Analyzing trace with hash -611470423, now seen corresponding path program 1 times [2025-03-04 15:22:26,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:26,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65678562] [2025-03-04 15:22:26,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:26,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:26,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:26,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:26,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:26,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:26,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65678562] [2025-03-04 15:22:26,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65678562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:26,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:26,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:26,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604335412] [2025-03-04 15:22:26,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:26,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:26,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:26,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:26,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:26,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 91 [2025-03-04 15:22:26,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:26,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:26,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 91 [2025-03-04 15:22:26,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:27,753 INFO L124 PetriNetUnfolderBase]: 6126/12739 cut-off events. [2025-03-04 15:22:27,754 INFO L125 PetriNetUnfolderBase]: For 515/887 co-relation queries the response was YES. [2025-03-04 15:22:27,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23122 conditions, 12739 events. 6126/12739 cut-off events. For 515/887 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 109483 event pairs, 1719 based on Foata normal form. 231/11908 useless extension candidates. Maximal degree in co-relation 23016. Up to 6013 conditions per place. [2025-03-04 15:22:27,802 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 123 selfloop transitions, 12 changer transitions 0/170 dead transitions. [2025-03-04 15:22:27,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 170 transitions, 686 flow [2025-03-04 15:22:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:22:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:22:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 306 transitions. [2025-03-04 15:22:27,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6725274725274726 [2025-03-04 15:22:27,804 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 194 flow. Second operand 5 states and 306 transitions. [2025-03-04 15:22:27,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 170 transitions, 686 flow [2025-03-04 15:22:27,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 170 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:27,807 INFO L231 Difference]: Finished difference. Result has 92 places, 90 transitions, 286 flow [2025-03-04 15:22:27,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=92, PETRI_TRANSITIONS=90} [2025-03-04 15:22:27,808 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 12 predicate places. [2025-03-04 15:22:27,808 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 90 transitions, 286 flow [2025-03-04 15:22:27,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:27,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:27,808 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:27,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:22:27,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:22:27,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:27,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1336410952, now seen corresponding path program 1 times [2025-03-04 15:22:27,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:27,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210790066] [2025-03-04 15:22:27,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:27,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:27,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:22:27,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:22:27,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:27,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:27,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:27,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210790066] [2025-03-04 15:22:27,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210790066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:27,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:27,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:22:27,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051066055] [2025-03-04 15:22:27,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:27,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:27,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:27,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:27,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:27,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 91 [2025-03-04 15:22:27,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 90 transitions, 286 flow. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:27,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:27,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 91 [2025-03-04 15:22:27,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:28,778 INFO L124 PetriNetUnfolderBase]: 6342/12891 cut-off events. [2025-03-04 15:22:28,778 INFO L125 PetriNetUnfolderBase]: For 4202/4202 co-relation queries the response was YES. [2025-03-04 15:22:28,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26983 conditions, 12891 events. 6342/12891 cut-off events. For 4202/4202 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 109180 event pairs, 1290 based on Foata normal form. 177/12124 useless extension candidates. Maximal degree in co-relation 20648. Up to 7737 conditions per place. [2025-03-04 15:22:28,833 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 133 selfloop transitions, 6 changer transitions 0/172 dead transitions. [2025-03-04 15:22:28,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 172 transitions, 810 flow [2025-03-04 15:22:28,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 317 transitions. [2025-03-04 15:22:28,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5805860805860806 [2025-03-04 15:22:28,834 INFO L175 Difference]: Start difference. First operand has 92 places, 90 transitions, 286 flow. Second operand 6 states and 317 transitions. [2025-03-04 15:22:28,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 172 transitions, 810 flow [2025-03-04 15:22:28,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 172 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:28,847 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 294 flow [2025-03-04 15:22:28,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2025-03-04 15:22:28,848 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 16 predicate places. [2025-03-04 15:22:28,848 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 294 flow [2025-03-04 15:22:28,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:28,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:28,848 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:22:28,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:22:28,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:22:28,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1520932974, now seen corresponding path program 1 times [2025-03-04 15:22:28,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:28,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713258532] [2025-03-04 15:22:28,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:28,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:22:28,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:22:28,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:28,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:28,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:28,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713258532] [2025-03-04 15:22:28,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713258532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:28,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:28,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:28,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551090325] [2025-03-04 15:22:28,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:28,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:28,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:28,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:28,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:28,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 91 [2025-03-04 15:22:28,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:28,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:28,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 91 [2025-03-04 15:22:28,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:29,782 INFO L124 PetriNetUnfolderBase]: 6031/12018 cut-off events. [2025-03-04 15:22:29,782 INFO L125 PetriNetUnfolderBase]: For 4932/4932 co-relation queries the response was YES. [2025-03-04 15:22:29,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25908 conditions, 12018 events. 6031/12018 cut-off events. For 4932/4932 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 98568 event pairs, 1620 based on Foata normal form. 185/11533 useless extension candidates. Maximal degree in co-relation 19629. Up to 8290 conditions per place. [2025-03-04 15:22:29,847 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 108 selfloop transitions, 6 changer transitions 0/147 dead transitions. [2025-03-04 15:22:29,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 147 transitions, 700 flow [2025-03-04 15:22:29,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2025-03-04 15:22:29,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2025-03-04 15:22:29,849 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 294 flow. Second operand 4 states and 224 transitions. [2025-03-04 15:22:29,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 147 transitions, 700 flow [2025-03-04 15:22:29,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 147 transitions, 684 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:22:29,862 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 294 flow [2025-03-04 15:22:29,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=294, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2025-03-04 15:22:29,863 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 14 predicate places. [2025-03-04 15:22:29,863 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 294 flow [2025-03-04 15:22:29,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:29,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:29,863 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 15:22:29,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:22:29,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:22:29,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:29,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1327691203, now seen corresponding path program 1 times [2025-03-04 15:22:29,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:29,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15113497] [2025-03-04 15:22:29,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:29,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:29,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:22:29,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:22:29,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:29,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:29,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:29,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:22:29,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:22:29,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:29,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:29,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:29,919 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:29,919 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-04 15:22:29,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-04 15:22:29,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-04 15:22:29,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-04 15:22:29,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-04 15:22:29,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:22:29,921 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 15:22:29,922 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:29,922 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:22:29,958 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:22:29,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 123 transitions, 273 flow [2025-03-04 15:22:29,982 INFO L124 PetriNetUnfolderBase]: 34/225 cut-off events. [2025-03-04 15:22:29,983 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:22:29,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 225 events. 34/225 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 911 event pairs, 1 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 155. Up to 12 conditions per place. [2025-03-04 15:22:29,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 123 transitions, 273 flow [2025-03-04 15:22:29,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 123 transitions, 273 flow [2025-03-04 15:22:29,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:29,988 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2165292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:29,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 15:22:29,993 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:29,993 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 15:22:29,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:29,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:29,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:29,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:22:29,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash 623354475, now seen corresponding path program 1 times [2025-03-04 15:22:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:29,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427758924] [2025-03-04 15:22:29,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:29,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:30,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:30,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:30,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:30,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:30,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:30,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427758924] [2025-03-04 15:22:30,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427758924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:30,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:30,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:30,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983361031] [2025-03-04 15:22:30,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:30,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:30,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:30,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:30,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:30,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 123 [2025-03-04 15:22:30,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 123 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:30,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:30,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 123 [2025-03-04 15:22:30,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:38,707 INFO L124 PetriNetUnfolderBase]: 97039/172514 cut-off events. [2025-03-04 15:22:38,707 INFO L125 PetriNetUnfolderBase]: For 2042/2042 co-relation queries the response was YES. [2025-03-04 15:22:38,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308166 conditions, 172514 events. 97039/172514 cut-off events. For 2042/2042 co-relation queries the response was YES. Maximal size of possible extension queue 3655. Compared 1786209 event pairs, 63133 based on Foata normal form. 26434/183879 useless extension candidates. Maximal degree in co-relation 18108. Up to 134303 conditions per place. [2025-03-04 15:22:39,666 INFO L140 encePairwiseOnDemand]: 97/123 looper letters, 82 selfloop transitions, 3 changer transitions 0/130 dead transitions. [2025-03-04 15:22:39,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 130 transitions, 457 flow [2025-03-04 15:22:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions. [2025-03-04 15:22:39,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-03-04 15:22:39,667 INFO L175 Difference]: Start difference. First operand has 107 places, 123 transitions, 273 flow. Second operand 4 states and 300 transitions. [2025-03-04 15:22:39,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 130 transitions, 457 flow [2025-03-04 15:22:39,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 130 transitions, 457 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:39,672 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 257 flow [2025-03-04 15:22:39,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2025-03-04 15:22:39,674 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2025-03-04 15:22:39,674 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 257 flow [2025-03-04 15:22:39,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:39,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:39,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:39,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:22:39,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:22:39,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash -504848702, now seen corresponding path program 1 times [2025-03-04 15:22:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:39,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161120038] [2025-03-04 15:22:39,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:39,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:39,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:39,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:39,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:39,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:39,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161120038] [2025-03-04 15:22:39,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161120038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:39,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:39,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:39,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748308946] [2025-03-04 15:22:39,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:39,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:39,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:39,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:39,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:39,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 123 [2025-03-04 15:22:39,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:39,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:39,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 123 [2025-03-04 15:22:39,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:52,925 INFO L124 PetriNetUnfolderBase]: 137611/236006 cut-off events. [2025-03-04 15:22:52,925 INFO L125 PetriNetUnfolderBase]: For 8589/14106 co-relation queries the response was YES. [2025-03-04 15:22:53,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435508 conditions, 236006 events. 137611/236006 cut-off events. For 8589/14106 co-relation queries the response was YES. Maximal size of possible extension queue 5152. Compared 2448205 event pairs, 46351 based on Foata normal form. 3269/221467 useless extension candidates. Maximal degree in co-relation 435401. Up to 123526 conditions per place. [2025-03-04 15:22:54,179 INFO L140 encePairwiseOnDemand]: 112/123 looper letters, 180 selfloop transitions, 16 changer transitions 0/243 dead transitions. [2025-03-04 15:22:54,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 243 transitions, 995 flow [2025-03-04 15:22:54,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:22:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:22:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2025-03-04 15:22:54,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6943089430894309 [2025-03-04 15:22:54,180 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 257 flow. Second operand 5 states and 427 transitions. [2025-03-04 15:22:54,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 243 transitions, 995 flow [2025-03-04 15:22:54,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 243 transitions, 991 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:54,202 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 383 flow [2025-03-04 15:22:54,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=383, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2025-03-04 15:22:54,202 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 12 predicate places. [2025-03-04 15:22:54,202 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 383 flow [2025-03-04 15:22:54,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:54,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:54,202 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:54,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:22:54,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:22:54,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1156092648, now seen corresponding path program 1 times [2025-03-04 15:22:54,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:54,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023498081] [2025-03-04 15:22:54,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:54,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:54,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:22:54,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:22:54,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:54,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:54,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:54,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023498081] [2025-03-04 15:22:54,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023498081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:54,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:54,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:22:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050783248] [2025-03-04 15:22:54,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:54,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:54,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:54,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:54,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 123 [2025-03-04 15:22:54,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:54,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:54,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 123 [2025-03-04 15:22:54,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand