./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:21:27,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:21:27,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:21:27,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:21:27,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:21:27,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:21:27,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:21:27,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:21:27,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:21:27,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:21:27,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:21:27,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:21:27,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:21:27,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:21:27,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:21:27,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:21:27,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:21:27,680 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:21:27,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:21:27,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:21:27,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:21:27,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:21:27,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:21:27,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:21:27,680 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:21:27,680 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:21:27,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:21:27,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:21:27,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:21:27,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:21:27,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:21:27,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:21:27,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:21:27,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:21:27,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:21:27,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:21:27,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:21:27,682 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:21:27,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:21:27,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:21:27,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:21:27,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:21:27,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:21:27,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:21:27,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:21:27,682 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef [2025-03-04 15:21:27,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:21:27,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:21:27,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:21:27,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:21:27,940 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:21:27,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2025-03-04 15:21:29,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ee179952/4a9f2eb45aa849399e7668b18559ce92/FLAG23e1d4cd2 [2025-03-04 15:21:29,469 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:21:29,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2025-03-04 15:21:29,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ee179952/4a9f2eb45aa849399e7668b18559ce92/FLAG23e1d4cd2 [2025-03-04 15:21:29,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ee179952/4a9f2eb45aa849399e7668b18559ce92 [2025-03-04 15:21:29,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:21:29,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:21:29,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:21:29,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:21:29,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:21:29,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:29,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58686f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29, skipping insertion in model container [2025-03-04 15:21:29,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:29,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:21:29,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:21:29,852 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:21:29,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:21:29,924 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:21:29,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29 WrapperNode [2025-03-04 15:21:29,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:21:29,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:21:29,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:21:29,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:21:29,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:29,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:29,969 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 143 [2025-03-04 15:21:29,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:21:29,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:21:29,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:21:29,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:21:29,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:29,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:29,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:30,004 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 2, 5]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 0, 5]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-03-04 15:21:30,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:30,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:30,013 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:30,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:30,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:30,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:30,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:21:30,022 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:21:30,022 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:21:30,022 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:21:30,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (1/1) ... [2025-03-04 15:21:30,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:21:30,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:21:30,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:21:30,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:21:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:21:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:21:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:21:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:21:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:21:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:21:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:21:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:21:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:21:30,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:21:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:21:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:21:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:21:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:21:30,070 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:21:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:21:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:21:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:21:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:21:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:21:30,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:21:30,071 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:21:30,196 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:21:30,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:21:30,406 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:21:30,406 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 15:21:30,443 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:21:30,443 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:21:30,619 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:21:30,619 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:21:30,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:21:30 BoogieIcfgContainer [2025-03-04 15:21:30,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:21:30,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:21:30,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:21:30,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:21:30,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:21:29" (1/3) ... [2025-03-04 15:21:30,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b080c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:21:30, skipping insertion in model container [2025-03-04 15:21:30,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:21:29" (2/3) ... [2025-03-04 15:21:30,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b080c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:21:30, skipping insertion in model container [2025-03-04 15:21:30,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:21:30" (3/3) ... [2025-03-04 15:21:30,627 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_07-cond_racing2.i [2025-03-04 15:21:30,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:21:30,641 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_07-cond_racing2.i that has 2 procedures, 58 locations, 1 initial locations, 5 loop locations, and 10 error locations. [2025-03-04 15:21:30,641 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:21:30,701 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:21:30,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 70 transitions, 147 flow [2025-03-04 15:21:30,767 INFO L124 PetriNetUnfolderBase]: 17/96 cut-off events. [2025-03-04 15:21:30,769 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:21:30,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 96 events. 17/96 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 297 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 61. Up to 6 conditions per place. [2025-03-04 15:21:30,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 70 transitions, 147 flow [2025-03-04 15:21:30,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 69 transitions, 145 flow [2025-03-04 15:21:30,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:30,794 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;@3a44a472, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:30,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 15:21:30,804 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:30,804 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-03-04 15:21:30,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:30,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:30,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:30,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:21:30,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:30,809 INFO L85 PathProgramCache]: Analyzing trace with hash 424801142, now seen corresponding path program 1 times [2025-03-04 15:21:30,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:30,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230831997] [2025-03-04 15:21:30,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:30,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:30,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:30,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:30,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:31,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:31,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230831997] [2025-03-04 15:21:31,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230831997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:31,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:31,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:31,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676354306] [2025-03-04 15:21:31,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:31,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:31,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:31,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:31,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:31,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 70 [2025-03-04 15:21:31,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:31,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:31,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 70 [2025-03-04 15:21:31,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:31,375 INFO L124 PetriNetUnfolderBase]: 157/490 cut-off events. [2025-03-04 15:21:31,376 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:21:31,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 490 events. 157/490 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2603 event pairs, 0 based on Foata normal form. 60/459 useless extension candidates. Maximal degree in co-relation 758. Up to 256 conditions per place. [2025-03-04 15:21:31,382 INFO L140 encePairwiseOnDemand]: 56/70 looper letters, 47 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2025-03-04 15:21:31,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 271 flow [2025-03-04 15:21:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2025-03-04 15:21:31,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7178571428571429 [2025-03-04 15:21:31,395 INFO L175 Difference]: Start difference. First operand has 61 places, 69 transitions, 145 flow. Second operand 4 states and 201 transitions. [2025-03-04 15:21:31,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 271 flow [2025-03-04 15:21:31,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:31,400 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 135 flow [2025-03-04 15:21:31,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2025-03-04 15:21:31,404 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2025-03-04 15:21:31,404 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 135 flow [2025-03-04 15:21:31,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:31,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:31,405 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:31,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:21:31,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:21:31,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2017447336, now seen corresponding path program 1 times [2025-03-04 15:21:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:31,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199826350] [2025-03-04 15:21:31,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:31,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:31,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:21:31,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:21:31,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:31,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:31,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:21:31,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:21:31,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:21:31,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:31,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:31,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:21:31,510 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:21:31,511 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-04 15:21:31,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-03-04 15:21:31,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-03-04 15:21:31,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-03-04 15:21:31,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-03-04 15:21:31,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-03-04 15:21:31,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-03-04 15:21:31,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-03-04 15:21:31,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-03-04 15:21:31,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-03-04 15:21:31,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-03-04 15:21:31,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-03-04 15:21:31,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-03-04 15:21:31,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-03-04 15:21:31,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-03-04 15:21:31,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:21:31,514 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 15:21:31,517 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:21:31,517 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:21:31,541 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:21:31,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 102 transitions, 220 flow [2025-03-04 15:21:31,560 INFO L124 PetriNetUnfolderBase]: 30/173 cut-off events. [2025-03-04 15:21:31,562 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 15:21:31,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 173 events. 30/173 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 662 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 104. Up to 9 conditions per place. [2025-03-04 15:21:31,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 102 transitions, 220 flow [2025-03-04 15:21:31,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 102 transitions, 220 flow [2025-03-04 15:21:31,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:31,567 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;@3a44a472, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:31,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 15:21:31,570 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:31,571 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-03-04 15:21:31,571 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:31,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:31,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:31,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:21:31,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash 522169082, now seen corresponding path program 1 times [2025-03-04 15:21:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:31,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237991203] [2025-03-04 15:21:31,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:31,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:31,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:31,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:31,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:31,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237991203] [2025-03-04 15:21:31,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237991203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:31,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:31,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:31,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436038490] [2025-03-04 15:21:31,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:31,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:31,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:31,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:31,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 102 [2025-03-04 15:21:31,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 102 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:31,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:31,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 102 [2025-03-04 15:21:31,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:32,514 INFO L124 PetriNetUnfolderBase]: 4719/9999 cut-off events. [2025-03-04 15:21:32,514 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-03-04 15:21:32,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17180 conditions, 9999 events. 4719/9999 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 85711 event pairs, 1952 based on Foata normal form. 1340/10069 useless extension candidates. Maximal degree in co-relation 1372. Up to 7077 conditions per place. [2025-03-04 15:21:32,583 INFO L140 encePairwiseOnDemand]: 82/102 looper letters, 65 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2025-03-04 15:21:32,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 113 transitions, 378 flow [2025-03-04 15:21:32,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2025-03-04 15:21:32,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.678921568627451 [2025-03-04 15:21:32,585 INFO L175 Difference]: Start difference. First operand has 88 places, 102 transitions, 220 flow. Second operand 4 states and 277 transitions. [2025-03-04 15:21:32,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 113 transitions, 378 flow [2025-03-04 15:21:32,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 113 transitions, 378 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:32,590 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 216 flow [2025-03-04 15:21:32,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2025-03-04 15:21:32,590 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2025-03-04 15:21:32,591 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 216 flow [2025-03-04 15:21:32,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:32,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:32,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:32,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:21:32,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:21:32,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:32,592 INFO L85 PathProgramCache]: Analyzing trace with hash 995158842, now seen corresponding path program 1 times [2025-03-04 15:21:32,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:32,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573883484] [2025-03-04 15:21:32,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:32,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:32,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:21:32,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:21:32,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:32,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:32,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:32,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573883484] [2025-03-04 15:21:32,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573883484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:32,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:32,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:32,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637575160] [2025-03-04 15:21:32,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:32,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:32,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:32,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:32,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:32,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 102 [2025-03-04 15:21:32,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:32,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:32,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 102 [2025-03-04 15:21:32,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:33,707 INFO L124 PetriNetUnfolderBase]: 6297/12869 cut-off events. [2025-03-04 15:21:33,708 INFO L125 PetriNetUnfolderBase]: For 456/791 co-relation queries the response was YES. [2025-03-04 15:21:33,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22957 conditions, 12869 events. 6297/12869 cut-off events. For 456/791 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 112090 event pairs, 1495 based on Foata normal form. 232/11754 useless extension candidates. Maximal degree in co-relation 22857. Up to 6450 conditions per place. [2025-03-04 15:21:33,765 INFO L140 encePairwiseOnDemand]: 93/102 looper letters, 122 selfloop transitions, 12 changer transitions 0/181 dead transitions. [2025-03-04 15:21:33,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 181 transitions, 706 flow [2025-03-04 15:21:33,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:21:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:21:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 365 transitions. [2025-03-04 15:21:33,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2025-03-04 15:21:33,770 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 216 flow. Second operand 5 states and 365 transitions. [2025-03-04 15:21:33,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 181 transitions, 706 flow [2025-03-04 15:21:33,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 181 transitions, 702 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:21:33,776 INFO L231 Difference]: Finished difference. Result has 100 places, 101 transitions, 308 flow [2025-03-04 15:21:33,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=100, PETRI_TRANSITIONS=101} [2025-03-04 15:21:33,776 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 12 predicate places. [2025-03-04 15:21:33,776 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 101 transitions, 308 flow [2025-03-04 15:21:33,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:33,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:33,777 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:33,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:21:33,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:21:33,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:33,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1488406052, now seen corresponding path program 1 times [2025-03-04 15:21:33,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:33,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200605007] [2025-03-04 15:21:33,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:33,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:33,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:21:33,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:21:33,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:33,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200605007] [2025-03-04 15:21:33,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200605007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:33,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:33,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:21:33,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567993135] [2025-03-04 15:21:33,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:33,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:21:33,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:33,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:21:33,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:21:33,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 102 [2025-03-04 15:21:33,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:33,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:33,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 102 [2025-03-04 15:21:33,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:34,896 INFO L124 PetriNetUnfolderBase]: 5611/12600 cut-off events. [2025-03-04 15:21:34,897 INFO L125 PetriNetUnfolderBase]: For 3453/3453 co-relation queries the response was YES. [2025-03-04 15:21:34,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24590 conditions, 12600 events. 5611/12600 cut-off events. For 3453/3453 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 115121 event pairs, 491 based on Foata normal form. 160/10994 useless extension candidates. Maximal degree in co-relation 21158. Up to 6553 conditions per place. [2025-03-04 15:21:34,967 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 126 selfloop transitions, 6 changer transitions 0/177 dead transitions. [2025-03-04 15:21:34,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 177 transitions, 806 flow [2025-03-04 15:21:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:21:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:21:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 382 transitions. [2025-03-04 15:21:34,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6241830065359477 [2025-03-04 15:21:34,970 INFO L175 Difference]: Start difference. First operand has 100 places, 101 transitions, 308 flow. Second operand 6 states and 382 transitions. [2025-03-04 15:21:34,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 177 transitions, 806 flow [2025-03-04 15:21:34,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 177 transitions, 806 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:34,980 INFO L231 Difference]: Finished difference. Result has 104 places, 100 transitions, 316 flow [2025-03-04 15:21:34,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=104, PETRI_TRANSITIONS=100} [2025-03-04 15:21:34,982 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 16 predicate places. [2025-03-04 15:21:34,982 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 100 transitions, 316 flow [2025-03-04 15:21:34,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:34,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:34,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:34,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:21:34,983 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:21:34,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1488332863, now seen corresponding path program 1 times [2025-03-04 15:21:34,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:34,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864237804] [2025-03-04 15:21:34,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:35,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:21:35,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:21:35,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:35,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:35,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:35,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864237804] [2025-03-04 15:21:35,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864237804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:35,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:35,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:21:35,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512785147] [2025-03-04 15:21:35,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:35,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:21:35,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:35,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:21:35,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:21:35,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 102 [2025-03-04 15:21:35,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 100 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:35,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:35,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 102 [2025-03-04 15:21:35,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:35,728 INFO L124 PetriNetUnfolderBase]: 5532/12294 cut-off events. [2025-03-04 15:21:35,729 INFO L125 PetriNetUnfolderBase]: For 4252/4252 co-relation queries the response was YES. [2025-03-04 15:21:35,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24536 conditions, 12294 events. 5532/12294 cut-off events. For 4252/4252 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 110460 event pairs, 783 based on Foata normal form. 12/10752 useless extension candidates. Maximal degree in co-relation 21263. Up to 7310 conditions per place. [2025-03-04 15:21:35,794 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 102 selfloop transitions, 4 changer transitions 0/151 dead transitions. [2025-03-04 15:21:35,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 151 transitions, 682 flow [2025-03-04 15:21:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:21:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:21:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 316 transitions. [2025-03-04 15:21:35,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6196078431372549 [2025-03-04 15:21:35,795 INFO L175 Difference]: Start difference. First operand has 104 places, 100 transitions, 316 flow. Second operand 5 states and 316 transitions. [2025-03-04 15:21:35,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 151 transitions, 682 flow [2025-03-04 15:21:35,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 151 transitions, 670 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 15:21:35,804 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 316 flow [2025-03-04 15:21:35,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2025-03-04 15:21:35,806 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 17 predicate places. [2025-03-04 15:21:35,807 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 316 flow [2025-03-04 15:21:35,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:35,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:35,807 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:21:35,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:21:35,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:21:35,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1104052190, now seen corresponding path program 1 times [2025-03-04 15:21:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:35,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813188240] [2025-03-04 15:21:35,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:35,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:21:35,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:21:35,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:35,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:35,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:35,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813188240] [2025-03-04 15:21:35,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813188240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:35,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:35,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:21:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917198820] [2025-03-04 15:21:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:35,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:35,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:35,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:35,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:35,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 102 [2025-03-04 15:21:35,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 316 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:35,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:35,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 102 [2025-03-04 15:21:35,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:36,470 INFO L124 PetriNetUnfolderBase]: 5219/11689 cut-off events. [2025-03-04 15:21:36,470 INFO L125 PetriNetUnfolderBase]: For 4156/4156 co-relation queries the response was YES. [2025-03-04 15:21:36,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23186 conditions, 11689 events. 5219/11689 cut-off events. For 4156/4156 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 103982 event pairs, 494 based on Foata normal form. 152/10332 useless extension candidates. Maximal degree in co-relation 20025. Up to 6842 conditions per place. [2025-03-04 15:21:36,524 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 103 selfloop transitions, 6 changer transitions 0/154 dead transitions. [2025-03-04 15:21:36,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 154 transitions, 704 flow [2025-03-04 15:21:36,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2025-03-04 15:21:36,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6544117647058824 [2025-03-04 15:21:36,525 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 316 flow. Second operand 4 states and 267 transitions. [2025-03-04 15:21:36,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 154 transitions, 704 flow [2025-03-04 15:21:36,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 154 transitions, 692 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 15:21:36,531 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 320 flow [2025-03-04 15:21:36,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=320, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2025-03-04 15:21:36,531 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 15 predicate places. [2025-03-04 15:21:36,532 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 320 flow [2025-03-04 15:21:36,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:36,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:36,532 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 15:21:36,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:21:36,532 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:21:36,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:36,532 INFO L85 PathProgramCache]: Analyzing trace with hash -137214802, now seen corresponding path program 1 times [2025-03-04 15:21:36,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:36,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-03-04 15:21:36,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:36,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:36,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:21:36,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:21:36,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:36,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:36,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:21:36,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:21:36,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:21:36,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:36,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:21:36,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:21:36,573 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:21:36,573 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-03-04 15:21:36,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-03-04 15:21:36,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-03-04 15:21:36,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-03-04 15:21:36,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-03-04 15:21:36,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-03-04 15:21:36,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-03-04 15:21:36,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:21:36,575 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 15:21:36,575 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:21:36,575 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:21:36,600 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:21:36,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 134 transitions, 295 flow [2025-03-04 15:21:36,619 INFO L124 PetriNetUnfolderBase]: 46/269 cut-off events. [2025-03-04 15:21:36,619 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:21:36,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 269 events. 46/269 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1114 event pairs, 1 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 188. Up to 12 conditions per place. [2025-03-04 15:21:36,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 134 transitions, 295 flow [2025-03-04 15:21:36,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 134 transitions, 295 flow [2025-03-04 15:21:36,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:21:36,626 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;@3a44a472, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:21:36,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 15:21:36,628 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:21:36,628 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-03-04 15:21:36,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:21:36,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:36,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:21:36,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:21:36,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash 650074782, now seen corresponding path program 1 times [2025-03-04 15:21:36,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:36,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244581161] [2025-03-04 15:21:36,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:36,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:21:36,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:21:36,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:36,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:36,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:36,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244581161] [2025-03-04 15:21:36,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244581161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:36,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:36,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:36,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341253777] [2025-03-04 15:21:36,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:36,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:36,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:36,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:36,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:36,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 134 [2025-03-04 15:21:36,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 134 transitions, 295 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-03-04 15:21:36,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:36,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 134 [2025-03-04 15:21:36,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:44,804 INFO L124 PetriNetUnfolderBase]: 87851/154906 cut-off events. [2025-03-04 15:21:44,804 INFO L125 PetriNetUnfolderBase]: For 1911/1911 co-relation queries the response was YES. [2025-03-04 15:21:45,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275029 conditions, 154906 events. 87851/154906 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 3658. Compared 1609194 event pairs, 52468 based on Foata normal form. 23824/163056 useless extension candidates. Maximal degree in co-relation 17992. Up to 118961 conditions per place. [2025-03-04 15:21:45,909 INFO L140 encePairwiseOnDemand]: 108/134 looper letters, 78 selfloop transitions, 3 changer transitions 0/139 dead transitions. [2025-03-04 15:21:45,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 139 transitions, 467 flow [2025-03-04 15:21:45,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:21:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:21:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2025-03-04 15:21:45,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6492537313432836 [2025-03-04 15:21:45,911 INFO L175 Difference]: Start difference. First operand has 115 places, 134 transitions, 295 flow. Second operand 4 states and 348 transitions. [2025-03-04 15:21:45,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 139 transitions, 467 flow [2025-03-04 15:21:45,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 139 transitions, 467 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:21:45,913 INFO L231 Difference]: Finished difference. Result has 120 places, 116 transitions, 279 flow [2025-03-04 15:21:45,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=120, PETRI_TRANSITIONS=116} [2025-03-04 15:21:45,914 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 5 predicate places. [2025-03-04 15:21:45,914 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 116 transitions, 279 flow [2025-03-04 15:21:45,914 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-03-04 15:21:45,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:45,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:45,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:21:45,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:21:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1888719070, now seen corresponding path program 1 times [2025-03-04 15:21:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:45,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290406419] [2025-03-04 15:21:45,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:45,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:21:45,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:21:45,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:45,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:45,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290406419] [2025-03-04 15:21:45,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290406419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:45,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:45,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:21:45,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477664705] [2025-03-04 15:21:45,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:45,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:21:45,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:45,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:21:45,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:21:45,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 134 [2025-03-04 15:21:45,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 116 transitions, 279 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-03-04 15:21:45,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:45,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 134 [2025-03-04 15:21:45,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:57,900 INFO L124 PetriNetUnfolderBase]: 124373/213846 cut-off events. [2025-03-04 15:21:57,901 INFO L125 PetriNetUnfolderBase]: For 7138/11656 co-relation queries the response was YES. [2025-03-04 15:21:58,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389310 conditions, 213846 events. 124373/213846 cut-off events. For 7138/11656 co-relation queries the response was YES. Maximal size of possible extension queue 5047. Compared 2235872 event pairs, 39414 based on Foata normal form. 3015/196654 useless extension candidates. Maximal degree in co-relation 389209. Up to 117315 conditions per place. [2025-03-04 15:21:59,099 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 174 selfloop transitions, 16 changer transitions 0/250 dead transitions. [2025-03-04 15:21:59,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 250 transitions, 997 flow [2025-03-04 15:21:59,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:21:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:21:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 486 transitions. [2025-03-04 15:21:59,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7253731343283583 [2025-03-04 15:21:59,101 INFO L175 Difference]: Start difference. First operand has 120 places, 116 transitions, 279 flow. Second operand 5 states and 486 transitions. [2025-03-04 15:21:59,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 250 transitions, 997 flow [2025-03-04 15:21:59,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 250 transitions, 993 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:21:59,117 INFO L231 Difference]: Finished difference. Result has 127 places, 131 transitions, 405 flow [2025-03-04 15:21:59,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=119, 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=405, PETRI_PLACES=127, PETRI_TRANSITIONS=131} [2025-03-04 15:21:59,117 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 12 predicate places. [2025-03-04 15:21:59,117 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 131 transitions, 405 flow [2025-03-04 15:21:59,118 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-03-04 15:21:59,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:59,118 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:59,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:21:59,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:21:59,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:59,118 INFO L85 PathProgramCache]: Analyzing trace with hash -66622300, now seen corresponding path program 1 times [2025-03-04 15:21:59,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:59,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904604825] [2025-03-04 15:21:59,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:59,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:59,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:21:59,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:21:59,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:59,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:59,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904604825] [2025-03-04 15:21:59,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904604825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:59,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:59,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:21:59,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687055374] [2025-03-04 15:21:59,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:59,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:21:59,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:59,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:21:59,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:21:59,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 134 [2025-03-04 15:21:59,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 131 transitions, 405 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-03-04 15:21:59,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:59,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 134 [2025-03-04 15:21:59,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand