./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:06:07,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:06:07,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:06:07,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:06:07,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:06:07,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:06:07,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:06:07,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:06:07,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:06:07,613 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:06:07,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:06:07,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:06:07,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:06:07,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:06:07,614 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:06:07,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:06:07,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:06:07,614 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:06:07,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:06:07,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:06:07,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:06:07,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:06:07,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:06:07,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:06:07,615 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:06:07,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:06:07,615 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:06:07,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:06:07,615 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:06:07,616 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:06:07,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:06:07,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:06:07,616 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-jdk21/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 -> af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 [2025-02-08 14:06:07,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:06:07,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:06:07,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:06:07,861 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:06:07,861 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:06:07,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2025-02-08 14:06:09,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81634ac20/3febd6fa5bdd43faa29159f32c8c990e/FLAG15426115b [2025-02-08 14:06:09,298 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:06:09,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2025-02-08 14:06:09,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81634ac20/3febd6fa5bdd43faa29159f32c8c990e/FLAG15426115b [2025-02-08 14:06:09,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81634ac20/3febd6fa5bdd43faa29159f32c8c990e [2025-02-08 14:06:09,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:06:09,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:06:09,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:06:09,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:06:09,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:06:09,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@334e9067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09, skipping insertion in model container [2025-02-08 14:06:09,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:06:09,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:06:09,638 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:06:09,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:06:09,711 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:06:09,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09 WrapperNode [2025-02-08 14:06:09,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:06:09,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:06:09,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:06:09,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:06:09,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,749 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2025-02-08 14:06:09,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:06:09,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:06:09,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:06:09,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:06:09,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,769 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-02-08 14:06:09,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:06:09,778 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:06:09,778 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:06:09,778 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:06:09,779 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (1/1) ... [2025-02-08 14:06:09,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:06:09,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:06:09,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 14:06:09,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 14:06:09,817 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:06:09,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:06:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:06:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:06:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 14:06:09,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:06:09,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:06:09,819 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:06:09,931 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:06:09,932 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:06:10,112 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 14:06:10,113 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L706-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 14:06:10,157 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:06:10,157 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:06:10,271 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:06:10,271 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:06:10,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:06:10 BoogieIcfgContainer [2025-02-08 14:06:10,272 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:06:10,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:06:10,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:06:10,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:06:10,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:06:09" (1/3) ... [2025-02-08 14:06:10,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc47fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:06:10, skipping insertion in model container [2025-02-08 14:06:10,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:06:09" (2/3) ... [2025-02-08 14:06:10,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc47fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:06:10, skipping insertion in model container [2025-02-08 14:06:10,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:06:10" (3/3) ... [2025-02-08 14:06:10,280 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2025-02-08 14:06:10,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:06:10,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_41-trylock_racefree.i that has 2 procedures, 55 locations, 1 initial locations, 7 loop locations, and 8 error locations. [2025-02-08 14:06:10,292 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:06:10,333 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 14:06:10,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 66 transitions, 139 flow [2025-02-08 14:06:10,402 INFO L124 PetriNetUnfolderBase]: 15/85 cut-off events. [2025-02-08 14:06:10,404 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:06:10,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 85 events. 15/85 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 258 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 57. Up to 6 conditions per place. [2025-02-08 14:06:10,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 66 transitions, 139 flow [2025-02-08 14:06:10,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 65 transitions, 137 flow [2025-02-08 14:06:10,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:06:10,429 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;@2b193798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:06:10,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 14:06:10,438 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:06:10,439 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-02-08 14:06:10,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:06:10,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:10,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:06:10,440 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-02-08 14:06:10,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:10,445 INFO L85 PathProgramCache]: Analyzing trace with hash 302352220, now seen corresponding path program 1 times [2025-02-08 14:06:10,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:10,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927753165] [2025-02-08 14:06:10,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:10,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:10,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:06:10,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:06:10,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:10,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:06:10,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:10,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927753165] [2025-02-08 14:06:10,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927753165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:10,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:10,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:10,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857188131] [2025-02-08 14:06:10,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:10,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:10,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:10,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:10,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:10,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2025-02-08 14:06:10,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 65 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-02-08 14:06:10,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:10,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2025-02-08 14:06:10,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:10,915 INFO L124 PetriNetUnfolderBase]: 155/492 cut-off events. [2025-02-08 14:06:10,915 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:06:10,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 492 events. 155/492 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2373 event pairs, 110 based on Foata normal form. 131/562 useless extension candidates. Maximal degree in co-relation 804. Up to 290 conditions per place. [2025-02-08 14:06:10,920 INFO L140 encePairwiseOnDemand]: 51/66 looper letters, 48 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-02-08 14:06:10,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 263 flow [2025-02-08 14:06:10,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:06:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:06:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2025-02-08 14:06:10,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.678030303030303 [2025-02-08 14:06:10,932 INFO L175 Difference]: Start difference. First operand has 58 places, 65 transitions, 137 flow. Second operand 4 states and 179 transitions. [2025-02-08 14:06:10,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 263 flow [2025-02-08 14:06:10,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 263 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:06:10,939 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 125 flow [2025-02-08 14:06:10,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2025-02-08 14:06:10,942 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-02-08 14:06:10,942 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 125 flow [2025-02-08 14:06:10,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-02-08 14:06:10,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:10,943 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:10,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:06:10,943 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-02-08 14:06:10,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:10,944 INFO L85 PathProgramCache]: Analyzing trace with hash 828781937, now seen corresponding path program 1 times [2025-02-08 14:06:10,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:10,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068581314] [2025-02-08 14:06:10,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:10,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:10,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:06:10,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:06:10,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:10,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:06:10,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:06:10,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:06:10,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:06:10,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:10,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:06:11,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:06:11,006 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:06:11,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 14:06:11,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-08 14:06:11,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-08 14:06:11,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-08 14:06:11,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-08 14:06:11,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-08 14:06:11,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-08 14:06:11,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-08 14:06:11,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-08 14:06:11,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-08 14:06:11,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-08 14:06:11,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-08 14:06:11,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-08 14:06:11,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:06:11,012 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 14:06:11,014 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:06:11,014 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:06:11,029 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:06:11,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 101 transitions, 218 flow [2025-02-08 14:06:11,052 INFO L124 PetriNetUnfolderBase]: 27/158 cut-off events. [2025-02-08 14:06:11,052 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:06:11,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 158 events. 27/158 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 610 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 99. Up to 9 conditions per place. [2025-02-08 14:06:11,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 101 transitions, 218 flow [2025-02-08 14:06:11,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 101 transitions, 218 flow [2025-02-08 14:06:11,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:06:11,056 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;@2b193798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:06:11,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-08 14:06:11,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:06:11,058 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-02-08 14:06:11,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:06:11,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:11,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:06:11,058 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-02-08 14:06:11,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash 398768738, now seen corresponding path program 1 times [2025-02-08 14:06:11,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:11,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023165612] [2025-02-08 14:06:11,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:11,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:11,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:06:11,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:06:11,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:11,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:06:11,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023165612] [2025-02-08 14:06:11,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023165612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:11,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:11,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190136087] [2025-02-08 14:06:11,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:11,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:11,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:11,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:11,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 101 [2025-02-08 14:06:11,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 101 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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-02-08 14:06:11,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:11,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 101 [2025-02-08 14:06:11,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:11,915 INFO L124 PetriNetUnfolderBase]: 4459/9527 cut-off events. [2025-02-08 14:06:11,916 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-02-08 14:06:11,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16592 conditions, 9527 events. 4459/9527 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 80563 event pairs, 2024 based on Foata normal form. 2801/11224 useless extension candidates. Maximal degree in co-relation 1327. Up to 6961 conditions per place. [2025-02-08 14:06:11,972 INFO L140 encePairwiseOnDemand]: 80/101 looper letters, 66 selfloop transitions, 3 changer transitions 0/111 dead transitions. [2025-02-08 14:06:11,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 111 transitions, 376 flow [2025-02-08 14:06:11,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:06:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:06:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2025-02-08 14:06:11,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6608910891089109 [2025-02-08 14:06:11,974 INFO L175 Difference]: Start difference. First operand has 88 places, 101 transitions, 218 flow. Second operand 4 states and 267 transitions. [2025-02-08 14:06:11,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 111 transitions, 376 flow [2025-02-08 14:06:11,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 111 transitions, 376 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:06:11,977 INFO L231 Difference]: Finished difference. Result has 93 places, 88 transitions, 212 flow [2025-02-08 14:06:11,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=93, PETRI_TRANSITIONS=88} [2025-02-08 14:06:11,978 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2025-02-08 14:06:11,978 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 88 transitions, 212 flow [2025-02-08 14:06:11,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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-02-08 14:06:11,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:11,978 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:11,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:06:11,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:06:11,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:11,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1098103834, now seen corresponding path program 1 times [2025-02-08 14:06:11,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:11,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953524051] [2025-02-08 14:06:11,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:11,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:11,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:06:11,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:06:11,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:11,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:06:12,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:12,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953524051] [2025-02-08 14:06:12,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953524051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:12,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:12,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:06:12,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706049681] [2025-02-08 14:06:12,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:12,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:06:12,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:12,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:06:12,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:06:12,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 101 [2025-02-08 14:06:12,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 88 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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-02-08 14:06:12,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:12,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 101 [2025-02-08 14:06:12,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:12,813 INFO L124 PetriNetUnfolderBase]: 4195/8005 cut-off events. [2025-02-08 14:06:12,813 INFO L125 PetriNetUnfolderBase]: For 504/504 co-relation queries the response was YES. [2025-02-08 14:06:12,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15302 conditions, 8005 events. 4195/8005 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 62339 event pairs, 264 based on Foata normal form. 144/7504 useless extension candidates. Maximal degree in co-relation 1273. Up to 4599 conditions per place. [2025-02-08 14:06:12,852 INFO L140 encePairwiseOnDemand]: 96/101 looper letters, 106 selfloop transitions, 6 changer transitions 0/154 dead transitions. [2025-02-08 14:06:12,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 154 transitions, 566 flow [2025-02-08 14:06:12,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:06:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:06:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 365 transitions. [2025-02-08 14:06:12,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6023102310231023 [2025-02-08 14:06:12,854 INFO L175 Difference]: Start difference. First operand has 93 places, 88 transitions, 212 flow. Second operand 6 states and 365 transitions. [2025-02-08 14:06:12,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 154 transitions, 566 flow [2025-02-08 14:06:12,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 154 transitions, 564 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:06:12,860 INFO L231 Difference]: Finished difference. Result has 96 places, 87 transitions, 218 flow [2025-02-08 14:06:12,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=96, PETRI_TRANSITIONS=87} [2025-02-08 14:06:12,861 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 8 predicate places. [2025-02-08 14:06:12,862 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 87 transitions, 218 flow [2025-02-08 14:06:12,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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-02-08 14:06:12,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:12,862 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:06:12,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:06:12,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:06:12,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:12,863 INFO L85 PathProgramCache]: Analyzing trace with hash -318519198, now seen corresponding path program 1 times [2025-02-08 14:06:12,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:12,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676417555] [2025-02-08 14:06:12,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:12,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:06:12,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:06:12,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:12,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:06:12,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:12,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676417555] [2025-02-08 14:06:12,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676417555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:12,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:12,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:06:12,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829417464] [2025-02-08 14:06:12,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:12,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:12,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:12,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:12,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 101 [2025-02-08 14:06:12,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 87 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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-02-08 14:06:12,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:12,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 101 [2025-02-08 14:06:12,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:13,545 INFO L124 PetriNetUnfolderBase]: 3931/7446 cut-off events. [2025-02-08 14:06:13,546 INFO L125 PetriNetUnfolderBase]: For 1172/1172 co-relation queries the response was YES. [2025-02-08 14:06:13,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14648 conditions, 7446 events. 3931/7446 cut-off events. For 1172/1172 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 57143 event pairs, 407 based on Foata normal form. 144/7163 useless extension candidates. Maximal degree in co-relation 11320. Up to 5030 conditions per place. [2025-02-08 14:06:13,584 INFO L140 encePairwiseOnDemand]: 96/101 looper letters, 83 selfloop transitions, 6 changer transitions 0/131 dead transitions. [2025-02-08 14:06:13,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 131 transitions, 482 flow [2025-02-08 14:06:13,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:06:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:06:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2025-02-08 14:06:13,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6336633663366337 [2025-02-08 14:06:13,587 INFO L175 Difference]: Start difference. First operand has 96 places, 87 transitions, 218 flow. Second operand 4 states and 256 transitions. [2025-02-08 14:06:13,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 131 transitions, 482 flow [2025-02-08 14:06:13,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 131 transitions, 466 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 14:06:13,600 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 218 flow [2025-02-08 14:06:13,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2025-02-08 14:06:13,602 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 6 predicate places. [2025-02-08 14:06:13,603 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 218 flow [2025-02-08 14:06:13,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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-02-08 14:06:13,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:13,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:13,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:06:13,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:06:13,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:13,604 INFO L85 PathProgramCache]: Analyzing trace with hash 326454085, now seen corresponding path program 1 times [2025-02-08 14:06:13,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:13,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294091544] [2025-02-08 14:06:13,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:13,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:13,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:06:13,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:06:13,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:13,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:06:13,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:13,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294091544] [2025-02-08 14:06:13,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294091544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:13,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:13,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:13,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681673644] [2025-02-08 14:06:13,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:13,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:13,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:13,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:13,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:13,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 101 [2025-02-08 14:06:13,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-02-08 14:06:13,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:13,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 101 [2025-02-08 14:06:13,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:14,538 INFO L124 PetriNetUnfolderBase]: 5885/12297 cut-off events. [2025-02-08 14:06:14,539 INFO L125 PetriNetUnfolderBase]: For 1531/1531 co-relation queries the response was YES. [2025-02-08 14:06:14,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22481 conditions, 12297 events. 5885/12297 cut-off events. For 1531/1531 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 106942 event pairs, 1542 based on Foata normal form. 222/11302 useless extension candidates. Maximal degree in co-relation 18145. Up to 6030 conditions per place. [2025-02-08 14:06:14,592 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 127 selfloop transitions, 12 changer transitions 0/181 dead transitions. [2025-02-08 14:06:14,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 181 transitions, 743 flow [2025-02-08 14:06:14,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:06:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:06:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 354 transitions. [2025-02-08 14:06:14,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.700990099009901 [2025-02-08 14:06:14,594 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 218 flow. Second operand 5 states and 354 transitions. [2025-02-08 14:06:14,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 181 transitions, 743 flow [2025-02-08 14:06:14,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 181 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:06:14,600 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 304 flow [2025-02-08 14:06:14,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2025-02-08 14:06:14,601 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 12 predicate places. [2025-02-08 14:06:14,601 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 304 flow [2025-02-08 14:06:14,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-02-08 14:06:14,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:14,602 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:06:14,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:06:14,602 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-02-08 14:06:14,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:14,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1154258983, now seen corresponding path program 1 times [2025-02-08 14:06:14,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:14,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047154232] [2025-02-08 14:06:14,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:14,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:14,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:06:14,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:06:14,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:14,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:06:14,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:06:14,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:06:14,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:06:14,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:14,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:06:14,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:06:14,638 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:06:14,638 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-08 14:06:14,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-08 14:06:14,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-08 14:06:14,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-08 14:06:14,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:06:14,640 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 14:06:14,640 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:06:14,640 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:06:14,665 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:06:14,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 136 transitions, 299 flow [2025-02-08 14:06:14,682 INFO L124 PetriNetUnfolderBase]: 42/250 cut-off events. [2025-02-08 14:06:14,683 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 14:06:14,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 250 events. 42/250 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1058 event pairs, 1 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 173. Up to 12 conditions per place. [2025-02-08 14:06:14,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 136 transitions, 299 flow [2025-02-08 14:06:14,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 136 transitions, 299 flow [2025-02-08 14:06:14,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:06:14,687 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;@2b193798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:06:14,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-08 14:06:14,688 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:06:14,689 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-02-08 14:06:14,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:06:14,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:14,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:06:14,691 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-02-08 14:06:14,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:14,692 INFO L85 PathProgramCache]: Analyzing trace with hash 528585931, now seen corresponding path program 1 times [2025-02-08 14:06:14,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:14,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797588609] [2025-02-08 14:06:14,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:14,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:14,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:06:14,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:06:14,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:14,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:06:14,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:14,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797588609] [2025-02-08 14:06:14,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797588609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:14,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:14,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:14,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717345851] [2025-02-08 14:06:14,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:14,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:14,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:14,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:14,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:14,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 136 [2025-02-08 14:06:14,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 136 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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-02-08 14:06:14,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:14,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 136 [2025-02-08 14:06:14,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:23,111 INFO L124 PetriNetUnfolderBase]: 83236/151434 cut-off events. [2025-02-08 14:06:23,111 INFO L125 PetriNetUnfolderBase]: For 1879/1879 co-relation queries the response was YES. [2025-02-08 14:06:23,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267326 conditions, 151434 events. 83236/151434 cut-off events. For 1879/1879 co-relation queries the response was YES. Maximal size of possible extension queue 3374. Compared 1617629 event pairs, 52900 based on Foata normal form. 49286/185275 useless extension candidates. Maximal degree in co-relation 17399. Up to 114730 conditions per place. [2025-02-08 14:06:24,025 INFO L140 encePairwiseOnDemand]: 109/136 looper letters, 79 selfloop transitions, 3 changer transitions 0/140 dead transitions. [2025-02-08 14:06:24,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 140 transitions, 471 flow [2025-02-08 14:06:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:06:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:06:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 350 transitions. [2025-02-08 14:06:24,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6433823529411765 [2025-02-08 14:06:24,027 INFO L175 Difference]: Start difference. First operand has 118 places, 136 transitions, 299 flow. Second operand 4 states and 350 transitions. [2025-02-08 14:06:24,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 140 transitions, 471 flow [2025-02-08 14:06:24,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 140 transitions, 471 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:06:24,031 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 281 flow [2025-02-08 14:06:24,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=123, PETRI_TRANSITIONS=117} [2025-02-08 14:06:24,032 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 5 predicate places. [2025-02-08 14:06:24,033 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 281 flow [2025-02-08 14:06:24,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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-02-08 14:06:24,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:24,033 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:24,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:06:24,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:06:24,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1788401082, now seen corresponding path program 1 times [2025-02-08 14:06:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:24,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862300542] [2025-02-08 14:06:24,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:24,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:06:24,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:06:24,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:24,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:06:24,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:24,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862300542] [2025-02-08 14:06:24,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862300542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:24,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:24,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:06:24,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384963619] [2025-02-08 14:06:24,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:24,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:06:24,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:24,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:06:24,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:06:24,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 136 [2025-02-08 14:06:24,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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-02-08 14:06:24,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:24,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 136 [2025-02-08 14:06:24,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:31,898 INFO L124 PetriNetUnfolderBase]: 78220/128876 cut-off events. [2025-02-08 14:06:31,898 INFO L125 PetriNetUnfolderBase]: For 8809/8809 co-relation queries the response was YES. [2025-02-08 14:06:32,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245432 conditions, 128876 events. 78220/128876 cut-off events. For 8809/8809 co-relation queries the response was YES. Maximal size of possible extension queue 2933. Compared 1237270 event pairs, 7896 based on Foata normal form. 1872/121884 useless extension candidates. Maximal degree in co-relation 20462. Up to 75072 conditions per place. [2025-02-08 14:06:32,837 INFO L140 encePairwiseOnDemand]: 131/136 looper letters, 141 selfloop transitions, 6 changer transitions 0/205 dead transitions. [2025-02-08 14:06:32,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 205 transitions, 749 flow [2025-02-08 14:06:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:06:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:06:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 496 transitions. [2025-02-08 14:06:32,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-02-08 14:06:32,839 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 281 flow. Second operand 6 states and 496 transitions. [2025-02-08 14:06:32,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 205 transitions, 749 flow [2025-02-08 14:06:32,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 205 transitions, 747 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:06:32,844 INFO L231 Difference]: Finished difference. Result has 126 places, 116 transitions, 287 flow [2025-02-08 14:06:32,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=126, PETRI_TRANSITIONS=116} [2025-02-08 14:06:32,844 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 8 predicate places. [2025-02-08 14:06:32,844 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 116 transitions, 287 flow [2025-02-08 14:06:32,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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-02-08 14:06:32,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:32,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:06:32,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:06:32,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:06:32,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:32,845 INFO L85 PathProgramCache]: Analyzing trace with hash -290576658, now seen corresponding path program 1 times [2025-02-08 14:06:32,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:32,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180888566] [2025-02-08 14:06:32,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:32,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:32,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:06:32,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:06:32,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:32,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:06:32,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:32,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180888566] [2025-02-08 14:06:32,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180888566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:32,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:32,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:06:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968727627] [2025-02-08 14:06:32,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:32,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:32,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:32,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:32,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 136 [2025-02-08 14:06:32,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 116 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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-02-08 14:06:32,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:32,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 136 [2025-02-08 14:06:32,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:06:44,601 INFO L124 PetriNetUnfolderBase]: 119831/208488 cut-off events. [2025-02-08 14:06:44,602 INFO L125 PetriNetUnfolderBase]: For 20790/23038 co-relation queries the response was YES. [2025-02-08 14:06:45,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385794 conditions, 208488 events. 119831/208488 cut-off events. For 20790/23038 co-relation queries the response was YES. Maximal size of possible extension queue 4853. Compared 2202043 event pairs, 40368 based on Foata normal form. 2994/192905 useless extension candidates. Maximal degree in co-relation 261406. Up to 111308 conditions per place. [2025-02-08 14:06:45,946 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 178 selfloop transitions, 16 changer transitions 0/253 dead transitions. [2025-02-08 14:06:45,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 253 transitions, 1033 flow [2025-02-08 14:06:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:06:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:06:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2025-02-08 14:06:45,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7205882352941176 [2025-02-08 14:06:45,948 INFO L175 Difference]: Start difference. First operand has 126 places, 116 transitions, 287 flow. Second operand 5 states and 490 transitions. [2025-02-08 14:06:45,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 253 transitions, 1033 flow [2025-02-08 14:06:45,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 253 transitions, 1010 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 14:06:45,958 INFO L231 Difference]: Finished difference. Result has 130 places, 131 transitions, 403 flow [2025-02-08 14:06:45,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=130, PETRI_TRANSITIONS=131} [2025-02-08 14:06:45,960 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 12 predicate places. [2025-02-08 14:06:45,960 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 131 transitions, 403 flow [2025-02-08 14:06:45,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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-02-08 14:06:45,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:06:45,960 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:06:45,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:06:45,961 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-02-08 14:06:45,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:06:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash -394140854, now seen corresponding path program 1 times [2025-02-08 14:06:45,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:06:45,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762089755] [2025-02-08 14:06:45,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:06:45,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:06:45,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:06:45,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:06:45,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:06:45,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:06:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:06:45,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:06:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762089755] [2025-02-08 14:06:45,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762089755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:06:45,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:06:45,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:06:45,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274479820] [2025-02-08 14:06:45,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:06:45,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:06:45,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:06:45,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:06:45,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:06:45,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 136 [2025-02-08 14:06:45,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 131 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 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-02-08 14:06:45,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:06:45,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 136 [2025-02-08 14:06:45,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand