./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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_79-equ_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 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:36:28,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:36:28,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:36:28,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:36:28,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:36:28,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:36:28,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:36:28,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:36:28,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:36:28,608 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:36:28,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:36:28,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:36:28,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:36:28,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:36:28,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:36:28,609 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:36:28,610 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:36:28,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:36:28,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:36:28,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:36:28,611 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 -> 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc [2025-03-09 06:36:28,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:36:28,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:36:28,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:36:28,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:36:28,951 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:36:28,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2025-03-09 06:36:30,211 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6907971c/5842bc1b96f34fd2b0ad4ac017c3b19e/FLAG5b5a32c52 [2025-03-09 06:36:30,523 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:36:30,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_79-equ_racefree.i [2025-03-09 06:36:30,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6907971c/5842bc1b96f34fd2b0ad4ac017c3b19e/FLAG5b5a32c52 [2025-03-09 06:36:30,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6907971c/5842bc1b96f34fd2b0ad4ac017c3b19e [2025-03-09 06:36:30,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:36:30,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:36:30,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:36:30,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:36:30,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:36:30,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:36:30" (1/1) ... [2025-03-09 06:36:30,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf05da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:30, skipping insertion in model container [2025-03-09 06:36:30,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:36:30" (1/1) ... [2025-03-09 06:36:30,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:36:30,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:36:30,947 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:36:30,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:36:31,028 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:36:31,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31 WrapperNode [2025-03-09 06:36:31,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:36:31,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:36:31,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:36:31,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:36:31,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (1/1) ... [2025-03-09 06:36:31,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (1/1) ... [2025-03-09 06:36:31,066 INFO L138 Inliner]: procedures = 272, calls = 65, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 230 [2025-03-09 06:36:31,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:36:31,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:36:31,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:36:31,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:36:31,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (1/1) ... [2025-03-09 06:36:31,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (1/1) ... [2025-03-09 06:36:31,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (1/1) ... [2025-03-09 06:36:31,096 INFO L175 MemorySlicer]: Split 35 memory accesses to 4 slices as follows [2, 5, 26, 2]. 74 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 5, 16, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-03-09 06:36:31,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (1/1) ... [2025-03-09 06:36:31,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (1/1) ... [2025-03-09 06:36:31,104 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (1/1) ... [2025-03-09 06:36:31,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (1/1) ... [2025-03-09 06:36:31,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (1/1) ... [2025-03-09 06:36:31,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (1/1) ... [2025-03-09 06:36:31,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:36:31,111 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:36:31,111 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:36:31,111 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:36:31,112 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (1/1) ... [2025-03-09 06:36:31,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:36:31,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:36:31,145 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-09 06:36:31,151 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-09 06:36:31,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:36:31,172 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 06:36:31,172 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 06:36:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:36:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:36:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:36:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 06:36:31,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:36:31,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:36:31,175 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:36:31,330 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:36:31,332 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:36:31,579 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-09 06:36:31,579 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-09 06:36:31,664 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:36:31,664 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:36:31,851 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:36:31,851 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:36:31,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:36:31 BoogieIcfgContainer [2025-03-09 06:36:31,852 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:36:31,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:36:31,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:36:31,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:36:31,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:36:30" (1/3) ... [2025-03-09 06:36:31,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5362d779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:36:31, skipping insertion in model container [2025-03-09 06:36:31,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:31" (2/3) ... [2025-03-09 06:36:31,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5362d779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:36:31, skipping insertion in model container [2025-03-09 06:36:31,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:36:31" (3/3) ... [2025-03-09 06:36:31,859 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_79-equ_racefree.i [2025-03-09 06:36:31,869 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:36:31,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_79-equ_racefree.i that has 2 procedures, 92 locations, 1 initial locations, 10 loop locations, and 16 error locations. [2025-03-09 06:36:31,871 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:36:31,926 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 06:36:31,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 117 transitions, 241 flow [2025-03-09 06:36:32,001 INFO L124 PetriNetUnfolderBase]: 36/164 cut-off events. [2025-03-09 06:36:32,003 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:36:32,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 164 events. 36/164 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 626 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 95. Up to 8 conditions per place. [2025-03-09 06:36:32,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 117 transitions, 241 flow [2025-03-09 06:36:32,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 115 transitions, 237 flow [2025-03-09 06:36:32,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:36:32,028 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;@5f69880f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:36:32,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-09 06:36:32,032 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:36:32,032 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-09 06:36:32,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:36:32,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:32,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:36:32,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:36:32,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash 16795364, now seen corresponding path program 1 times [2025-03-09 06:36:32,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:32,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373896652] [2025-03-09 06:36:32,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:32,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:32,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:36:32,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:36:32,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:32,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:32,293 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-09 06:36:32,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:32,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373896652] [2025-03-09 06:36:32,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373896652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:32,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:32,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:36:32,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566369019] [2025-03-09 06:36:32,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:32,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:36:32,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:32,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:36:32,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:36:32,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-03-09 06:36:32,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 115 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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-09 06:36:32,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:32,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-03-09 06:36:32,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:32,806 INFO L124 PetriNetUnfolderBase]: 869/2651 cut-off events. [2025-03-09 06:36:32,807 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:36:32,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4383 conditions, 2651 events. 869/2651 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21187 event pairs, 748 based on Foata normal form. 448/2785 useless extension candidates. Maximal degree in co-relation 2126. Up to 888 conditions per place. [2025-03-09 06:36:32,821 INFO L140 encePairwiseOnDemand]: 91/117 looper letters, 88 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-09 06:36:32,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 137 transitions, 473 flow [2025-03-09 06:36:32,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:36:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:36:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2025-03-09 06:36:32,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6623931623931624 [2025-03-09 06:36:32,832 INFO L175 Difference]: Start difference. First operand has 95 places, 115 transitions, 237 flow. Second operand 4 states and 310 transitions. [2025-03-09 06:36:32,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 137 transitions, 473 flow [2025-03-09 06:36:32,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 137 transitions, 473 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:36:32,839 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 214 flow [2025-03-09 06:36:32,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-03-09 06:36:32,845 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 3 predicate places. [2025-03-09 06:36:32,845 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 214 flow [2025-03-09 06:36:32,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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-09 06:36:32,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:32,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:36:32,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:36:32,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:36:32,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:32,847 INFO L85 PathProgramCache]: Analyzing trace with hash 16795389, now seen corresponding path program 1 times [2025-03-09 06:36:32,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:32,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816014391] [2025-03-09 06:36:32,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:32,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:32,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:36:32,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:36:32,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:32,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:32,928 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-09 06:36:32,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:32,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816014391] [2025-03-09 06:36:32,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816014391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:32,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:32,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:36:32,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071944447] [2025-03-09 06:36:32,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:32,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:36:32,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:32,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:36:32,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:36:32,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-03-09 06:36:32,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-09 06:36:32,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:32,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-03-09 06:36:32,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:33,213 INFO L124 PetriNetUnfolderBase]: 869/2657 cut-off events. [2025-03-09 06:36:33,214 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-09 06:36:33,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 2657 events. 869/2657 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21251 event pairs, 765 based on Foata normal form. 1/2342 useless extension candidates. Maximal degree in co-relation 2225. Up to 1722 conditions per place. [2025-03-09 06:36:33,227 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 49 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2025-03-09 06:36:33,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 314 flow [2025-03-09 06:36:33,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:36:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:36:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2025-03-09 06:36:33,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5213675213675214 [2025-03-09 06:36:33,231 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 214 flow. Second operand 3 states and 183 transitions. [2025-03-09 06:36:33,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 314 flow [2025-03-09 06:36:33,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:36:33,234 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 211 flow [2025-03-09 06:36:33,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2025-03-09 06:36:33,235 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2025-03-09 06:36:33,236 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 211 flow [2025-03-09 06:36:33,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-09 06:36:33,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:33,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:36:33,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:36:33,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:36:33,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:33,238 INFO L85 PathProgramCache]: Analyzing trace with hash 520657475, now seen corresponding path program 1 times [2025-03-09 06:36:33,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:33,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395811766] [2025-03-09 06:36:33,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:33,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:33,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:36:33,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:36:33,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:33,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:33,304 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-09 06:36:33,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:33,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395811766] [2025-03-09 06:36:33,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395811766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:33,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:33,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:36:33,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040647032] [2025-03-09 06:36:33,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:33,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:36:33,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:33,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:36:33,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:36:33,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-03-09 06:36:33,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-09 06:36:33,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:33,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-03-09 06:36:33,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:33,552 INFO L124 PetriNetUnfolderBase]: 869/2656 cut-off events. [2025-03-09 06:36:33,553 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-09 06:36:33,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4433 conditions, 2656 events. 869/2656 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21218 event pairs, 765 based on Foata normal form. 1/2341 useless extension candidates. Maximal degree in co-relation 2238. Up to 1722 conditions per place. [2025-03-09 06:36:33,564 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 48 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-03-09 06:36:33,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 309 flow [2025-03-09 06:36:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:36:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:36:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2025-03-09 06:36:33,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-03-09 06:36:33,566 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 211 flow. Second operand 3 states and 182 transitions. [2025-03-09 06:36:33,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 309 flow [2025-03-09 06:36:33,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 93 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:36:33,568 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 209 flow [2025-03-09 06:36:33,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2025-03-09 06:36:33,568 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2025-03-09 06:36:33,569 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 209 flow [2025-03-09 06:36:33,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-09 06:36:33,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:33,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:36:33,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:36:33,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:36:33,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:33,570 INFO L85 PathProgramCache]: Analyzing trace with hash 520656744, now seen corresponding path program 1 times [2025-03-09 06:36:33,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:33,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643824974] [2025-03-09 06:36:33,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:33,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:33,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:36:33,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:36:33,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:33,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:33,618 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-09 06:36:33,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:33,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643824974] [2025-03-09 06:36:33,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643824974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:33,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:33,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:36:33,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288975661] [2025-03-09 06:36:33,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:33,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:36:33,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:33,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:36:33,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:36:33,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 117 [2025-03-09 06:36:33,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 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-09 06:36:33,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:33,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 117 [2025-03-09 06:36:33,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:33,970 INFO L124 PetriNetUnfolderBase]: 869/2648 cut-off events. [2025-03-09 06:36:33,970 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-09 06:36:33,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 2648 events. 869/2648 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 21157 event pairs, 748 based on Foata normal form. 1/2334 useless extension candidates. Maximal degree in co-relation 2230. Up to 1663 conditions per place. [2025-03-09 06:36:33,983 INFO L140 encePairwiseOnDemand]: 110/117 looper letters, 52 selfloop transitions, 7 changer transitions 8/109 dead transitions. [2025-03-09 06:36:33,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 109 transitions, 375 flow [2025-03-09 06:36:33,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:36:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:36:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 287 transitions. [2025-03-09 06:36:33,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4905982905982906 [2025-03-09 06:36:33,988 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 209 flow. Second operand 5 states and 287 transitions. [2025-03-09 06:36:33,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 109 transitions, 375 flow [2025-03-09 06:36:33,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:36:33,990 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 217 flow [2025-03-09 06:36:33,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2025-03-09 06:36:33,991 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2025-03-09 06:36:33,991 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 217 flow [2025-03-09 06:36:33,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 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-09 06:36:33,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:33,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:33,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:36:33,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:36:33,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:33,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2090894701, now seen corresponding path program 1 times [2025-03-09 06:36:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:33,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884239073] [2025-03-09 06:36:33,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:33,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:34,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:36:34,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:36:34,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:34,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:34,070 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-09 06:36:34,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:34,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884239073] [2025-03-09 06:36:34,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884239073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:34,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:34,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:36:34,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295180322] [2025-03-09 06:36:34,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:34,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:36:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:34,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:36:34,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:36:34,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 117 [2025-03-09 06:36:34,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-09 06:36:34,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:34,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 117 [2025-03-09 06:36:34,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:34,325 INFO L124 PetriNetUnfolderBase]: 855/2365 cut-off events. [2025-03-09 06:36:34,325 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-09 06:36:34,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4168 conditions, 2365 events. 855/2365 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 18447 event pairs, 0 based on Foata normal form. 36/2166 useless extension candidates. Maximal degree in co-relation 2054. Up to 1602 conditions per place. [2025-03-09 06:36:34,333 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 83 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2025-03-09 06:36:34,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 125 transitions, 455 flow [2025-03-09 06:36:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:36:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:36:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2025-03-09 06:36:34,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-09 06:36:34,338 INFO L175 Difference]: Start difference. First operand has 97 places, 92 transitions, 217 flow. Second operand 4 states and 260 transitions. [2025-03-09 06:36:34,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 125 transitions, 455 flow [2025-03-09 06:36:34,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 125 transitions, 441 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:36:34,344 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 209 flow [2025-03-09 06:36:34,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2025-03-09 06:36:34,345 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2025-03-09 06:36:34,345 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 209 flow [2025-03-09 06:36:34,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-09 06:36:34,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:34,345 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:34,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:36:34,345 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:36:34,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1667798056, now seen corresponding path program 1 times [2025-03-09 06:36:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:34,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650257429] [2025-03-09 06:36:34,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:34,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:34,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:36:34,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:36:34,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:34,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:36:34,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:36:34,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:36:34,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:36:34,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:34,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:36:34,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:36:34,419 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:36:34,420 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-03-09 06:36:34,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2025-03-09 06:36:34,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2025-03-09 06:36:34,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2025-03-09 06:36:34,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:36:34,423 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-09 06:36:34,427 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:36:34,427 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 06:36:34,450 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:36:34,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 162 transitions, 340 flow [2025-03-09 06:36:34,471 INFO L124 PetriNetUnfolderBase]: 60/276 cut-off events. [2025-03-09 06:36:34,472 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 06:36:34,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 276 events. 60/276 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1227 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 166. Up to 12 conditions per place. [2025-03-09 06:36:34,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 162 transitions, 340 flow [2025-03-09 06:36:34,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 161 transitions, 338 flow [2025-03-09 06:36:34,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:36:34,476 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;@5f69880f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:36:34,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-09 06:36:34,478 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:36:34,478 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-09 06:36:34,478 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:36:34,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:34,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:36:34,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 06:36:34,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:34,478 INFO L85 PathProgramCache]: Analyzing trace with hash 21782372, now seen corresponding path program 1 times [2025-03-09 06:36:34,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:34,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082111310] [2025-03-09 06:36:34,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:34,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:34,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:36:34,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:36:34,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:34,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:34,532 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-09 06:36:34,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:34,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082111310] [2025-03-09 06:36:34,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082111310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:34,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:34,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:36:34,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993755366] [2025-03-09 06:36:34,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:34,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:36:34,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:34,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:36:34,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:36:34,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-09 06:36:34,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 161 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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-09 06:36:34,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:34,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-09 06:36:34,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:38,584 INFO L124 PetriNetUnfolderBase]: 31927/66877 cut-off events. [2025-03-09 06:36:38,585 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-03-09 06:36:38,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114556 conditions, 66877 events. 31927/66877 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 2004. Compared 737311 event pairs, 28458 based on Foata normal form. 13069/72579 useless extension candidates. Maximal degree in co-relation 49513. Up to 24438 conditions per place. [2025-03-09 06:36:38,991 INFO L140 encePairwiseOnDemand]: 126/162 looper letters, 128 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2025-03-09 06:36:38,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 193 transitions, 682 flow [2025-03-09 06:36:38,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:36:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:36:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2025-03-09 06:36:38,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6697530864197531 [2025-03-09 06:36:38,993 INFO L175 Difference]: Start difference. First operand has 130 places, 161 transitions, 338 flow. Second operand 4 states and 434 transitions. [2025-03-09 06:36:38,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 193 transitions, 682 flow [2025-03-09 06:36:38,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 193 transitions, 682 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:36:38,997 INFO L231 Difference]: Finished difference. Result has 133 places, 131 transitions, 295 flow [2025-03-09 06:36:38,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=133, PETRI_TRANSITIONS=131} [2025-03-09 06:36:38,997 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-09 06:36:38,998 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 131 transitions, 295 flow [2025-03-09 06:36:38,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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-09 06:36:38,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:38,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:36:38,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:36:38,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 06:36:38,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:38,999 INFO L85 PathProgramCache]: Analyzing trace with hash 21782397, now seen corresponding path program 1 times [2025-03-09 06:36:38,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:38,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599782891] [2025-03-09 06:36:38,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:38,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:39,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:36:39,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:36:39,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:39,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:39,050 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-09 06:36:39,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599782891] [2025-03-09 06:36:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599782891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:39,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:36:39,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210418537] [2025-03-09 06:36:39,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:39,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:36:39,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:39,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:36:39,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:36:39,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-09 06:36:39,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 131 transitions, 295 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-09 06:36:39,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:39,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-09 06:36:39,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:42,407 INFO L124 PetriNetUnfolderBase]: 31941/67149 cut-off events. [2025-03-09 06:36:42,408 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-03-09 06:36:42,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115933 conditions, 67149 events. 31941/67149 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 2006. Compared 742209 event pairs, 29104 based on Foata normal form. 1/59648 useless extension candidates. Maximal degree in co-relation 58585. Up to 47500 conditions per place. [2025-03-09 06:36:42,775 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 69 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2025-03-09 06:36:42,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 130 transitions, 435 flow [2025-03-09 06:36:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:36:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:36:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-03-09 06:36:42,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5164609053497943 [2025-03-09 06:36:42,778 INFO L175 Difference]: Start difference. First operand has 133 places, 131 transitions, 295 flow. Second operand 3 states and 251 transitions. [2025-03-09 06:36:42,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 130 transitions, 435 flow [2025-03-09 06:36:42,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 130 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:36:42,782 INFO L231 Difference]: Finished difference. Result has 132 places, 130 transitions, 292 flow [2025-03-09 06:36:42,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=132, PETRI_TRANSITIONS=130} [2025-03-09 06:36:42,783 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-09 06:36:42,783 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 130 transitions, 292 flow [2025-03-09 06:36:42,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-09 06:36:42,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:42,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:36:42,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:36:42,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 06:36:42,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 675254885, now seen corresponding path program 1 times [2025-03-09 06:36:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:42,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011859111] [2025-03-09 06:36:42,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:42,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:36:42,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:36:42,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:42,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:42,830 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-09 06:36:42,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:42,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011859111] [2025-03-09 06:36:42,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011859111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:42,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:42,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:36:42,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49239877] [2025-03-09 06:36:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:42,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:36:42,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:42,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:36:42,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:36:42,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-09 06:36:42,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 130 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-09 06:36:42,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:42,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-09 06:36:42,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:46,283 INFO L124 PetriNetUnfolderBase]: 31941/67148 cut-off events. [2025-03-09 06:36:46,283 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-03-09 06:36:46,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115570 conditions, 67148 events. 31941/67148 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 2006. Compared 742032 event pairs, 29104 based on Foata normal form. 1/59647 useless extension candidates. Maximal degree in co-relation 58598. Up to 47500 conditions per place. [2025-03-09 06:36:46,629 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 68 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2025-03-09 06:36:46,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 129 transitions, 430 flow [2025-03-09 06:36:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:36:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:36:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-03-09 06:36:46,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51440329218107 [2025-03-09 06:36:46,631 INFO L175 Difference]: Start difference. First operand has 132 places, 130 transitions, 292 flow. Second operand 3 states and 250 transitions. [2025-03-09 06:36:46,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 129 transitions, 430 flow [2025-03-09 06:36:46,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:36:46,634 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 290 flow [2025-03-09 06:36:46,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2025-03-09 06:36:46,635 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 1 predicate places. [2025-03-09 06:36:46,635 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 290 flow [2025-03-09 06:36:46,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-09 06:36:46,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:46,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:36:46,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:36:46,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 06:36:46,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash 675254154, now seen corresponding path program 1 times [2025-03-09 06:36:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:46,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685377168] [2025-03-09 06:36:46,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:46,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:46,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:36:46,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:36:46,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:46,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:46,684 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-09 06:36:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:46,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685377168] [2025-03-09 06:36:46,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685377168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:46,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:46,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:36:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099832879] [2025-03-09 06:36:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:46,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:36:46,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:46,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:36:46,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:36:46,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-09 06:36:46,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 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-09 06:36:46,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:46,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-09 06:36:46,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:50,224 INFO L124 PetriNetUnfolderBase]: 31927/66874 cut-off events. [2025-03-09 06:36:50,224 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-03-09 06:36:50,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115282 conditions, 66874 events. 31927/66874 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 2004. Compared 737098 event pairs, 28458 based on Foata normal form. 1/59420 useless extension candidates. Maximal degree in co-relation 58310. Up to 46091 conditions per place. [2025-03-09 06:36:50,557 INFO L140 encePairwiseOnDemand]: 155/162 looper letters, 97 selfloop transitions, 7 changer transitions 0/162 dead transitions. [2025-03-09 06:36:50,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 162 transitions, 564 flow [2025-03-09 06:36:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:36:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:36:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions. [2025-03-09 06:36:50,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49876543209876545 [2025-03-09 06:36:50,559 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 290 flow. Second operand 5 states and 404 transitions. [2025-03-09 06:36:50,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 162 transitions, 564 flow [2025-03-09 06:36:50,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 162 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:36:50,562 INFO L231 Difference]: Finished difference. Result has 132 places, 128 transitions, 298 flow [2025-03-09 06:36:50,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=132, PETRI_TRANSITIONS=128} [2025-03-09 06:36:50,563 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2025-03-09 06:36:50,563 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 298 flow [2025-03-09 06:36:50,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 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-09 06:36:50,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:50,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:50,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:36:50,564 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 06:36:50,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:50,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1090511166, now seen corresponding path program 1 times [2025-03-09 06:36:50,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:50,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072589556] [2025-03-09 06:36:50,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:50,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:50,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:36:50,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:36:50,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:50,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:50,616 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-09 06:36:50,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:50,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072589556] [2025-03-09 06:36:50,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072589556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:50,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:50,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:36:50,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883635916] [2025-03-09 06:36:50,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:50,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:36:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:50,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:36:50,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:36:50,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-09 06:36:50,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 128 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 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-09 06:36:50,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:50,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-09 06:36:50,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:54,420 INFO L124 PetriNetUnfolderBase]: 34858/70183 cut-off events. [2025-03-09 06:36:54,420 INFO L125 PetriNetUnfolderBase]: For 1248/1248 co-relation queries the response was YES. [2025-03-09 06:36:54,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124089 conditions, 70183 events. 34858/70183 cut-off events. For 1248/1248 co-relation queries the response was YES. Maximal size of possible extension queue 1993. Compared 753639 event pairs, 17757 based on Foata normal form. 36/62461 useless extension candidates. Maximal degree in co-relation 59858. Up to 52150 conditions per place. [2025-03-09 06:36:54,942 INFO L140 encePairwiseOnDemand]: 156/162 looper letters, 107 selfloop transitions, 3 changer transitions 0/165 dead transitions. [2025-03-09 06:36:54,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 165 transitions, 592 flow [2025-03-09 06:36:54,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:36:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:36:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2025-03-09 06:36:54,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-03-09 06:36:54,944 INFO L175 Difference]: Start difference. First operand has 132 places, 128 transitions, 298 flow. Second operand 4 states and 348 transitions. [2025-03-09 06:36:54,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 165 transitions, 592 flow [2025-03-09 06:36:54,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 165 transitions, 578 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:36:54,972 INFO L231 Difference]: Finished difference. Result has 133 places, 130 transitions, 308 flow [2025-03-09 06:36:54,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=133, PETRI_TRANSITIONS=130} [2025-03-09 06:36:54,972 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 3 predicate places. [2025-03-09 06:36:54,972 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 130 transitions, 308 flow [2025-03-09 06:36:54,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 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-09 06:36:54,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:54,973 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:54,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:36:54,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 06:36:54,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:54,973 INFO L85 PathProgramCache]: Analyzing trace with hash 71149887, now seen corresponding path program 1 times [2025-03-09 06:36:54,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:54,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214821017] [2025-03-09 06:36:54,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:54,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:54,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:36:54,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:36:54,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:54,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:55,038 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-09 06:36:55,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:55,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214821017] [2025-03-09 06:36:55,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214821017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:55,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:55,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:36:55,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28852600] [2025-03-09 06:36:55,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:55,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:36:55,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:55,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:36:55,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:36:55,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-09 06:36:55,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 130 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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-09 06:36:55,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:55,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-09 06:36:55,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:58,734 INFO L124 PetriNetUnfolderBase]: 33941/66342 cut-off events. [2025-03-09 06:36:58,734 INFO L125 PetriNetUnfolderBase]: For 2896/2896 co-relation queries the response was YES. [2025-03-09 06:36:58,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120908 conditions, 66342 events. 33941/66342 cut-off events. For 2896/2896 co-relation queries the response was YES. Maximal size of possible extension queue 1956. Compared 697848 event pairs, 4820 based on Foata normal form. 648/61170 useless extension candidates. Maximal degree in co-relation 58652. Up to 41665 conditions per place. [2025-03-09 06:36:59,081 INFO L140 encePairwiseOnDemand]: 157/162 looper letters, 171 selfloop transitions, 6 changer transitions 0/232 dead transitions. [2025-03-09 06:36:59,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 232 transitions, 864 flow [2025-03-09 06:36:59,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:36:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:36:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2025-03-09 06:36:59,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2025-03-09 06:36:59,083 INFO L175 Difference]: Start difference. First operand has 133 places, 130 transitions, 308 flow. Second operand 6 states and 531 transitions. [2025-03-09 06:36:59,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 232 transitions, 864 flow [2025-03-09 06:36:59,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 232 transitions, 862 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:36:59,089 INFO L231 Difference]: Finished difference. Result has 136 places, 129 transitions, 314 flow [2025-03-09 06:36:59,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=136, PETRI_TRANSITIONS=129} [2025-03-09 06:36:59,089 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places. [2025-03-09 06:36:59,090 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 129 transitions, 314 flow [2025-03-09 06:36:59,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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-09 06:36:59,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:59,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:36:59,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:36:59,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 06:36:59,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1614385315, now seen corresponding path program 1 times [2025-03-09 06:36:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:59,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657974444] [2025-03-09 06:36:59,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:59,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:59,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:36:59,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:36:59,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:59,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:59,150 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-09 06:36:59,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:59,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657974444] [2025-03-09 06:36:59,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657974444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:59,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:59,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:36:59,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203307438] [2025-03-09 06:36:59,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:59,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:36:59,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:59,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:36:59,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:36:59,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 162 [2025-03-09 06:36:59,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 129 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 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-09 06:36:59,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:59,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 162 [2025-03-09 06:36:59,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:37:04,333 INFO L124 PetriNetUnfolderBase]: 46385/94447 cut-off events. [2025-03-09 06:37:04,333 INFO L125 PetriNetUnfolderBase]: For 6340/7200 co-relation queries the response was YES. [2025-03-09 06:37:04,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170674 conditions, 94447 events. 46385/94447 cut-off events. For 6340/7200 co-relation queries the response was YES. Maximal size of possible extension queue 3002. Compared 1072133 event pairs, 16289 based on Foata normal form. 1114/86800 useless extension candidates. Maximal degree in co-relation 81952. Up to 44124 conditions per place. [2025-03-09 06:37:04,805 INFO L140 encePairwiseOnDemand]: 150/162 looper letters, 207 selfloop transitions, 16 changer transitions 0/279 dead transitions. [2025-03-09 06:37:04,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 279 transitions, 1126 flow [2025-03-09 06:37:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:37:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:37:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 520 transitions. [2025-03-09 06:37:04,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2025-03-09 06:37:04,806 INFO L175 Difference]: Start difference. First operand has 136 places, 129 transitions, 314 flow. Second operand 5 states and 520 transitions. [2025-03-09 06:37:04,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 279 transitions, 1126 flow [2025-03-09 06:37:04,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 279 transitions, 1103 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-09 06:37:04,813 INFO L231 Difference]: Finished difference. Result has 140 places, 144 transitions, 430 flow [2025-03-09 06:37:04,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=430, PETRI_PLACES=140, PETRI_TRANSITIONS=144} [2025-03-09 06:37:04,813 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 10 predicate places. [2025-03-09 06:37:04,814 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 144 transitions, 430 flow [2025-03-09 06:37:04,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 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-09 06:37:04,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:37:04,814 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:37:04,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:37:04,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 06:37:04,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:37:04,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2075834161, now seen corresponding path program 1 times [2025-03-09 06:37:04,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:37:04,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32657597] [2025-03-09 06:37:04,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:37:04,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:37:04,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:37:04,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:37:04,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:37:04,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:37:04,861 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-09 06:37:04,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:37:04,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32657597] [2025-03-09 06:37:04,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32657597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:37:04,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:37:04,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:37:04,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679288316] [2025-03-09 06:37:04,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:37:04,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:37:04,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:37:04,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:37:04,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:37:04,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2025-03-09 06:37:04,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 144 transitions, 430 flow. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 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-09 06:37:04,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:37:04,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2025-03-09 06:37:04,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand