./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_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_36-indirect_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 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:35:35,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:35:35,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:35:35,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:35:35,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:35:35,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:35:35,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:35:35,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:35:35,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:35:35,196 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:35:35,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:35:35,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:35:35,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:35:35,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:35:35,197 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:35:35,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:35:35,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:35:35,198 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:35:35,199 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:35:35,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:35:35,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:35:35,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:35:35,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:35:35,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:35:35,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:35:35,200 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:35:35,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:35:35,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:35:35,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:35:35,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:35:35,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:35:35,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:35:35,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:35:35,200 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 -> 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 [2025-03-09 06:35:35,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:35:35,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:35:35,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:35:35,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:35:35,417 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:35:35,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2025-03-09 06:35:36,543 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e4f415b/a31ae06fcfaa42398d635dfc3cccaa6b/FLAG0e1e071b0 [2025-03-09 06:35:36,815 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:35:36,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2025-03-09 06:35:36,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e4f415b/a31ae06fcfaa42398d635dfc3cccaa6b/FLAG0e1e071b0 [2025-03-09 06:35:37,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e4f415b/a31ae06fcfaa42398d635dfc3cccaa6b [2025-03-09 06:35:37,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:35:37,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:35:37,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:35:37,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:35:37,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:35:37,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:35:37" (1/1) ... [2025-03-09 06:35:37,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c9f2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37, skipping insertion in model container [2025-03-09 06:35:37,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:35:37" (1/1) ... [2025-03-09 06:35:37,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:35:37,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:35:37,383 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:35:37,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:35:37,459 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:35:37,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37 WrapperNode [2025-03-09 06:35:37,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:35:37,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:35:37,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:35:37,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:35:37,465 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:35:37" (1/1) ... [2025-03-09 06:35:37,473 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:35:37" (1/1) ... [2025-03-09 06:35:37,491 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2025-03-09 06:35:37,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:35:37,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:35:37,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:35:37,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:35:37,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37" (1/1) ... [2025-03-09 06:35:37,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37" (1/1) ... [2025-03-09 06:35:37,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37" (1/1) ... [2025-03-09 06:35:37,517 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 5, 6, 5, 2]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5, 0]. The 3 writes are split as follows [0, 0, 2, 0, 1]. [2025-03-09 06:35:37,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37" (1/1) ... [2025-03-09 06:35:37,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37" (1/1) ... [2025-03-09 06:35:37,522 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37" (1/1) ... [2025-03-09 06:35:37,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37" (1/1) ... [2025-03-09 06:35:37,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37" (1/1) ... [2025-03-09 06:35:37,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37" (1/1) ... [2025-03-09 06:35:37,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:35:37,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:35:37,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:35:37,527 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:35:37,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37" (1/1) ... [2025-03-09 06:35:37,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:35:37,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:35:37,557 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:35:37,561 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:35:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:35:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 06:35:37,578 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 06:35:37,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:35:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:35:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:35:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:35:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 06:35:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 06:35:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:35:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:35:37,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:35:37,580 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:35:37,693 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:35:37,697 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:35:37,874 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-09 06:35:37,876 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-09 06:35:37,926 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:35:37,926 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:35:38,005 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:35:38,005 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:35:38,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:35:38 BoogieIcfgContainer [2025-03-09 06:35:38,006 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:35:38,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:35:38,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:35:38,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:35:38,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:35:37" (1/3) ... [2025-03-09 06:35:38,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c233196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:35:38, skipping insertion in model container [2025-03-09 06:35:38,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:35:37" (2/3) ... [2025-03-09 06:35:38,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c233196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:35:38, skipping insertion in model container [2025-03-09 06:35:38,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:35:38" (3/3) ... [2025-03-09 06:35:38,012 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_36-indirect_racefree.i [2025-03-09 06:35:38,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:35:38,024 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_36-indirect_racefree.i that has 2 procedures, 50 locations, 1 initial locations, 5 loop locations, and 8 error locations. [2025-03-09 06:35:38,025 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:35:38,071 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 06:35:38,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 59 transitions, 125 flow [2025-03-09 06:35:38,130 INFO L124 PetriNetUnfolderBase]: 11/74 cut-off events. [2025-03-09 06:35:38,132 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:35:38,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 74 events. 11/74 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 231 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 50. Up to 4 conditions per place. [2025-03-09 06:35:38,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 59 transitions, 125 flow [2025-03-09 06:35:38,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 58 transitions, 123 flow [2025-03-09 06:35:38,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:35:38,158 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;@473eead1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:35:38,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-09 06:35:38,162 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:35:38,163 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-09 06:35:38,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:35:38,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:38,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:35:38,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:35:38,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:38,168 INFO L85 PathProgramCache]: Analyzing trace with hash 312961339, now seen corresponding path program 1 times [2025-03-09 06:35:38,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:38,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252721185] [2025-03-09 06:35:38,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:38,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:38,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:35:38,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:35:38,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:38,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:38,397 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:35:38,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:38,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252721185] [2025-03-09 06:35:38,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252721185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:38,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:38,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:35:38,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617744726] [2025-03-09 06:35:38,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:38,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:35:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:38,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:35:38,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:35:38,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-09 06:35:38,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:35:38,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:38,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-09 06:35:38,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:35:38,637 INFO L124 PetriNetUnfolderBase]: 132/369 cut-off events. [2025-03-09 06:35:38,638 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:35:38,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 369 events. 132/369 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1768 event pairs, 0 based on Foata normal form. 63/401 useless extension candidates. Maximal degree in co-relation 636. Up to 255 conditions per place. [2025-03-09 06:35:38,642 INFO L140 encePairwiseOnDemand]: 45/59 looper letters, 46 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-03-09 06:35:38,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 247 flow [2025-03-09 06:35:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:35:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:35:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-03-09 06:35:38,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2025-03-09 06:35:38,654 INFO L175 Difference]: Start difference. First operand has 53 places, 58 transitions, 123 flow. Second operand 4 states and 160 transitions. [2025-03-09 06:35:38,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 247 flow [2025-03-09 06:35:38,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:35:38,660 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 113 flow [2025-03-09 06:35:38,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-03-09 06:35:38,663 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-03-09 06:35:38,664 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 113 flow [2025-03-09 06:35:38,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:35:38,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:38,665 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:35:38,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:35:38,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:35:38,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash -942493008, now seen corresponding path program 1 times [2025-03-09 06:35:38,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:38,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790017824] [2025-03-09 06:35:38,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:38,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:35:38,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:35:38,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:38,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:35:38,697 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:35:38,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:35:38,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:35:38,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:38,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:35:38,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:35:38,731 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:35:38,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-09 06:35:38,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-09 06:35:38,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-09 06:35:38,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-09 06:35:38,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-09 06:35:38,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-09 06:35:38,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-09 06:35:38,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-09 06:35:38,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-09 06:35:38,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-09 06:35:38,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-09 06:35:38,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-09 06:35:38,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-09 06:35:38,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:35:38,735 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-09 06:35:38,738 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:35:38,738 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 06:35:38,755 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:35:38,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 91 transitions, 198 flow [2025-03-09 06:35:38,775 INFO L124 PetriNetUnfolderBase]: 21/140 cut-off events. [2025-03-09 06:35:38,776 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 06:35:38,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 140 events. 21/140 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 514 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 89. Up to 6 conditions per place. [2025-03-09 06:35:38,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 91 transitions, 198 flow [2025-03-09 06:35:38,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 91 transitions, 198 flow [2025-03-09 06:35:38,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:35:38,782 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;@473eead1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:35:38,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-09 06:35:38,785 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:35:38,787 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-09 06:35:38,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:35:38,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:38,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:35:38,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:35:38,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:38,788 INFO L85 PathProgramCache]: Analyzing trace with hash 399831924, now seen corresponding path program 1 times [2025-03-09 06:35:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:38,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749398739] [2025-03-09 06:35:38,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:38,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:38,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:35:38,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:35:38,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:38,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:38,856 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:35:38,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:38,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749398739] [2025-03-09 06:35:38,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749398739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:38,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:38,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:35:38,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838946149] [2025-03-09 06:35:38,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:38,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:35:38,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:38,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:35:38,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:35:38,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 91 [2025-03-09 06:35:38,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 91 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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:35:38,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:38,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 91 [2025-03-09 06:35:38,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:35:39,636 INFO L124 PetriNetUnfolderBase]: 4028/8300 cut-off events. [2025-03-09 06:35:39,637 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-09 06:35:39,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14778 conditions, 8300 events. 4028/8300 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 66430 event pairs, 2274 based on Foata normal form. 1267/8745 useless extension candidates. Maximal degree in co-relation 3176. Up to 6374 conditions per place. [2025-03-09 06:35:39,682 INFO L140 encePairwiseOnDemand]: 71/91 looper letters, 64 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2025-03-09 06:35:39,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 102 transitions, 354 flow [2025-03-09 06:35:39,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:35:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:35:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2025-03-09 06:35:39,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6483516483516484 [2025-03-09 06:35:39,684 INFO L175 Difference]: Start difference. First operand has 80 places, 91 transitions, 198 flow. Second operand 4 states and 236 transitions. [2025-03-09 06:35:39,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 102 transitions, 354 flow [2025-03-09 06:35:39,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 102 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:35:39,688 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 194 flow [2025-03-09 06:35:39,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-03-09 06:35:39,689 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 5 predicate places. [2025-03-09 06:35:39,689 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 194 flow [2025-03-09 06:35:39,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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:35:39,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:39,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:35:39,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:35:39,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:35:39,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:39,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2020826327, now seen corresponding path program 1 times [2025-03-09 06:35:39,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:39,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197329856] [2025-03-09 06:35:39,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:39,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:39,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:35:39,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:35:39,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:39,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:39,769 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:35:39,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:39,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197329856] [2025-03-09 06:35:39,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197329856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:39,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:39,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:35:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384941874] [2025-03-09 06:35:39,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:39,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:35:39,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:39,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:35:39,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:35:39,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 91 [2025-03-09 06:35:39,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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:35:39,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:39,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 91 [2025-03-09 06:35:39,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:35:40,441 INFO L124 PetriNetUnfolderBase]: 3761/8088 cut-off events. [2025-03-09 06:35:40,441 INFO L125 PetriNetUnfolderBase]: For 425/757 co-relation queries the response was YES. [2025-03-09 06:35:40,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14557 conditions, 8088 events. 3761/8088 cut-off events. For 425/757 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 66115 event pairs, 1192 based on Foata normal form. 170/7609 useless extension candidates. Maximal degree in co-relation 14457. Up to 5273 conditions per place. [2025-03-09 06:35:40,477 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 95 selfloop transitions, 6 changer transitions 0/138 dead transitions. [2025-03-09 06:35:40,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 138 transitions, 545 flow [2025-03-09 06:35:40,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:35:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:35:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 282 transitions. [2025-03-09 06:35:40,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6197802197802198 [2025-03-09 06:35:40,479 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 194 flow. Second operand 5 states and 282 transitions. [2025-03-09 06:35:40,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 138 transitions, 545 flow [2025-03-09 06:35:40,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 138 transitions, 541 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:35:40,481 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 236 flow [2025-03-09 06:35:40,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2025-03-09 06:35:40,482 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 11 predicate places. [2025-03-09 06:35:40,482 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 236 flow [2025-03-09 06:35:40,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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:35:40,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:40,482 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:35:40,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:35:40,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:35:40,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:40,483 INFO L85 PathProgramCache]: Analyzing trace with hash 807104505, now seen corresponding path program 1 times [2025-03-09 06:35:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:40,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592211613] [2025-03-09 06:35:40,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:40,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:35:40,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:35:40,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:40,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:40,545 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:35:40,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:40,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592211613] [2025-03-09 06:35:40,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592211613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:40,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:40,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:35:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735170211] [2025-03-09 06:35:40,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:40,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:35:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:40,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:35:40,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:35:40,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 91 [2025-03-09 06:35:40,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 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:35:40,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:40,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 91 [2025-03-09 06:35:40,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:35:41,202 INFO L124 PetriNetUnfolderBase]: 3978/7635 cut-off events. [2025-03-09 06:35:41,203 INFO L125 PetriNetUnfolderBase]: For 1382/1382 co-relation queries the response was YES. [2025-03-09 06:35:41,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15716 conditions, 7635 events. 3978/7635 cut-off events. For 1382/1382 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 58898 event pairs, 523 based on Foata normal form. 152/7276 useless extension candidates. Maximal degree in co-relation 14627. Up to 4247 conditions per place. [2025-03-09 06:35:41,237 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 119 selfloop transitions, 6 changer transitions 0/160 dead transitions. [2025-03-09 06:35:41,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 160 transitions, 696 flow [2025-03-09 06:35:41,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:35:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:35:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 321 transitions. [2025-03-09 06:35:41,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5879120879120879 [2025-03-09 06:35:41,240 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 236 flow. Second operand 6 states and 321 transitions. [2025-03-09 06:35:41,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 160 transitions, 696 flow [2025-03-09 06:35:41,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 160 transitions, 696 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:35:41,248 INFO L231 Difference]: Finished difference. Result has 95 places, 83 transitions, 244 flow [2025-03-09 06:35:41,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=95, PETRI_TRANSITIONS=83} [2025-03-09 06:35:41,249 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 15 predicate places. [2025-03-09 06:35:41,250 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 83 transitions, 244 flow [2025-03-09 06:35:41,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 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:35:41,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:41,250 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:35:41,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:35:41,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:35:41,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:41,251 INFO L85 PathProgramCache]: Analyzing trace with hash -749563774, now seen corresponding path program 1 times [2025-03-09 06:35:41,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:41,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536201936] [2025-03-09 06:35:41,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:41,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:35:41,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:35:41,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:41,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:41,299 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:35:41,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:41,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536201936] [2025-03-09 06:35:41,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536201936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:41,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:41,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:35:41,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966705436] [2025-03-09 06:35:41,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:41,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:35:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:41,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:35:41,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:35:41,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 91 [2025-03-09 06:35:41,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 83 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:35:41,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:41,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 91 [2025-03-09 06:35:41,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:35:41,898 INFO L124 PetriNetUnfolderBase]: 3699/7061 cut-off events. [2025-03-09 06:35:41,898 INFO L125 PetriNetUnfolderBase]: For 1999/1999 co-relation queries the response was YES. [2025-03-09 06:35:41,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14989 conditions, 7061 events. 3699/7061 cut-off events. For 1999/1999 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 53280 event pairs, 254 based on Foata normal form. 152/6903 useless extension candidates. Maximal degree in co-relation 13957. Up to 4701 conditions per place. [2025-03-09 06:35:41,940 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 96 selfloop transitions, 6 changer transitions 0/137 dead transitions. [2025-03-09 06:35:41,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 137 transitions, 600 flow [2025-03-09 06:35:41,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:35:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:35:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2025-03-09 06:35:41,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6208791208791209 [2025-03-09 06:35:41,942 INFO L175 Difference]: Start difference. First operand has 95 places, 83 transitions, 244 flow. Second operand 4 states and 226 transitions. [2025-03-09 06:35:41,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 137 transitions, 600 flow [2025-03-09 06:35:41,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 137 transitions, 584 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-09 06:35:41,951 INFO L231 Difference]: Finished difference. Result has 93 places, 83 transitions, 244 flow [2025-03-09 06:35:41,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=93, PETRI_TRANSITIONS=83} [2025-03-09 06:35:41,952 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 13 predicate places. [2025-03-09 06:35:41,952 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 83 transitions, 244 flow [2025-03-09 06:35:41,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:35:41,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:41,953 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 06:35:41,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:35:41,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 06:35:41,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:41,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1223732299, now seen corresponding path program 1 times [2025-03-09 06:35:41,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:41,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917001371] [2025-03-09 06:35:41,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:41,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:41,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:35:41,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:35:41,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:41,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:35:41,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:35:41,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:35:41,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:35:41,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:41,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:35:41,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:35:41,985 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:35:41,986 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-09 06:35:41,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-09 06:35:41,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-09 06:35:41,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-09 06:35:41,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-09 06:35:41,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-09 06:35:41,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-09 06:35:41,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-09 06:35:41,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-09 06:35:41,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-09 06:35:41,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-09 06:35:41,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-09 06:35:41,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-09 06:35:41,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-09 06:35:41,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-09 06:35:41,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-09 06:35:41,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-09 06:35:41,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:35:41,987 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-09 06:35:41,988 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:35:41,988 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 06:35:42,018 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 06:35:42,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 123 transitions, 273 flow [2025-03-09 06:35:42,034 INFO L124 PetriNetUnfolderBase]: 34/225 cut-off events. [2025-03-09 06:35:42,034 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-09 06:35:42,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 225 events. 34/225 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 904 event pairs, 1 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 155. Up to 12 conditions per place. [2025-03-09 06:35:42,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 123 transitions, 273 flow [2025-03-09 06:35:42,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 123 transitions, 273 flow [2025-03-09 06:35:42,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:35:42,040 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;@473eead1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:35:42,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-09 06:35:42,041 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:35:42,041 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-09 06:35:42,042 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:35:42,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:42,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 06:35:42,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:35:42,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:42,042 INFO L85 PathProgramCache]: Analyzing trace with hash 517240269, now seen corresponding path program 1 times [2025-03-09 06:35:42,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:42,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079151338] [2025-03-09 06:35:42,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:42,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:42,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:35:42,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:35:42,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:42,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:42,082 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:35:42,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:42,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079151338] [2025-03-09 06:35:42,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079151338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:42,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:42,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:35:42,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81240571] [2025-03-09 06:35:42,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:42,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:35:42,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:42,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:35:42,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:35:42,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 123 [2025-03-09 06:35:42,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 123 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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:35:42,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:42,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 123 [2025-03-09 06:35:42,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:35:49,325 INFO L124 PetriNetUnfolderBase]: 76325/138029 cut-off events. [2025-03-09 06:35:49,325 INFO L125 PetriNetUnfolderBase]: For 1879/1879 co-relation queries the response was YES. [2025-03-09 06:35:49,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245126 conditions, 138029 events. 76325/138029 cut-off events. For 1879/1879 co-relation queries the response was YES. Maximal size of possible extension queue 3134. Compared 1439413 event pairs, 49600 based on Foata normal form. 22462/147901 useless extension candidates. Maximal degree in co-relation 15953. Up to 105935 conditions per place. [2025-03-09 06:35:50,002 INFO L140 encePairwiseOnDemand]: 97/123 looper letters, 77 selfloop transitions, 3 changer transitions 0/128 dead transitions. [2025-03-09 06:35:50,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 128 transitions, 443 flow [2025-03-09 06:35:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:35:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:35:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 307 transitions. [2025-03-09 06:35:50,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6239837398373984 [2025-03-09 06:35:50,007 INFO L175 Difference]: Start difference. First operand has 107 places, 123 transitions, 273 flow. Second operand 4 states and 307 transitions. [2025-03-09 06:35:50,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 128 transitions, 443 flow [2025-03-09 06:35:50,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 128 transitions, 443 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:35:50,012 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 257 flow [2025-03-09 06:35:50,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2025-03-09 06:35:50,015 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2025-03-09 06:35:50,015 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 257 flow [2025-03-09 06:35:50,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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:35:50,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:50,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:35:50,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:35:50,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:35:50,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:50,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2127448048, now seen corresponding path program 1 times [2025-03-09 06:35:50,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:50,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207592477] [2025-03-09 06:35:50,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:50,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:50,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:35:50,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:35:50,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:50,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:50,103 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:35:50,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:50,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207592477] [2025-03-09 06:35:50,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207592477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:50,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:50,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:35:50,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88233610] [2025-03-09 06:35:50,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:50,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:35:50,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:50,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:35:50,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:35:50,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 123 [2025-03-09 06:35:50,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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:35:50,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:50,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 123 [2025-03-09 06:35:50,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:35:57,519 INFO L124 PetriNetUnfolderBase]: 74926/131591 cut-off events. [2025-03-09 06:35:57,519 INFO L125 PetriNetUnfolderBase]: For 6449/10964 co-relation queries the response was YES. [2025-03-09 06:35:57,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241657 conditions, 131591 events. 74926/131591 cut-off events. For 6449/10964 co-relation queries the response was YES. Maximal size of possible extension queue 3062. Compared 1316951 event pairs, 30365 based on Foata normal form. 1970/124144 useless extension candidates. Maximal degree in co-relation 241556. Up to 96498 conditions per place. [2025-03-09 06:35:58,225 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 133 selfloop transitions, 8 changer transitions 0/191 dead transitions. [2025-03-09 06:35:58,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 191 transitions, 766 flow [2025-03-09 06:35:58,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:35:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:35:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2025-03-09 06:35:58,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6292682926829268 [2025-03-09 06:35:58,226 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 257 flow. Second operand 5 states and 387 transitions. [2025-03-09 06:35:58,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 191 transitions, 766 flow [2025-03-09 06:35:58,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 191 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:35:58,234 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 316 flow [2025-03-09 06:35:58,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=118, PETRI_TRANSITIONS=112} [2025-03-09 06:35:58,235 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 11 predicate places. [2025-03-09 06:35:58,235 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 316 flow [2025-03-09 06:35:58,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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:35:58,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:35:58,236 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:35:58,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:35:58,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:35:58,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:35:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 626786201, now seen corresponding path program 1 times [2025-03-09 06:35:58,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:35:58,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877025515] [2025-03-09 06:35:58,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:35:58,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:35:58,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:35:58,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:35:58,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:35:58,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:35:58,285 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:35:58,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:35:58,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877025515] [2025-03-09 06:35:58,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877025515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:35:58,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:35:58,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:35:58,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401523426] [2025-03-09 06:35:58,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:35:58,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:35:58,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:35:58,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:35:58,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:35:58,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 123 [2025-03-09 06:35:58,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 112 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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:35:58,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:35:58,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 123 [2025-03-09 06:35:58,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:36:06,326 INFO L124 PetriNetUnfolderBase]: 80161/132000 cut-off events. [2025-03-09 06:36:06,326 INFO L125 PetriNetUnfolderBase]: For 31373/31373 co-relation queries the response was YES. [2025-03-09 06:36:06,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273249 conditions, 132000 events. 80161/132000 cut-off events. For 31373/31373 co-relation queries the response was YES. Maximal size of possible extension queue 3017. Compared 1258441 event pairs, 12803 based on Foata normal form. 2120/125786 useless extension candidates. Maximal degree in co-relation 237870. Up to 74968 conditions per place. [2025-03-09 06:36:07,221 INFO L140 encePairwiseOnDemand]: 118/123 looper letters, 160 selfloop transitions, 6 changer transitions 0/214 dead transitions. [2025-03-09 06:36:07,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 214 transitions, 936 flow [2025-03-09 06:36:07,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:36:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:36:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 434 transitions. [2025-03-09 06:36:07,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5880758807588076 [2025-03-09 06:36:07,223 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 316 flow. Second operand 6 states and 434 transitions. [2025-03-09 06:36:07,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 214 transitions, 936 flow [2025-03-09 06:36:07,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 214 transitions, 936 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:36:07,240 INFO L231 Difference]: Finished difference. Result has 122 places, 111 transitions, 324 flow [2025-03-09 06:36:07,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=122, PETRI_TRANSITIONS=111} [2025-03-09 06:36:07,241 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 15 predicate places. [2025-03-09 06:36:07,241 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 111 transitions, 324 flow [2025-03-09 06:36:07,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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:07,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:36:07,241 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:36:07,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:36:07,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 06:36:07,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:36:07,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2044463779, now seen corresponding path program 1 times [2025-03-09 06:36:07,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:36:07,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372725172] [2025-03-09 06:36:07,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:36:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:36:07,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:36:07,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:36:07,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:36:07,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:36:07,282 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:07,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:36:07,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372725172] [2025-03-09 06:36:07,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372725172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:36:07,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:36:07,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:36:07,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345834691] [2025-03-09 06:36:07,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:36:07,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:36:07,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:36:07,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:36:07,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:36:07,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 123 [2025-03-09 06:36:07,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 111 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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:07,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:36:07,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 123 [2025-03-09 06:36:07,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand