./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.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 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:22:12,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:22:12,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:22:12,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:22:12,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:22:12,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:22:12,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:22:12,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:22:12,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:22:12,234 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:22:12,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:22:12,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:22:12,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:22:12,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:22:12,236 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:22:12,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:22:12,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:22:12,236 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:22:12,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:22:12,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:22:12,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:22:12,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:22:12,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:22:12,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:22:12,237 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:22:12,237 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:22:12,237 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:22:12,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:22:12,237 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:22:12,237 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:22:12,237 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:22:12,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:22:12,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:22:12,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:22:12,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:12,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:22:12,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:22:12,239 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:22:12,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:22:12,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:22:12,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:22:12,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:22:12,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:22:12,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:22:12,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:22:12,239 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 -> 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 [2025-03-04 15:22:12,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:22:12,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:22:12,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:22:12,520 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:22:12,521 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:22:12,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2025-03-04 15:22:13,736 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ed9793f/a83fd5bbb1d74b179bf0ce3ef34582cc/FLAG1fa1b098c [2025-03-04 15:22:14,003 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:22:14,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2025-03-04 15:22:14,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ed9793f/a83fd5bbb1d74b179bf0ce3ef34582cc/FLAG1fa1b098c [2025-03-04 15:22:14,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ed9793f/a83fd5bbb1d74b179bf0ce3ef34582cc [2025-03-04 15:22:14,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:22:14,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:22:14,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:14,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:22:14,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:22:14,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a292954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14, skipping insertion in model container [2025-03-04 15:22:14,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:22:14,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:14,604 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:22:14,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:14,679 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:22:14,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14 WrapperNode [2025-03-04 15:22:14,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:14,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:14,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:22:14,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:22:14,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,716 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2025-03-04 15:22:14,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:14,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:22:14,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:22:14,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:22:14,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,736 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 5, 6, 5, 2]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5, 0]. The 3 writes are split as follows [0, 0, 2, 0, 1]. [2025-03-04 15:22:14,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:22:14,746 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:22:14,746 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:22:14,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:22:14,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (1/1) ... [2025-03-04 15:22:14,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:14,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:14,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:22:14,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:22:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:22:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:22:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:22:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:22:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:22:14,793 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:22:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:22:14,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:22:14,794 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:22:14,902 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:22:14,904 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:22:15,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:22:15,054 INFO L1325 $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-04 15:22:15,110 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:22:15,110 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:22:15,234 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:22:15,234 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:22:15,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:15 BoogieIcfgContainer [2025-03-04 15:22:15,235 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:22:15,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:22:15,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:22:15,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:22:15,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:22:14" (1/3) ... [2025-03-04 15:22:15,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5072aa9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:15, skipping insertion in model container [2025-03-04 15:22:15,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:14" (2/3) ... [2025-03-04 15:22:15,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5072aa9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:15, skipping insertion in model container [2025-03-04 15:22:15,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:15" (3/3) ... [2025-03-04 15:22:15,243 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_37-indirect_racing.i [2025-03-04 15:22:15,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:22:15,255 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_37-indirect_racing.i that has 2 procedures, 47 locations, 1 initial locations, 5 loop locations, and 8 error locations. [2025-03-04 15:22:15,255 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:22:15,298 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:22:15,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 56 transitions, 119 flow [2025-03-04 15:22:15,348 INFO L124 PetriNetUnfolderBase]: 11/68 cut-off events. [2025-03-04 15:22:15,351 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:15,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 68 events. 11/68 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 197 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2025-03-04 15:22:15,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 56 transitions, 119 flow [2025-03-04 15:22:15,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 55 transitions, 117 flow [2025-03-04 15:22:15,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:15,376 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;@2c8601ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:15,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 15:22:15,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:15,381 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:22:15,381 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:15,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:15,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:15,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:22:15,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:15,385 INFO L85 PathProgramCache]: Analyzing trace with hash 285269596, now seen corresponding path program 1 times [2025-03-04 15:22:15,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:15,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347691737] [2025-03-04 15:22:15,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:15,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:15,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:15,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:15,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:15,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:15,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347691737] [2025-03-04 15:22:15,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347691737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:15,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:15,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:15,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400029858] [2025-03-04 15:22:15,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:15,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:15,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:15,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:15,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:15,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-04 15:22:15,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 55 transitions, 117 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-04 15:22:15,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:15,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-04 15:22:15,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:15,852 INFO L124 PetriNetUnfolderBase]: 99/328 cut-off events. [2025-03-04 15:22:15,853 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:22:15,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 328 events. 99/328 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1548 event pairs, 42 based on Foata normal form. 54/344 useless extension candidates. Maximal degree in co-relation 531. Up to 186 conditions per place. [2025-03-04 15:22:15,857 INFO L140 encePairwiseOnDemand]: 42/56 looper letters, 43 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-03-04 15:22:15,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 235 flow [2025-03-04 15:22:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:15,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-03-04 15:22:15,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7008928571428571 [2025-03-04 15:22:15,868 INFO L175 Difference]: Start difference. First operand has 50 places, 55 transitions, 117 flow. Second operand 4 states and 157 transitions. [2025-03-04 15:22:15,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 235 flow [2025-03-04 15:22:15,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 235 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:15,874 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 107 flow [2025-03-04 15:22:15,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2025-03-04 15:22:15,881 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-04 15:22:15,881 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 107 flow [2025-03-04 15:22:15,881 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-04 15:22:15,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:15,881 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:15,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:22:15,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:22:15,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:15,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1273518626, now seen corresponding path program 1 times [2025-03-04 15:22:15,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:15,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138494489] [2025-03-04 15:22:15,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:15,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:15,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:22:15,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:22:15,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:15,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:15,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:15,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:22:15,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:22:15,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:15,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:15,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:15,943 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:15,947 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 15:22:15,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-04 15:22:15,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-04 15:22:15,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-04 15:22:15,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-04 15:22:15,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-04 15:22:15,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-04 15:22:15,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-04 15:22:15,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-04 15:22:15,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-04 15:22:15,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-04 15:22:15,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-04 15:22:15,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-04 15:22:15,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:22:15,950 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 15:22:15,952 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:15,952 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:22:15,976 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:22:15,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 88 transitions, 192 flow [2025-03-04 15:22:15,994 INFO L124 PetriNetUnfolderBase]: 21/131 cut-off events. [2025-03-04 15:22:15,995 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:22:15,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 131 events. 21/131 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 476 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 86. Up to 6 conditions per place. [2025-03-04 15:22:15,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 88 transitions, 192 flow [2025-03-04 15:22:15,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 88 transitions, 192 flow [2025-03-04 15:22:15,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:15,998 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;@2c8601ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:15,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 15:22:16,000 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:16,001 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:22:16,001 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:16,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:16,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:16,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:22:16,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash 369277266, now seen corresponding path program 1 times [2025-03-04 15:22:16,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:16,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233099860] [2025-03-04 15:22:16,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:16,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:16,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:16,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:16,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:16,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:16,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:16,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233099860] [2025-03-04 15:22:16,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233099860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:16,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:16,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:16,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321886817] [2025-03-04 15:22:16,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:16,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:16,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:16,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:16,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:16,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 88 [2025-03-04 15:22:16,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 88 transitions, 192 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-04 15:22:16,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:16,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 88 [2025-03-04 15:22:16,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:16,825 INFO L124 PetriNetUnfolderBase]: 3203/7067 cut-off events. [2025-03-04 15:22:16,825 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-03-04 15:22:16,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12252 conditions, 7067 events. 3203/7067 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 59210 event pairs, 1496 based on Foata normal form. 1076/7329 useless extension candidates. Maximal degree in co-relation 976. Up to 5081 conditions per place. [2025-03-04 15:22:16,872 INFO L140 encePairwiseOnDemand]: 68/88 looper letters, 61 selfloop transitions, 3 changer transitions 0/99 dead transitions. [2025-03-04 15:22:16,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 99 transitions, 342 flow [2025-03-04 15:22:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-03-04 15:22:16,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6619318181818182 [2025-03-04 15:22:16,876 INFO L175 Difference]: Start difference. First operand has 77 places, 88 transitions, 192 flow. Second operand 4 states and 233 transitions. [2025-03-04 15:22:16,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 99 transitions, 342 flow [2025-03-04 15:22:16,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 99 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:16,880 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 188 flow [2025-03-04 15:22:16,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2025-03-04 15:22:16,881 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-03-04 15:22:16,881 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 188 flow [2025-03-04 15:22:16,882 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-04 15:22:16,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:16,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:16,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:22:16,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:22:16,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2101841669, now seen corresponding path program 1 times [2025-03-04 15:22:16,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:16,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525214937] [2025-03-04 15:22:16,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:16,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:16,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:16,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:16,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:16,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:17,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:17,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525214937] [2025-03-04 15:22:17,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525214937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:17,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:17,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:17,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678136079] [2025-03-04 15:22:17,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:17,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:17,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:17,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:17,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:17,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 88 [2025-03-04 15:22:17,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 188 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-04 15:22:17,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:17,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 88 [2025-03-04 15:22:17,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:17,628 INFO L124 PetriNetUnfolderBase]: 2816/6164 cut-off events. [2025-03-04 15:22:17,628 INFO L125 PetriNetUnfolderBase]: For 425/758 co-relation queries the response was YES. [2025-03-04 15:22:17,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11156 conditions, 6164 events. 2816/6164 cut-off events. For 425/758 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 50029 event pairs, 911 based on Foata normal form. 132/5733 useless extension candidates. Maximal degree in co-relation 11056. Up to 3985 conditions per place. [2025-03-04 15:22:17,659 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 83 selfloop transitions, 6 changer transitions 0/126 dead transitions. [2025-03-04 15:22:17,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 126 transitions, 497 flow [2025-03-04 15:22:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:22:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:22:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 270 transitions. [2025-03-04 15:22:17,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-03-04 15:22:17,662 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 188 flow. Second operand 5 states and 270 transitions. [2025-03-04 15:22:17,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 126 transitions, 497 flow [2025-03-04 15:22:17,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 126 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:17,667 INFO L231 Difference]: Finished difference. Result has 88 places, 81 transitions, 230 flow [2025-03-04 15:22:17,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=88, PETRI_TRANSITIONS=81} [2025-03-04 15:22:17,668 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 11 predicate places. [2025-03-04 15:22:17,668 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 81 transitions, 230 flow [2025-03-04 15:22:17,669 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-04 15:22:17,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:17,669 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:17,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:22:17,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:22:17,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:17,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1448723529, now seen corresponding path program 1 times [2025-03-04 15:22:17,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:17,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744799301] [2025-03-04 15:22:17,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:17,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:17,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:22:17,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:22:17,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:17,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:17,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744799301] [2025-03-04 15:22:17,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744799301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:17,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:17,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:22:17,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430551352] [2025-03-04 15:22:17,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:17,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:17,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:17,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:17,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 88 [2025-03-04 15:22:17,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 81 transitions, 230 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-04 15:22:17,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:17,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 88 [2025-03-04 15:22:17,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:18,392 INFO L124 PetriNetUnfolderBase]: 3108/6353 cut-off events. [2025-03-04 15:22:18,393 INFO L125 PetriNetUnfolderBase]: For 1333/1333 co-relation queries the response was YES. [2025-03-04 15:22:18,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12892 conditions, 6353 events. 3108/6353 cut-off events. For 1333/1333 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 49869 event pairs, 377 based on Foata normal form. 152/5986 useless extension candidates. Maximal degree in co-relation 11957. Up to 2885 conditions per place. [2025-03-04 15:22:18,432 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 116 selfloop transitions, 6 changer transitions 0/157 dead transitions. [2025-03-04 15:22:18,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 157 transitions, 684 flow [2025-03-04 15:22:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 318 transitions. [2025-03-04 15:22:18,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2025-03-04 15:22:18,433 INFO L175 Difference]: Start difference. First operand has 88 places, 81 transitions, 230 flow. Second operand 6 states and 318 transitions. [2025-03-04 15:22:18,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 157 transitions, 684 flow [2025-03-04 15:22:18,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 157 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:18,440 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 238 flow [2025-03-04 15:22:18,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2025-03-04 15:22:18,441 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 15 predicate places. [2025-03-04 15:22:18,441 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 238 flow [2025-03-04 15:22:18,441 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-04 15:22:18,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:18,441 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:22:18,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:22:18,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:22:18,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:18,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1960756126, now seen corresponding path program 1 times [2025-03-04 15:22:18,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:18,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145585933] [2025-03-04 15:22:18,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:18,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:18,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:22:18,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:22:18,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:18,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:18,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:18,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145585933] [2025-03-04 15:22:18,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145585933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:18,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:18,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:18,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446556976] [2025-03-04 15:22:18,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:18,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:18,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:18,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:18,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:18,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 88 [2025-03-04 15:22:18,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 238 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-04 15:22:18,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:18,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 88 [2025-03-04 15:22:18,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:18,926 INFO L124 PetriNetUnfolderBase]: 2829/5691 cut-off events. [2025-03-04 15:22:18,926 INFO L125 PetriNetUnfolderBase]: For 1824/1824 co-relation queries the response was YES. [2025-03-04 15:22:18,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12053 conditions, 5691 events. 2829/5691 cut-off events. For 1824/1824 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 42942 event pairs, 253 based on Foata normal form. 152/5529 useless extension candidates. Maximal degree in co-relation 11219. Up to 3339 conditions per place. [2025-03-04 15:22:18,948 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 93 selfloop transitions, 6 changer transitions 0/134 dead transitions. [2025-03-04 15:22:18,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 134 transitions, 588 flow [2025-03-04 15:22:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2025-03-04 15:22:18,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6335227272727273 [2025-03-04 15:22:18,950 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 238 flow. Second operand 4 states and 223 transitions. [2025-03-04 15:22:18,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 134 transitions, 588 flow [2025-03-04 15:22:18,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 134 transitions, 572 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:22:18,958 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 238 flow [2025-03-04 15:22:18,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2025-03-04 15:22:18,958 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-03-04 15:22:18,958 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 80 transitions, 238 flow [2025-03-04 15:22:18,959 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-04 15:22:18,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:18,959 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 15:22:18,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:22:18,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:22:18,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:18,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1204018201, now seen corresponding path program 1 times [2025-03-04 15:22:18,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:18,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865810003] [2025-03-04 15:22:18,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:18,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:18,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:22:18,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:22:18,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:18,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:18,979 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:18,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:22:18,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:22:18,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:18,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:18,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:18,999 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-04 15:22:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-04 15:22:19,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-04 15:22:19,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:22:19,000 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 15:22:19,000 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:19,000 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:22:19,030 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:22:19,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 120 transitions, 267 flow [2025-03-04 15:22:19,045 INFO L124 PetriNetUnfolderBase]: 34/213 cut-off events. [2025-03-04 15:22:19,045 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:22:19,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 213 events. 34/213 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 859 event pairs, 1 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 146. Up to 12 conditions per place. [2025-03-04 15:22:19,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 120 transitions, 267 flow [2025-03-04 15:22:19,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 120 transitions, 267 flow [2025-03-04 15:22:19,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:19,048 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;@2c8601ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:19,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 15:22:19,050 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:19,050 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:22:19,050 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:19,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:19,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:19,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:22:19,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:19,051 INFO L85 PathProgramCache]: Analyzing trace with hash 483822696, now seen corresponding path program 1 times [2025-03-04 15:22:19,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:19,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920541131] [2025-03-04 15:22:19,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:19,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:19,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:19,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:19,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:19,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:19,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:19,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920541131] [2025-03-04 15:22:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920541131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:19,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:19,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:19,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536229279] [2025-03-04 15:22:19,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:19,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:19,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:19,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:19,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 120 [2025-03-04 15:22:19,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 120 transitions, 267 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-04 15:22:19,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:19,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 120 [2025-03-04 15:22:19,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:25,747 INFO L124 PetriNetUnfolderBase]: 61547/112415 cut-off events. [2025-03-04 15:22:25,747 INFO L125 PetriNetUnfolderBase]: For 1911/1911 co-relation queries the response was YES. [2025-03-04 15:22:25,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199190 conditions, 112415 events. 61547/112415 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 2775. Compared 1169607 event pairs, 39796 based on Foata normal form. 18616/119493 useless extension candidates. Maximal degree in co-relation 13322. Up to 85613 conditions per place. [2025-03-04 15:22:26,333 INFO L140 encePairwiseOnDemand]: 94/120 looper letters, 74 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2025-03-04 15:22:26,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 125 transitions, 431 flow [2025-03-04 15:22:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 304 transitions. [2025-03-04 15:22:26,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-04 15:22:26,335 INFO L175 Difference]: Start difference. First operand has 104 places, 120 transitions, 267 flow. Second operand 4 states and 304 transitions. [2025-03-04 15:22:26,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 125 transitions, 431 flow [2025-03-04 15:22:26,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 125 transitions, 431 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:26,339 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 251 flow [2025-03-04 15:22:26,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2025-03-04 15:22:26,342 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 5 predicate places. [2025-03-04 15:22:26,342 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 251 flow [2025-03-04 15:22:26,342 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-04 15:22:26,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:26,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:26,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:22:26,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:22:26,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash -348865637, now seen corresponding path program 1 times [2025-03-04 15:22:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:26,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407292550] [2025-03-04 15:22:26,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:26,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:26,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:26,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:26,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:26,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:26,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:26,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407292550] [2025-03-04 15:22:26,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407292550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:26,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:26,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:26,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297216693] [2025-03-04 15:22:26,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:26,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:26,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:26,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:26,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:26,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 120 [2025-03-04 15:22:26,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 251 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-04 15:22:26,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:26,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 120 [2025-03-04 15:22:26,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:32,121 INFO L124 PetriNetUnfolderBase]: 56914/100656 cut-off events. [2025-03-04 15:22:32,121 INFO L125 PetriNetUnfolderBase]: For 6449/10964 co-relation queries the response was YES. [2025-03-04 15:22:32,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185994 conditions, 100656 events. 56914/100656 cut-off events. For 6449/10964 co-relation queries the response was YES. Maximal size of possible extension queue 2642. Compared 1002425 event pairs, 23513 based on Foata normal form. 1507/94063 useless extension candidates. Maximal degree in co-relation 185893. Up to 73664 conditions per place. [2025-03-04 15:22:32,725 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 121 selfloop transitions, 8 changer transitions 0/179 dead transitions. [2025-03-04 15:22:32,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 179 transitions, 718 flow [2025-03-04 15:22:32,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:22:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:22:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 375 transitions. [2025-03-04 15:22:32,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-04 15:22:32,727 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 251 flow. Second operand 5 states and 375 transitions. [2025-03-04 15:22:32,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 179 transitions, 718 flow [2025-03-04 15:22:32,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 179 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:32,736 INFO L231 Difference]: Finished difference. Result has 115 places, 109 transitions, 310 flow [2025-03-04 15:22:32,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=115, PETRI_TRANSITIONS=109} [2025-03-04 15:22:32,737 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 11 predicate places. [2025-03-04 15:22:32,737 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 109 transitions, 310 flow [2025-03-04 15:22:32,737 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-04 15:22:32,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:32,737 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:32,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:22:32,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:22:32,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:32,737 INFO L85 PathProgramCache]: Analyzing trace with hash 698136951, now seen corresponding path program 1 times [2025-03-04 15:22:32,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:32,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167119661] [2025-03-04 15:22:32,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:32,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:32,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:22:32,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:22:32,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:32,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:32,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:32,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167119661] [2025-03-04 15:22:32,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167119661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:32,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:32,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:22:32,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756354410] [2025-03-04 15:22:32,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:32,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:32,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:32,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:32,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:32,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 120 [2025-03-04 15:22:32,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 109 transitions, 310 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-04 15:22:32,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:32,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 120 [2025-03-04 15:22:32,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:39,741 INFO L124 PetriNetUnfolderBase]: 63306/105537 cut-off events. [2025-03-04 15:22:39,742 INFO L125 PetriNetUnfolderBase]: For 25220/25220 co-relation queries the response was YES. [2025-03-04 15:22:40,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219488 conditions, 105537 events. 63306/105537 cut-off events. For 25220/25220 co-relation queries the response was YES. Maximal size of possible extension queue 2479. Compared 995628 event pairs, 11355 based on Foata normal form. 2136/99780 useless extension candidates. Maximal degree in co-relation 191161. Up to 51634 conditions per place. [2025-03-04 15:22:40,566 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 157 selfloop transitions, 6 changer transitions 0/211 dead transitions. [2025-03-04 15:22:40,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 211 transitions, 924 flow [2025-03-04 15:22:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 431 transitions. [2025-03-04 15:22:40,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5986111111111111 [2025-03-04 15:22:40,567 INFO L175 Difference]: Start difference. First operand has 115 places, 109 transitions, 310 flow. Second operand 6 states and 431 transitions. [2025-03-04 15:22:40,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 211 transitions, 924 flow [2025-03-04 15:22:40,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 211 transitions, 924 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:40,586 INFO L231 Difference]: Finished difference. Result has 119 places, 108 transitions, 318 flow [2025-03-04 15:22:40,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=119, PETRI_TRANSITIONS=108} [2025-03-04 15:22:40,587 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 15 predicate places. [2025-03-04 15:22:40,587 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 108 transitions, 318 flow [2025-03-04 15:22:40,587 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-04 15:22:40,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:40,587 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:22:40,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:22:40,587 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-04 15:22:40,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash 167409434, now seen corresponding path program 1 times [2025-03-04 15:22:40,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:40,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758364949] [2025-03-04 15:22:40,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:40,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:22:40,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:22:40,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:40,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758364949] [2025-03-04 15:22:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758364949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:40,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:40,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408505420] [2025-03-04 15:22:40,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:40,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:40,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:40,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:40,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 120 [2025-03-04 15:22:40,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 108 transitions, 318 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-04 15:22:40,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:40,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 120 [2025-03-04 15:22:40,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:46,972 INFO L124 PetriNetUnfolderBase]: 57618/96231 cut-off events. [2025-03-04 15:22:46,972 INFO L125 PetriNetUnfolderBase]: For 32282/32282 co-relation queries the response was YES. [2025-03-04 15:22:47,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205237 conditions, 96231 events. 57618/96231 cut-off events. For 32282/32282 co-relation queries the response was YES. Maximal size of possible extension queue 2302. Compared 903506 event pairs, 8623 based on Foata normal form. 2136/93966 useless extension candidates. Maximal degree in co-relation 178947. Up to 59362 conditions per place. [2025-03-04 15:22:47,458 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 134 selfloop transitions, 6 changer transitions 0/188 dead transitions. [2025-03-04 15:22:47,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 188 transitions, 828 flow [2025-03-04 15:22:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2025-03-04 15:22:47,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-03-04 15:22:47,459 INFO L175 Difference]: Start difference. First operand has 119 places, 108 transitions, 318 flow. Second operand 4 states and 310 transitions. [2025-03-04 15:22:47,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 188 transitions, 828 flow [2025-03-04 15:22:47,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 188 transitions, 812 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:22:47,629 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 318 flow [2025-03-04 15:22:47,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2025-03-04 15:22:47,629 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 13 predicate places. [2025-03-04 15:22:47,629 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 318 flow [2025-03-04 15:22:47,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-04 15:22:47,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:47,630 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:47,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:22:47,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:22:47,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash 908284586, now seen corresponding path program 1 times [2025-03-04 15:22:47,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:47,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655446722] [2025-03-04 15:22:47,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:47,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:47,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:22:47,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:22:47,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:47,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:47,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:47,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655446722] [2025-03-04 15:22:47,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655446722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:47,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:47,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700621824] [2025-03-04 15:22:47,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:47,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:47,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:47,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:47,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 120 [2025-03-04 15:22:47,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:22:47,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:47,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 120 [2025-03-04 15:22:47,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand