./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_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_12-ptr_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 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:21:35,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:21:35,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:21:35,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:21:35,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:21:35,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:21:35,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:21:35,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:21:35,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:21:35,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:21:35,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:21:35,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:21:35,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:21:35,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:21:35,811 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:21:35,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:21:35,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:21:35,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:21:35,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:21:35,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:21:35,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:21:35,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:21:35,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:21:35,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:21:35,814 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:21:35,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:21:35,814 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:21:35,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:21:35,814 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:21:35,814 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:21:35,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:21:35,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:21:35,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:21:35,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:21:35,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:21:35,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:21:35,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:21:35,815 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:21:35,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:21:35,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:21:35,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:21:35,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:21:35,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:21:35,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:21:35,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:21:35,816 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 -> 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 [2025-03-04 15:21:36,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:21:36,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:21:36,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:21:36,058 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:21:36,058 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:21:36,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2025-03-04 15:21:37,228 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00da8087/15642a842ba9463c951e50eae0f0f4b0/FLAG36fff4406 [2025-03-04 15:21:37,538 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:21:37,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2025-03-04 15:21:37,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00da8087/15642a842ba9463c951e50eae0f0f4b0/FLAG36fff4406 [2025-03-04 15:21:37,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00da8087/15642a842ba9463c951e50eae0f0f4b0 [2025-03-04 15:21:37,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:21:37,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:21:37,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:21:37,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:21:37,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:21:37,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce86567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37, skipping insertion in model container [2025-03-04 15:21:37,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:21:37,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:21:37,825 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:21:37,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:21:37,894 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:21:37,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37 WrapperNode [2025-03-04 15:21:37,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:21:37,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:21:37,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:21:37,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:21:37,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,923 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2025-03-04 15:21:37,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:21:37,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:21:37,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:21:37,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:21:37,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,941 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 5, 2, 5, 6]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 0, 5, 1]. The 3 writes are split as follows [0, 0, 1, 0, 2]. [2025-03-04 15:21:37,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,950 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:21:37,962 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:21:37,962 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:21:37,962 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:21:37,963 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (1/1) ... [2025-03-04 15:21:37,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:21:37,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:21:37,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:21:37,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:21:38,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:21:38,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:21:38,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:21:38,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:21:38,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 15:21:38,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:21:38,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:21:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:21:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:21:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 15:21:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:21:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:21:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:21:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:21:38,008 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:21:38,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:21:38,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:21:38,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:21:38,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:21:38,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:21:38,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 15:21:38,008 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:21:38,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:21:38,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:21:38,010 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:21:38,113 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:21:38,115 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:21:38,344 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L708: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:21:38,345 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 15:21:38,394 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:21:38,394 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:21:38,617 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:21:38,618 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:21:38,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:21:38 BoogieIcfgContainer [2025-03-04 15:21:38,619 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:21:38,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:21:38,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:21:38,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:21:38,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:21:37" (1/3) ... [2025-03-04 15:21:38,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de14f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:21:38, skipping insertion in model container [2025-03-04 15:21:38,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:37" (2/3) ... [2025-03-04 15:21:38,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de14f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:21:38, skipping insertion in model container [2025-03-04 15:21:38,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:21:38" (3/3) ... [2025-03-04 15:21:38,626 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2025-03-04 15:21:38,636 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:21:38,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_12-ptr_racefree.i that has 2 procedures, 50 locations, 1 initial locations, 5 loop locations, and 8 error locations. [2025-03-04 15:21:38,640 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:21:38,684 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:21:38,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 59 transitions, 125 flow [2025-03-04 15:21:38,752 INFO L124 PetriNetUnfolderBase]: 11/74 cut-off events. [2025-03-04 15:21:38,756 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:21:38,759 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 221 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:21:38,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 59 transitions, 125 flow [2025-03-04 15:21:38,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 58 transitions, 123 flow [2025-03-04 15:21:38,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:38,778 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;@589ea100, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:38,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 15:21:38,783 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:38,783 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:21:38,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:38,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:38,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:38,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:21:38,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:38,790 INFO L85 PathProgramCache]: Analyzing trace with hash 413790938, now seen corresponding path program 1 times [2025-03-04 15:21:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:38,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054438400] [2025-03-04 15:21:38,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:38,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:38,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:38,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:38,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:38,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:39,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054438400] [2025-03-04 15:21:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054438400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:39,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:39,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937128795] [2025-03-04 15:21:39,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:39,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:39,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:39,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:39,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:39,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2025-03-04 15:21:39,124 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:21:39,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:39,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2025-03-04 15:21:39,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:39,315 INFO L124 PetriNetUnfolderBase]: 144/398 cut-off events. [2025-03-04 15:21:39,315 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:21:39,317 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 1879 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:21:39,320 INFO L140 encePairwiseOnDemand]: 45/59 looper letters, 49 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2025-03-04 15:21:39,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 257 flow [2025-03-04 15:21:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-03-04 15:21:39,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673728813559322 [2025-03-04 15:21:39,334 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:21:39,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 257 flow [2025-03-04 15:21:39,338 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:21:39,342 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 113 flow [2025-03-04 15:21:39,344 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:21:39,346 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-03-04 15:21:39,348 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 113 flow [2025-03-04 15:21:39,348 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:21:39,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:39,348 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:39,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:21:39,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:21:39,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash 690039479, now seen corresponding path program 1 times [2025-03-04 15:21:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:39,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246919889] [2025-03-04 15:21:39,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:39,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:39,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:21:39,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:21:39,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:39,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:39,408 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:21:39,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:21:39,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:21:39,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:39,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:39,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:21:39,458 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:21:39,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 15:21:39,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-04 15:21:39,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-04 15:21:39,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-04 15:21:39,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-04 15:21:39,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-04 15:21:39,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-04 15:21:39,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-04 15:21:39,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-04 15:21:39,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-04 15:21:39,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-04 15:21:39,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-04 15:21:39,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-04 15:21:39,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:21:39,462 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 15:21:39,464 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:21:39,465 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:21:39,489 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:21:39,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 91 transitions, 198 flow [2025-03-04 15:21:39,512 INFO L124 PetriNetUnfolderBase]: 21/140 cut-off events. [2025-03-04 15:21:39,512 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:21:39,513 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 515 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:21:39,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 91 transitions, 198 flow [2025-03-04 15:21:39,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 91 transitions, 198 flow [2025-03-04 15:21:39,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:39,517 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;@589ea100, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:39,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 15:21:39,519 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:39,519 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 15:21:39,519 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:39,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:39,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:39,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:39,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash 500661523, now seen corresponding path program 1 times [2025-03-04 15:21:39,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:39,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282872564] [2025-03-04 15:21:39,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:39,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:39,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:39,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:39,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:39,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282872564] [2025-03-04 15:21:39,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282872564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:39,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:39,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:39,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832349000] [2025-03-04 15:21:39,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:39,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:39,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:39,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:39,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 91 [2025-03-04 15:21:39,613 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:21:39,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:39,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 91 [2025-03-04 15:21:39,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:40,509 INFO L124 PetriNetUnfolderBase]: 4742/9620 cut-off events. [2025-03-04 15:21:40,510 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-04 15:21:40,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17210 conditions, 9620 events. 4742/9620 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 76292 event pairs, 2644 based on Foata normal form. 1382/10058 useless extension candidates. Maximal degree in co-relation 3435. Up to 7478 conditions per place. [2025-03-04 15:21:40,567 INFO L140 encePairwiseOnDemand]: 71/91 looper letters, 68 selfloop transitions, 3 changer transitions 0/104 dead transitions. [2025-03-04 15:21:40,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 366 flow [2025-03-04 15:21:40,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2025-03-04 15:21:40,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6373626373626373 [2025-03-04 15:21:40,570 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:21:40,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 366 flow [2025-03-04 15:21:40,574 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:21:40,577 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 194 flow [2025-03-04 15:21:40,577 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:21:40,577 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 5 predicate places. [2025-03-04 15:21:40,578 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 194 flow [2025-03-04 15:21:40,578 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:21:40,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:40,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:40,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:21:40,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:40,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:40,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2028601838, now seen corresponding path program 1 times [2025-03-04 15:21:40,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:40,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433523019] [2025-03-04 15:21:40,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:40,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:40,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:21:40,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:21:40,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:40,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:40,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:40,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433523019] [2025-03-04 15:21:40,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433523019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:40,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:40,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:21:40,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272199150] [2025-03-04 15:21:40,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:40,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:21:40,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:40,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:21:40,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:21:40,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 91 [2025-03-04 15:21:40,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:40,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:40,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 91 [2025-03-04 15:21:40,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:41,870 INFO L124 PetriNetUnfolderBase]: 6470/13279 cut-off events. [2025-03-04 15:21:41,871 INFO L125 PetriNetUnfolderBase]: For 525/907 co-relation queries the response was YES. [2025-03-04 15:21:41,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24209 conditions, 13279 events. 6470/13279 cut-off events. For 525/907 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 114694 event pairs, 1227 based on Foata normal form. 283/12482 useless extension candidates. Maximal degree in co-relation 24103. Up to 6083 conditions per place. [2025-03-04 15:21:41,928 INFO L140 encePairwiseOnDemand]: 81/91 looper letters, 163 selfloop transitions, 17 changer transitions 0/215 dead transitions. [2025-03-04 15:21:41,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 215 transitions, 884 flow [2025-03-04 15:21:41,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:21:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:21:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 420 transitions. [2025-03-04 15:21:41,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6593406593406593 [2025-03-04 15:21:41,933 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 194 flow. Second operand 7 states and 420 transitions. [2025-03-04 15:21:41,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 215 transitions, 884 flow [2025-03-04 15:21:41,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 215 transitions, 879 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:21:41,939 INFO L231 Difference]: Finished difference. Result has 96 places, 96 transitions, 324 flow [2025-03-04 15:21:41,939 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=324, PETRI_PLACES=96, PETRI_TRANSITIONS=96} [2025-03-04 15:21:41,940 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 16 predicate places. [2025-03-04 15:21:41,940 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 324 flow [2025-03-04 15:21:41,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:41,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:41,941 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:41,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:21:41,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:41,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:41,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2007763912, now seen corresponding path program 1 times [2025-03-04 15:21:41,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:41,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016756732] [2025-03-04 15:21:41,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:41,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:41,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:21:41,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:21:41,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:41,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:42,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:42,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016756732] [2025-03-04 15:21:42,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016756732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:42,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:42,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:21:42,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809118521] [2025-03-04 15:21:42,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:42,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:21:42,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:42,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:21:42,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:21:42,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 91 [2025-03-04 15:21:42,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 324 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:21:42,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:42,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 91 [2025-03-04 15:21:42,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:43,210 INFO L124 PetriNetUnfolderBase]: 6612/13118 cut-off events. [2025-03-04 15:21:43,211 INFO L125 PetriNetUnfolderBase]: For 4420/4420 co-relation queries the response was YES. [2025-03-04 15:21:43,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27910 conditions, 13118 events. 6612/13118 cut-off events. For 4420/4420 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 109528 event pairs, 1379 based on Foata normal form. 177/12392 useless extension candidates. Maximal degree in co-relation 27237. Up to 8145 conditions per place. [2025-03-04 15:21:43,283 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 145 selfloop transitions, 6 changer transitions 0/184 dead transitions. [2025-03-04 15:21:43,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 184 transitions, 912 flow [2025-03-04 15:21:43,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:21:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:21:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 317 transitions. [2025-03-04 15:21:43,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5805860805860806 [2025-03-04 15:21:43,285 INFO L175 Difference]: Start difference. First operand has 96 places, 96 transitions, 324 flow. Second operand 6 states and 317 transitions. [2025-03-04 15:21:43,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 184 transitions, 912 flow [2025-03-04 15:21:43,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 184 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:43,296 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 332 flow [2025-03-04 15:21:43,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2025-03-04 15:21:43,297 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 20 predicate places. [2025-03-04 15:21:43,297 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 332 flow [2025-03-04 15:21:43,297 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:21:43,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:43,298 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:21:43,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:21:43,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:43,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:43,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2111139564, now seen corresponding path program 1 times [2025-03-04 15:21:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398614736] [2025-03-04 15:21:43,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:43,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:43,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:21:43,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:21:43,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:43,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398614736] [2025-03-04 15:21:43,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398614736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:43,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:43,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:21:43,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940778260] [2025-03-04 15:21:43,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:43,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:43,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:43,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:43,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:43,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 91 [2025-03-04 15:21:43,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 332 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:21:43,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:43,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 91 [2025-03-04 15:21:43,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:44,189 INFO L124 PetriNetUnfolderBase]: 6285/12485 cut-off events. [2025-03-04 15:21:44,189 INFO L125 PetriNetUnfolderBase]: For 5083/5083 co-relation queries the response was YES. [2025-03-04 15:21:44,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27035 conditions, 12485 events. 6285/12485 cut-off events. For 5083/5083 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 103421 event pairs, 1484 based on Foata normal form. 177/11992 useless extension candidates. Maximal degree in co-relation 26385. Up to 8674 conditions per place. [2025-03-04 15:21:44,232 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 120 selfloop transitions, 6 changer transitions 0/159 dead transitions. [2025-03-04 15:21:44,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 159 transitions, 794 flow [2025-03-04 15:21:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2025-03-04 15:21:44,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2025-03-04 15:21:44,234 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 332 flow. Second operand 4 states and 224 transitions. [2025-03-04 15:21:44,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 159 transitions, 794 flow [2025-03-04 15:21:44,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 159 transitions, 778 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:21:44,245 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 332 flow [2025-03-04 15:21:44,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-03-04 15:21:44,246 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2025-03-04 15:21:44,246 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 332 flow [2025-03-04 15:21:44,246 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:21:44,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:44,247 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 15:21:44,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:21:44,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:21:44,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:44,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1580573730, now seen corresponding path program 1 times [2025-03-04 15:21:44,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:44,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249878490] [2025-03-04 15:21:44,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:44,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:44,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:21:44,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:21:44,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:44,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:44,268 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:21:44,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:21:44,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:21:44,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:44,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:44,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:21:44,287 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:21:44,287 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-04 15:21:44,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-04 15:21:44,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-04 15:21:44,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-04 15:21:44,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-04 15:21:44,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:21:44,289 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 15:21:44,289 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:21:44,289 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:21:44,314 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:21:44,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 123 transitions, 273 flow [2025-03-04 15:21:44,333 INFO L124 PetriNetUnfolderBase]: 34/225 cut-off events. [2025-03-04 15:21:44,334 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:21:44,335 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 11. Compared 914 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:21:44,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 123 transitions, 273 flow [2025-03-04 15:21:44,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 123 transitions, 273 flow [2025-03-04 15:21:44,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:44,338 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;@589ea100, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:44,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 15:21:44,340 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:44,341 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:21:44,343 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:44,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:44,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:44,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:21:44,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:44,343 INFO L85 PathProgramCache]: Analyzing trace with hash 618069868, now seen corresponding path program 1 times [2025-03-04 15:21:44,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:44,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598239881] [2025-03-04 15:21:44,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:44,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:44,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:44,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:44,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:44,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:44,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:44,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598239881] [2025-03-04 15:21:44,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598239881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:44,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:44,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:44,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469971009] [2025-03-04 15:21:44,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:44,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:44,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:44,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:44,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 123 [2025-03-04 15:21:44,412 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:21:44,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:44,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 123 [2025-03-04 15:21:44,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:53,582 INFO L124 PetriNetUnfolderBase]: 97039/172514 cut-off events. [2025-03-04 15:21:53,583 INFO L125 PetriNetUnfolderBase]: For 2042/2042 co-relation queries the response was YES. [2025-03-04 15:21:53,910 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 3647. Compared 1785364 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:21:54,653 INFO L140 encePairwiseOnDemand]: 97/123 looper letters, 82 selfloop transitions, 3 changer transitions 0/130 dead transitions. [2025-03-04 15:21:54,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 130 transitions, 457 flow [2025-03-04 15:21:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions. [2025-03-04 15:21:54,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-03-04 15:21:54,655 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:21:54,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 130 transitions, 457 flow [2025-03-04 15:21:54,658 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:21:54,659 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 257 flow [2025-03-04 15:21:54,659 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:21:54,659 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2025-03-04 15:21:54,660 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 257 flow [2025-03-04 15:21:54,660 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:21:54,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:54,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:54,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:21:54,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:21:54,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:54,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2135223559, now seen corresponding path program 1 times [2025-03-04 15:21:54,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:54,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148360283] [2025-03-04 15:21:54,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:54,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:54,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:21:54,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:21:54,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:54,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:54,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148360283] [2025-03-04 15:21:54,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148360283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:54,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:54,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:21:54,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741530880] [2025-03-04 15:21:54,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:54,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:21:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:54,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:21:54,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:21:54,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 123 [2025-03-04 15:21:54,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:54,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:54,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 123 [2025-03-04 15:21:54,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:09,116 INFO L124 PetriNetUnfolderBase]: 147779/250918 cut-off events. [2025-03-04 15:22:09,117 INFO L125 PetriNetUnfolderBase]: For 8857/14438 co-relation queries the response was YES. [2025-03-04 15:22:09,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464639 conditions, 250918 events. 147779/250918 cut-off events. For 8857/14438 co-relation queries the response was YES. Maximal size of possible extension queue 5545. Compared 2600954 event pairs, 40828 based on Foata normal form. 4264/236770 useless extension candidates. Maximal degree in co-relation 464532. Up to 125335 conditions per place. [2025-03-04 15:22:10,945 INFO L140 encePairwiseOnDemand]: 111/123 looper letters, 247 selfloop transitions, 26 changer transitions 0/320 dead transitions. [2025-03-04 15:22:10,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 320 transitions, 1334 flow [2025-03-04 15:22:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:22:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:22:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 597 transitions. [2025-03-04 15:22:10,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6933797909407665 [2025-03-04 15:22:10,947 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 257 flow. Second operand 7 states and 597 transitions. [2025-03-04 15:22:10,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 320 transitions, 1334 flow [2025-03-04 15:22:10,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 320 transitions, 1329 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:10,961 INFO L231 Difference]: Finished difference. Result has 123 places, 134 transitions, 457 flow [2025-03-04 15:22:10,961 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=457, PETRI_PLACES=123, PETRI_TRANSITIONS=134} [2025-03-04 15:22:10,962 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 16 predicate places. [2025-03-04 15:22:10,962 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 134 transitions, 457 flow [2025-03-04 15:22:10,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 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:10,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:10,962 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:10,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:22:10,962 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:10,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1827445608, now seen corresponding path program 1 times [2025-03-04 15:22:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:10,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148194082] [2025-03-04 15:22:10,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:10,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:10,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:22:10,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:22:10,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:10,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:11,032 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:11,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:11,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148194082] [2025-03-04 15:22:11,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148194082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:11,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:11,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:22:11,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052902477] [2025-03-04 15:22:11,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:11,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:11,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:11,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:11,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:11,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 123 [2025-03-04 15:22:11,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 134 transitions, 457 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:11,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:11,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 123 [2025-03-04 15:22:11,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand