./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/exponential-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/exponential-64.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5877a70884380b10e463fa3cfc6b55a5014f8a8b2ecd81a270409b479a9f5bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:57:27,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:57:28,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:57:28,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:57:28,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:57:28,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:57:28,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:57:28,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:57:28,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:57:28,056 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:57:28,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:57:28,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:57:28,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:57:28,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:57:28,058 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:57:28,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:57:28,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:57:28,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:57:28,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:57:28,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:57:28,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:57:28,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:57:28,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:57:28,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:57:28,058 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:57:28,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:57:28,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:57:28,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:57:28,059 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:57:28,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:57:28,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:57:28,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:28,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:28,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:28,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:28,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:57:28,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:28,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:28,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:28,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:28,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:57:28,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:57:28,060 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:57:28,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:57:28,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:57:28,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:57:28,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:57:28,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:57:28,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:57:28,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:57:28,061 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c5877a70884380b10e463fa3cfc6b55a5014f8a8b2ecd81a270409b479a9f5bc [2025-01-10 06:57:28,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:57:28,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:57:28,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:57:28,301 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:57:28,301 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:57:28,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/exponential-64.i [2025-01-10 06:57:29,499 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6670e477/d4fb6ae9639147279e6c1a4e209c090a/FLAGc835eae9b [2025-01-10 06:57:29,745 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:57:29,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-64.i [2025-01-10 06:57:29,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6670e477/d4fb6ae9639147279e6c1a4e209c090a/FLAGc835eae9b [2025-01-10 06:57:30,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6670e477/d4fb6ae9639147279e6c1a4e209c090a [2025-01-10 06:57:30,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:57:30,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:57:30,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:30,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:57:30,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:57:30,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3dee82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30, skipping insertion in model container [2025-01-10 06:57:30,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:57:30,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:30,346 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:57:30,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:30,402 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:57:30,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30 WrapperNode [2025-01-10 06:57:30,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:30,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:30,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:57:30,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:57:30,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,425 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 61 [2025-01-10 06:57:30,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:30,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:57:30,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:57:30,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:57:30,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,444 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:57:30,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,450 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:57:30,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:57:30,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:57:30,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:57:30,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (1/1) ... [2025-01-10 06:57:30,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:30,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:30,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:57:30,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:57:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:57:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 06:57:30,503 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 06:57:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 06:57:30,503 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 06:57:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:57:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:57:30,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:57:30,504 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:57:30,614 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:57:30,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:57:30,775 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:57:30,776 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:57:30,854 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:57:30,854 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:57:30,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:30 BoogieIcfgContainer [2025-01-10 06:57:30,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:57:30,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:57:30,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:57:30,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:57:30,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:57:30" (1/3) ... [2025-01-10 06:57:30,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1af6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:30, skipping insertion in model container [2025-01-10 06:57:30,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:30" (2/3) ... [2025-01-10 06:57:30,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1af6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:30, skipping insertion in model container [2025-01-10 06:57:30,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:30" (3/3) ... [2025-01-10 06:57:30,864 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-64.i [2025-01-10 06:57:30,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:57:30,876 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exponential-64.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-10 06:57:30,876 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:57:30,906 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:30,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 58 flow [2025-01-10 06:57:30,953 INFO L124 PetriNetUnfolderBase]: 2/32 cut-off events. [2025-01-10 06:57:30,956 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:30,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 2/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2025-01-10 06:57:30,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 25 transitions, 58 flow [2025-01-10 06:57:30,962 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 53 flow [2025-01-10 06:57:30,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:30,975 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;@712ab4cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:30,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:57:30,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:30,983 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:57:30,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:30,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:30,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:57:30,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:30,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash 6797239, now seen corresponding path program 1 times [2025-01-10 06:57:30,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:30,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308564094] [2025-01-10 06:57:30,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:30,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:31,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:57:31,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:57:31,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:31,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:31,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:31,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308564094] [2025-01-10 06:57:31,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308564094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:31,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:31,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:31,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852706378] [2025-01-10 06:57:31,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:31,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:31,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:31,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:31,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:31,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 25 [2025-01-10 06:57:31,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-01-10 06:57:31,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:31,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 25 [2025-01-10 06:57:31,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:31,225 INFO L124 PetriNetUnfolderBase]: 27/91 cut-off events. [2025-01-10 06:57:31,226 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:31,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 91 events. 27/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 368 event pairs, 7 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 142. Up to 37 conditions per place. [2025-01-10 06:57:31,229 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 13 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-01-10 06:57:31,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 89 flow [2025-01-10 06:57:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-01-10 06:57:31,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2025-01-10 06:57:31,239 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 53 flow. Second operand 3 states and 52 transitions. [2025-01-10 06:57:31,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 89 flow [2025-01-10 06:57:31,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 88 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:31,259 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 60 flow [2025-01-10 06:57:31,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2025-01-10 06:57:31,263 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2025-01-10 06:57:31,263 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 60 flow [2025-01-10 06:57:31,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-01-10 06:57:31,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:31,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:31,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:57:31,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:31,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash 684620930, now seen corresponding path program 1 times [2025-01-10 06:57:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:31,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930979671] [2025-01-10 06:57:31,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:31,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:31,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:31,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:31,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:31,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:31,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:31,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930979671] [2025-01-10 06:57:31,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930979671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:31,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:31,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:31,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963675831] [2025-01-10 06:57:31,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:31,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:31,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:31,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:31,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:31,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 25 [2025-01-10 06:57:31,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-01-10 06:57:31,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:31,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 25 [2025-01-10 06:57:31,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:31,399 INFO L124 PetriNetUnfolderBase]: 27/81 cut-off events. [2025-01-10 06:57:31,401 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 06:57:31,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 81 events. 27/81 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 287 event pairs, 3 based on Foata normal form. 8/83 useless extension candidates. Maximal degree in co-relation 144. Up to 37 conditions per place. [2025-01-10 06:57:31,404 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 14 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2025-01-10 06:57:31,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 100 flow [2025-01-10 06:57:31,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-01-10 06:57:31,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-01-10 06:57:31,406 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 60 flow. Second operand 4 states and 59 transitions. [2025-01-10 06:57:31,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 100 flow [2025-01-10 06:57:31,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:31,407 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 58 flow [2025-01-10 06:57:31,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2025-01-10 06:57:31,408 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2025-01-10 06:57:31,409 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 58 flow [2025-01-10 06:57:31,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-01-10 06:57:31,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:31,409 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:31,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:57:31,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:31,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1257336072, now seen corresponding path program 1 times [2025-01-10 06:57:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:31,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101216448] [2025-01-10 06:57:31,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:31,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:31,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:31,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:31,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:31,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:31,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:57:31,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:31,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:31,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:31,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:31,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:57:31,459 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:57:31,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-10 06:57:31,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 06:57:31,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 06:57:31,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 06:57:31,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 06:57:31,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-01-10 06:57:31,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:57:31,464 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 06:57:31,467 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:57:31,467 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:57:31,486 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:31,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 86 flow [2025-01-10 06:57:31,495 INFO L124 PetriNetUnfolderBase]: 3/54 cut-off events. [2025-01-10 06:57:31,495 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:57:31,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 54 events. 3/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 49. Up to 6 conditions per place. [2025-01-10 06:57:31,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 33 transitions, 86 flow [2025-01-10 06:57:31,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 80 flow [2025-01-10 06:57:31,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:31,498 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;@712ab4cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:31,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:57:31,502 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:31,502 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:57:31,502 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:31,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:31,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:57:31,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:31,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash 7813111, now seen corresponding path program 1 times [2025-01-10 06:57:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:31,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838801383] [2025-01-10 06:57:31,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:31,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:57:31,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:57:31,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:31,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:31,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:31,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838801383] [2025-01-10 06:57:31,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838801383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:31,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:31,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:31,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171255923] [2025-01-10 06:57:31,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:31,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:31,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:31,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:31,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:31,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 33 [2025-01-10 06:57:31,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-10 06:57:31,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:31,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 33 [2025-01-10 06:57:31,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:31,667 INFO L124 PetriNetUnfolderBase]: 247/555 cut-off events. [2025-01-10 06:57:31,667 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 06:57:31,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 555 events. 247/555 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3158 event pairs, 99 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 418. Up to 369 conditions per place. [2025-01-10 06:57:31,672 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 20 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-01-10 06:57:31,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 136 flow [2025-01-10 06:57:31,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-01-10 06:57:31,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7171717171717171 [2025-01-10 06:57:31,674 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 80 flow. Second operand 3 states and 71 transitions. [2025-01-10 06:57:31,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 136 flow [2025-01-10 06:57:31,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:31,675 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 91 flow [2025-01-10 06:57:31,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2025-01-10 06:57:31,677 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2025-01-10 06:57:31,677 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 91 flow [2025-01-10 06:57:31,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-10 06:57:31,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:31,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:31,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:57:31,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:31,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash 889273232, now seen corresponding path program 1 times [2025-01-10 06:57:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:31,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982855055] [2025-01-10 06:57:31,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:31,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:31,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:31,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:31,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:31,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:31,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:31,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982855055] [2025-01-10 06:57:31,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982855055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:31,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:31,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:31,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143937461] [2025-01-10 06:57:31,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:31,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:31,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:31,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:31,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:31,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-01-10 06:57:31,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-10 06:57:31,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:31,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-01-10 06:57:31,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:31,855 INFO L124 PetriNetUnfolderBase]: 311/611 cut-off events. [2025-01-10 06:57:31,855 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-10 06:57:31,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 611 events. 311/611 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3390 event pairs, 127 based on Foata normal form. 8/573 useless extension candidates. Maximal degree in co-relation 500. Up to 465 conditions per place. [2025-01-10 06:57:31,859 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 23 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-01-10 06:57:31,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 157 flow [2025-01-10 06:57:31,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-01-10 06:57:31,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-01-10 06:57:31,860 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 91 flow. Second operand 4 states and 84 transitions. [2025-01-10 06:57:31,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 157 flow [2025-01-10 06:57:31,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 155 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:31,863 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 107 flow [2025-01-10 06:57:31,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2025-01-10 06:57:31,864 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-01-10 06:57:31,864 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 107 flow [2025-01-10 06:57:31,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-10 06:57:31,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:31,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:31,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:57:31,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:31,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash 341036671, now seen corresponding path program 1 times [2025-01-10 06:57:31,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:31,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399836653] [2025-01-10 06:57:31,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:31,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:31,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:31,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:31,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:31,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:31,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:31,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399836653] [2025-01-10 06:57:31,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399836653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:31,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:31,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:31,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053356407] [2025-01-10 06:57:31,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:31,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:31,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:31,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:31,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:31,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-01-10 06:57:31,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-01-10 06:57:31,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:31,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-01-10 06:57:31,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:32,026 INFO L124 PetriNetUnfolderBase]: 391/751 cut-off events. [2025-01-10 06:57:32,026 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-01-10 06:57:32,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 751 events. 391/751 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4306 event pairs, 299 based on Foata normal form. 20/731 useless extension candidates. Maximal degree in co-relation 640. Up to 502 conditions per place. [2025-01-10 06:57:32,031 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 27 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-01-10 06:57:32,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 187 flow [2025-01-10 06:57:32,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-01-10 06:57:32,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-01-10 06:57:32,033 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 107 flow. Second operand 4 states and 86 transitions. [2025-01-10 06:57:32,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 187 flow [2025-01-10 06:57:32,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:32,034 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 125 flow [2025-01-10 06:57:32,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2025-01-10 06:57:32,035 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2025-01-10 06:57:32,035 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 125 flow [2025-01-10 06:57:32,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-01-10 06:57:32,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:32,035 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:32,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:57:32,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:32,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2011114678, now seen corresponding path program 1 times [2025-01-10 06:57:32,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:32,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646320085] [2025-01-10 06:57:32,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:32,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:32,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:32,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:32,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:32,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:32,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:32,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646320085] [2025-01-10 06:57:32,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646320085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:32,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:32,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537654909] [2025-01-10 06:57:32,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:32,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:32,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:32,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:32,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:32,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-01-10 06:57:32,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-01-10 06:57:32,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:32,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-01-10 06:57:32,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:32,240 INFO L124 PetriNetUnfolderBase]: 351/693 cut-off events. [2025-01-10 06:57:32,240 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-01-10 06:57:32,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 693 events. 351/693 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3823 event pairs, 111 based on Foata normal form. 16/699 useless extension candidates. Maximal degree in co-relation 933. Up to 432 conditions per place. [2025-01-10 06:57:32,245 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 26 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-01-10 06:57:32,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 44 transitions, 203 flow [2025-01-10 06:57:32,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-01-10 06:57:32,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-01-10 06:57:32,248 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 125 flow. Second operand 6 states and 114 transitions. [2025-01-10 06:57:32,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 44 transitions, 203 flow [2025-01-10 06:57:32,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 44 transitions, 201 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:32,252 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 129 flow [2025-01-10 06:57:32,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2025-01-10 06:57:32,254 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-01-10 06:57:32,254 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 129 flow [2025-01-10 06:57:32,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-01-10 06:57:32,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:32,254 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:32,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:57:32,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:32,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2068913261, now seen corresponding path program 1 times [2025-01-10 06:57:32,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:32,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010568090] [2025-01-10 06:57:32,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:32,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:32,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:32,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:32,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:32,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:57:32,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:32,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010568090] [2025-01-10 06:57:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010568090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:32,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:32,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:32,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131871447] [2025-01-10 06:57:32,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:32,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:32,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:32,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:32,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:32,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-01-10 06:57:32,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-01-10 06:57:32,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:32,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-01-10 06:57:32,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:32,435 INFO L124 PetriNetUnfolderBase]: 331/643 cut-off events. [2025-01-10 06:57:32,436 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-01-10 06:57:32,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 643 events. 331/643 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3434 event pairs, 47 based on Foata normal form. 4/629 useless extension candidates. Maximal degree in co-relation 952. Up to 305 conditions per place. [2025-01-10 06:57:32,439 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 28 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-01-10 06:57:32,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 215 flow [2025-01-10 06:57:32,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:57:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:57:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-01-10 06:57:32,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6121212121212121 [2025-01-10 06:57:32,441 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 129 flow. Second operand 5 states and 101 transitions. [2025-01-10 06:57:32,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 215 flow [2025-01-10 06:57:32,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 204 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:32,443 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 130 flow [2025-01-10 06:57:32,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-01-10 06:57:32,443 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-01-10 06:57:32,444 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 130 flow [2025-01-10 06:57:32,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-01-10 06:57:32,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:32,444 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:32,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:57:32,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:32,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2079954684, now seen corresponding path program 1 times [2025-01-10 06:57:32,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:32,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37836427] [2025-01-10 06:57:32,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:32,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:32,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:32,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:32,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:32,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:32,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37836427] [2025-01-10 06:57:32,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37836427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:32,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:32,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:32,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095944990] [2025-01-10 06:57:32,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:32,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:32,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:32,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:32,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:32,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-01-10 06:57:32,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 130 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-01-10 06:57:32,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:32,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-01-10 06:57:32,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:32,610 INFO L124 PetriNetUnfolderBase]: 299/593 cut-off events. [2025-01-10 06:57:32,610 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2025-01-10 06:57:32,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 593 events. 299/593 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3166 event pairs, 15 based on Foata normal form. 16/599 useless extension candidates. Maximal degree in co-relation 854. Up to 305 conditions per place. [2025-01-10 06:57:32,613 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 30 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-01-10 06:57:32,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 226 flow [2025-01-10 06:57:32,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-01-10 06:57:32,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5959595959595959 [2025-01-10 06:57:32,615 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 130 flow. Second operand 6 states and 118 transitions. [2025-01-10 06:57:32,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 226 flow [2025-01-10 06:57:32,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 216 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:57:32,618 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 126 flow [2025-01-10 06:57:32,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2025-01-10 06:57:32,619 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-01-10 06:57:32,620 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 126 flow [2025-01-10 06:57:32,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-01-10 06:57:32,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:32,620 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:32,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:57:32,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:32,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:32,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1676666679, now seen corresponding path program 1 times [2025-01-10 06:57:32,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:32,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720690512] [2025-01-10 06:57:32,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:32,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:57:32,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:57:32,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:32,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:32,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:57:32,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:57:32,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:57:32,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:32,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:32,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:57:32,642 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:57:32,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-10 06:57:32,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 06:57:32,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 06:57:32,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 06:57:32,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 06:57:32,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-01-10 06:57:32,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:57:32,643 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:32,644 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:57:32,644 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:57:32,661 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:32,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 118 flow [2025-01-10 06:57:32,667 INFO L124 PetriNetUnfolderBase]: 4/76 cut-off events. [2025-01-10 06:57:32,667 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-10 06:57:32,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 76 events. 4/76 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 125 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 79. Up to 8 conditions per place. [2025-01-10 06:57:32,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 41 transitions, 118 flow [2025-01-10 06:57:32,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 39 transitions, 111 flow [2025-01-10 06:57:32,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:32,671 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;@712ab4cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:32,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:57:32,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:32,672 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:57:32,672 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:32,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:32,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:57:32,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:32,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:32,673 INFO L85 PathProgramCache]: Analyzing trace with hash 9075255, now seen corresponding path program 1 times [2025-01-10 06:57:32,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:32,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198237083] [2025-01-10 06:57:32,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:32,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:32,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:57:32,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:57:32,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:32,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:32,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:32,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198237083] [2025-01-10 06:57:32,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198237083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:32,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:32,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:32,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790680605] [2025-01-10 06:57:32,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:32,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:32,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:32,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:32,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:32,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2025-01-10 06:57:32,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-01-10 06:57:32,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:32,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2025-01-10 06:57:32,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:32,886 INFO L124 PetriNetUnfolderBase]: 1575/2859 cut-off events. [2025-01-10 06:57:32,887 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-01-10 06:57:32,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5266 conditions, 2859 events. 1575/2859 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 18841 event pairs, 915 based on Foata normal form. 0/2524 useless extension candidates. Maximal degree in co-relation 2330. Up to 2145 conditions per place. [2025-01-10 06:57:32,905 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 24 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-01-10 06:57:32,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 175 flow [2025-01-10 06:57:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-01-10 06:57:32,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2025-01-10 06:57:32,928 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 111 flow. Second operand 3 states and 87 transitions. [2025-01-10 06:57:32,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 175 flow [2025-01-10 06:57:32,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 170 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:32,930 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 118 flow [2025-01-10 06:57:32,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-01-10 06:57:32,932 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-01-10 06:57:32,932 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 118 flow [2025-01-10 06:57:32,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-01-10 06:57:32,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:32,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:32,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:57:32,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:32,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash -159311962, now seen corresponding path program 1 times [2025-01-10 06:57:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694694052] [2025-01-10 06:57:32,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:32,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:32,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:32,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:32,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:32,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:32,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694694052] [2025-01-10 06:57:32,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694694052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:32,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:32,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:32,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280633507] [2025-01-10 06:57:32,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:32,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:32,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:32,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:32,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:32,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:32,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-10 06:57:32,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:32,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:32,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:33,240 INFO L124 PetriNetUnfolderBase]: 2023/3299 cut-off events. [2025-01-10 06:57:33,240 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-10 06:57:33,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6440 conditions, 3299 events. 2023/3299 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20350 event pairs, 1199 based on Foata normal form. 8/3102 useless extension candidates. Maximal degree in co-relation 2836. Up to 2753 conditions per place. [2025-01-10 06:57:33,265 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 27 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-01-10 06:57:33,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 192 flow [2025-01-10 06:57:33,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-01-10 06:57:33,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-01-10 06:57:33,267 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 118 flow. Second operand 4 states and 104 transitions. [2025-01-10 06:57:33,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 192 flow [2025-01-10 06:57:33,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:33,269 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 134 flow [2025-01-10 06:57:33,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2025-01-10 06:57:33,269 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2025-01-10 06:57:33,270 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 134 flow [2025-01-10 06:57:33,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-10 06:57:33,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:33,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:33,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:57:33,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:33,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash 466547157, now seen corresponding path program 1 times [2025-01-10 06:57:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:33,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214424343] [2025-01-10 06:57:33,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:33,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:33,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:33,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:33,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:33,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:33,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214424343] [2025-01-10 06:57:33,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214424343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:33,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:33,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:33,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162676567] [2025-01-10 06:57:33,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:33,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:33,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:33,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:33,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:33,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:33,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-01-10 06:57:33,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:33,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:33,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:33,608 INFO L124 PetriNetUnfolderBase]: 2487/4015 cut-off events. [2025-01-10 06:57:33,609 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2025-01-10 06:57:33,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8051 conditions, 4015 events. 2487/4015 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 25277 event pairs, 1947 based on Foata normal form. 84/3932 useless extension candidates. Maximal degree in co-relation 3552. Up to 2790 conditions per place. [2025-01-10 06:57:33,635 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 35 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-01-10 06:57:33,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 238 flow [2025-01-10 06:57:33,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-01-10 06:57:33,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6707317073170732 [2025-01-10 06:57:33,637 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 134 flow. Second operand 4 states and 110 transitions. [2025-01-10 06:57:33,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 238 flow [2025-01-10 06:57:33,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 55 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:33,641 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 152 flow [2025-01-10 06:57:33,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2025-01-10 06:57:33,642 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-01-10 06:57:33,643 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 152 flow [2025-01-10 06:57:33,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-01-10 06:57:33,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:33,643 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:33,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:57:33,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:33,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:33,644 INFO L85 PathProgramCache]: Analyzing trace with hash 455814794, now seen corresponding path program 1 times [2025-01-10 06:57:33,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:33,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737527265] [2025-01-10 06:57:33,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:33,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:33,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:33,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:33,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:33,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737527265] [2025-01-10 06:57:33,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737527265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:33,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:33,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:33,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276697466] [2025-01-10 06:57:33,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:33,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:33,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:33,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:33,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:33,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:33,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-01-10 06:57:33,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:33,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:33,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:33,990 INFO L124 PetriNetUnfolderBase]: 2255/3647 cut-off events. [2025-01-10 06:57:33,990 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2025-01-10 06:57:34,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8036 conditions, 3647 events. 2255/3647 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22258 event pairs, 663 based on Foata normal form. 80/3686 useless extension candidates. Maximal degree in co-relation 4975. Up to 2464 conditions per place. [2025-01-10 06:57:34,016 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 32 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-01-10 06:57:34,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 54 transitions, 246 flow [2025-01-10 06:57:34,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-01-10 06:57:34,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-01-10 06:57:34,019 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 152 flow. Second operand 6 states and 144 transitions. [2025-01-10 06:57:34,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 54 transitions, 246 flow [2025-01-10 06:57:34,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:34,028 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 156 flow [2025-01-10 06:57:34,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2025-01-10 06:57:34,028 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2025-01-10 06:57:34,028 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 156 flow [2025-01-10 06:57:34,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-01-10 06:57:34,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:34,029 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:34,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:57:34,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:34,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash 392468358, now seen corresponding path program 1 times [2025-01-10 06:57:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:34,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352412191] [2025-01-10 06:57:34,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:34,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:34,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:34,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:34,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:57:34,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:34,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352412191] [2025-01-10 06:57:34,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352412191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:34,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:34,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:34,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729343762] [2025-01-10 06:57:34,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:34,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:34,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:34,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:34,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:34,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:34,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-01-10 06:57:34,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:34,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:34,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:34,340 INFO L124 PetriNetUnfolderBase]: 2235/3649 cut-off events. [2025-01-10 06:57:34,340 INFO L125 PetriNetUnfolderBase]: For 890/890 co-relation queries the response was YES. [2025-01-10 06:57:34,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8051 conditions, 3649 events. 2235/3649 cut-off events. For 890/890 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22501 event pairs, 607 based on Foata normal form. 4/3572 useless extension candidates. Maximal degree in co-relation 5174. Up to 2849 conditions per place. [2025-01-10 06:57:34,364 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 36 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-01-10 06:57:34,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 57 transitions, 276 flow [2025-01-10 06:57:34,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:57:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:57:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-01-10 06:57:34,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6292682926829268 [2025-01-10 06:57:34,367 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 156 flow. Second operand 5 states and 129 transitions. [2025-01-10 06:57:34,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 57 transitions, 276 flow [2025-01-10 06:57:34,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 261 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:34,375 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 163 flow [2025-01-10 06:57:34,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2025-01-10 06:57:34,376 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2025-01-10 06:57:34,376 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 163 flow [2025-01-10 06:57:34,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-01-10 06:57:34,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:34,377 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:34,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:57:34,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:34,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:34,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1245357029, now seen corresponding path program 1 times [2025-01-10 06:57:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:34,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350551394] [2025-01-10 06:57:34,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:34,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:34,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:34,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:34,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:34,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:34,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:34,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350551394] [2025-01-10 06:57:34,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350551394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:34,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:34,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:34,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98360800] [2025-01-10 06:57:34,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:34,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:34,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:34,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:34,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:34,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:34,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-01-10 06:57:34,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:34,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:34,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:34,693 INFO L124 PetriNetUnfolderBase]: 2203/3601 cut-off events. [2025-01-10 06:57:34,693 INFO L125 PetriNetUnfolderBase]: For 862/862 co-relation queries the response was YES. [2025-01-10 06:57:34,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7955 conditions, 3601 events. 2203/3601 cut-off events. For 862/862 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22164 event pairs, 575 based on Foata normal form. 16/3544 useless extension candidates. Maximal degree in co-relation 5078. Up to 2849 conditions per place. [2025-01-10 06:57:34,742 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 38 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2025-01-10 06:57:34,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 60 transitions, 285 flow [2025-01-10 06:57:34,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2025-01-10 06:57:34,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-01-10 06:57:34,744 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 163 flow. Second operand 6 states and 150 transitions. [2025-01-10 06:57:34,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 60 transitions, 285 flow [2025-01-10 06:57:34,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 60 transitions, 279 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:34,748 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 179 flow [2025-01-10 06:57:34,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2025-01-10 06:57:34,748 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2025-01-10 06:57:34,748 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 179 flow [2025-01-10 06:57:34,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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-01-10 06:57:34,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:34,749 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:34,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:57:34,749 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:34,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:34,750 INFO L85 PathProgramCache]: Analyzing trace with hash 501332002, now seen corresponding path program 1 times [2025-01-10 06:57:34,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:34,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987476103] [2025-01-10 06:57:34,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:34,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:34,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:57:34,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:57:34,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:34,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:57:34,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:34,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987476103] [2025-01-10 06:57:34,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987476103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:34,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:34,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:57:34,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088951966] [2025-01-10 06:57:34,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:34,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:57:34,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:34,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:57:34,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:57:34,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:34,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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-01-10 06:57:34,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:34,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:34,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:35,117 INFO L124 PetriNetUnfolderBase]: 2059/3329 cut-off events. [2025-01-10 06:57:35,117 INFO L125 PetriNetUnfolderBase]: For 1166/1166 co-relation queries the response was YES. [2025-01-10 06:57:35,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7497 conditions, 3329 events. 2059/3329 cut-off events. For 1166/1166 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19954 event pairs, 191 based on Foata normal form. 16/3272 useless extension candidates. Maximal degree in co-relation 5114. Up to 1601 conditions per place. [2025-01-10 06:57:35,137 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 44 selfloop transitions, 6 changer transitions 0/67 dead transitions. [2025-01-10 06:57:35,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 67 transitions, 325 flow [2025-01-10 06:57:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:57:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:57:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2025-01-10 06:57:35,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-01-10 06:57:35,139 INFO L175 Difference]: Start difference. First operand has 69 places, 44 transitions, 179 flow. Second operand 7 states and 175 transitions. [2025-01-10 06:57:35,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 67 transitions, 325 flow [2025-01-10 06:57:35,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 317 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:35,143 INFO L231 Difference]: Finished difference. Result has 72 places, 44 transitions, 187 flow [2025-01-10 06:57:35,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=72, PETRI_TRANSITIONS=44} [2025-01-10 06:57:35,144 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2025-01-10 06:57:35,144 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 44 transitions, 187 flow [2025-01-10 06:57:35,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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-01-10 06:57:35,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:35,145 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:35,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:57:35,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:35,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash 353821639, now seen corresponding path program 1 times [2025-01-10 06:57:35,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:35,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916008111] [2025-01-10 06:57:35,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:35,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:35,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:57:35,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:57:35,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:35,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:35,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:35,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916008111] [2025-01-10 06:57:35,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916008111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:35,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:35,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:57:35,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457264724] [2025-01-10 06:57:35,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:35,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:57:35,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:35,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:57:35,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:57:35,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2025-01-10 06:57:35,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 44 transitions, 187 flow. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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-01-10 06:57:35,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:35,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2025-01-10 06:57:35,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:35,536 INFO L124 PetriNetUnfolderBase]: 1867/3033 cut-off events. [2025-01-10 06:57:35,536 INFO L125 PetriNetUnfolderBase]: For 1462/1462 co-relation queries the response was YES. [2025-01-10 06:57:35,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7026 conditions, 3033 events. 1867/3033 cut-off events. For 1462/1462 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 17599 event pairs, 63 based on Foata normal form. 64/3056 useless extension candidates. Maximal degree in co-relation 4642. Up to 1601 conditions per place. [2025-01-10 06:57:35,563 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 48 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2025-01-10 06:57:35,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 72 transitions, 349 flow [2025-01-10 06:57:35,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:57:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:57:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2025-01-10 06:57:35,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6036585365853658 [2025-01-10 06:57:35,565 INFO L175 Difference]: Start difference. First operand has 72 places, 44 transitions, 187 flow. Second operand 8 states and 198 transitions. [2025-01-10 06:57:35,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 72 transitions, 349 flow [2025-01-10 06:57:35,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 72 transitions, 333 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-01-10 06:57:35,570 INFO L231 Difference]: Finished difference. Result has 71 places, 43 transitions, 179 flow [2025-01-10 06:57:35,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=71, PETRI_TRANSITIONS=43} [2025-01-10 06:57:35,570 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2025-01-10 06:57:35,570 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 43 transitions, 179 flow [2025-01-10 06:57:35,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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-01-10 06:57:35,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:35,571 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:35,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:57:35,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:35,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash 720188008, now seen corresponding path program 1 times [2025-01-10 06:57:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837203945] [2025-01-10 06:57:35,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:35,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 06:57:35,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 06:57:35,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:35,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:35,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:57:35,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 06:57:35,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 06:57:35,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:35,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:35,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:57:35,593 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:57:35,593 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-10 06:57:35,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 06:57:35,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 06:57:35,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 06:57:35,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 06:57:35,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-01-10 06:57:35,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:57:35,594 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:35,594 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:57:35,594 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 06:57:35,618 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:35,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 49 transitions, 154 flow [2025-01-10 06:57:35,626 INFO L124 PetriNetUnfolderBase]: 5/98 cut-off events. [2025-01-10 06:57:35,626 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-10 06:57:35,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 98 events. 5/98 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 171 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 111. Up to 10 conditions per place. [2025-01-10 06:57:35,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 49 transitions, 154 flow [2025-01-10 06:57:35,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 47 transitions, 146 flow [2025-01-10 06:57:35,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:35,627 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;@712ab4cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:35,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:57:35,628 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:35,628 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:57:35,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:35,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:35,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:57:35,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:35,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:35,629 INFO L85 PathProgramCache]: Analyzing trace with hash 10583671, now seen corresponding path program 1 times [2025-01-10 06:57:35,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:35,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979784101] [2025-01-10 06:57:35,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:35,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:35,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:57:35,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:57:35,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:35,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:35,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:35,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979784101] [2025-01-10 06:57:35,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979784101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:35,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:35,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:35,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598921688] [2025-01-10 06:57:35,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:35,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:35,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:35,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:35,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:35,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2025-01-10 06:57:35,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-01-10 06:57:35,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:35,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2025-01-10 06:57:35,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:36,444 INFO L124 PetriNetUnfolderBase]: 8679/13867 cut-off events. [2025-01-10 06:57:36,444 INFO L125 PetriNetUnfolderBase]: For 2844/2844 co-relation queries the response was YES. [2025-01-10 06:57:36,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26132 conditions, 13867 events. 8679/13867 cut-off events. For 2844/2844 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 98354 event pairs, 5971 based on Foata normal form. 0/12512 useless extension candidates. Maximal degree in co-relation 11866. Up to 11041 conditions per place. [2025-01-10 06:57:36,531 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-01-10 06:57:36,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 53 transitions, 218 flow [2025-01-10 06:57:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-01-10 06:57:36,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7006802721088435 [2025-01-10 06:57:36,532 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 146 flow. Second operand 3 states and 103 transitions. [2025-01-10 06:57:36,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 53 transitions, 218 flow [2025-01-10 06:57:36,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 53 transitions, 205 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:36,538 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 145 flow [2025-01-10 06:57:36,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2025-01-10 06:57:36,538 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 2 predicate places. [2025-01-10 06:57:36,538 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 145 flow [2025-01-10 06:57:36,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-01-10 06:57:36,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:36,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:36,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:57:36,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:36,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:36,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1833832644, now seen corresponding path program 1 times [2025-01-10 06:57:36,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:36,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869103809] [2025-01-10 06:57:36,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:36,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:36,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:36,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:36,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:36,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:36,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869103809] [2025-01-10 06:57:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869103809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:36,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:36,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236099199] [2025-01-10 06:57:36,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:36,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:36,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:36,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:36,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:36,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:36,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-01-10 06:57:36,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:36,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:36,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:37,632 INFO L124 PetriNetUnfolderBase]: 11175/16355 cut-off events. [2025-01-10 06:57:37,632 INFO L125 PetriNetUnfolderBase]: For 2000/2000 co-relation queries the response was YES. [2025-01-10 06:57:37,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32042 conditions, 16355 events. 11175/16355 cut-off events. For 2000/2000 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 105901 event pairs, 7791 based on Foata normal form. 8/15530 useless extension candidates. Maximal degree in co-relation 14484. Up to 14209 conditions per place. [2025-01-10 06:57:37,748 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 31 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-01-10 06:57:37,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 227 flow [2025-01-10 06:57:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2025-01-10 06:57:37,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2025-01-10 06:57:37,751 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 145 flow. Second operand 4 states and 124 transitions. [2025-01-10 06:57:37,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 227 flow [2025-01-10 06:57:37,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 55 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:37,757 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 161 flow [2025-01-10 06:57:37,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2025-01-10 06:57:37,757 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 6 predicate places. [2025-01-10 06:57:37,757 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 161 flow [2025-01-10 06:57:37,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-01-10 06:57:37,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:37,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:37,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:57:37,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:37,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash 53817395, now seen corresponding path program 1 times [2025-01-10 06:57:37,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:37,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975695480] [2025-01-10 06:57:37,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:37,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:37,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:37,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:37,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:37,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:37,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975695480] [2025-01-10 06:57:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975695480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:37,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:37,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:37,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338414378] [2025-01-10 06:57:37,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:37,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:37,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:37,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:37,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:37,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:37,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-01-10 06:57:37,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:37,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:37,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:39,166 INFO L124 PetriNetUnfolderBase]: 13687/19887 cut-off events. [2025-01-10 06:57:39,166 INFO L125 PetriNetUnfolderBase]: For 2184/2184 co-relation queries the response was YES. [2025-01-10 06:57:39,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39797 conditions, 19887 events. 13687/19887 cut-off events. For 2184/2184 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 130324 event pairs, 10843 based on Foata normal form. 340/19548 useless extension candidates. Maximal degree in co-relation 18016. Up to 14246 conditions per place. [2025-01-10 06:57:39,332 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 43 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2025-01-10 06:57:39,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 289 flow [2025-01-10 06:57:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:39,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-01-10 06:57:39,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6836734693877551 [2025-01-10 06:57:39,333 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 161 flow. Second operand 4 states and 134 transitions. [2025-01-10 06:57:39,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 289 flow [2025-01-10 06:57:39,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 285 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:39,340 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 179 flow [2025-01-10 06:57:39,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2025-01-10 06:57:39,340 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 9 predicate places. [2025-01-10 06:57:39,340 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 179 flow [2025-01-10 06:57:39,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-01-10 06:57:39,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:39,341 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:39,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:57:39,341 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:39,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:39,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1320440010, now seen corresponding path program 1 times [2025-01-10 06:57:39,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:39,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690440723] [2025-01-10 06:57:39,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:39,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:39,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:39,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:39,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:39,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:39,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690440723] [2025-01-10 06:57:39,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690440723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:39,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:39,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:39,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188540837] [2025-01-10 06:57:39,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:39,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:39,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:39,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:39,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:39,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:39,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:39,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:39,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:39,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:40,476 INFO L124 PetriNetUnfolderBase]: 12431/18013 cut-off events. [2025-01-10 06:57:40,476 INFO L125 PetriNetUnfolderBase]: For 3812/3812 co-relation queries the response was YES. [2025-01-10 06:57:40,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39044 conditions, 18013 events. 12431/18013 cut-off events. For 3812/3812 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 115077 event pairs, 4311 based on Foata normal form. 336/18184 useless extension candidates. Maximal degree in co-relation 24717. Up to 12640 conditions per place. [2025-01-10 06:57:40,568 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 38 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2025-01-10 06:57:40,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 64 transitions, 289 flow [2025-01-10 06:57:40,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2025-01-10 06:57:40,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2025-01-10 06:57:40,569 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 179 flow. Second operand 6 states and 174 transitions. [2025-01-10 06:57:40,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 64 transitions, 289 flow [2025-01-10 06:57:40,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 64 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:40,614 INFO L231 Difference]: Finished difference. Result has 76 places, 50 transitions, 183 flow [2025-01-10 06:57:40,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=76, PETRI_TRANSITIONS=50} [2025-01-10 06:57:40,615 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 12 predicate places. [2025-01-10 06:57:40,615 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 50 transitions, 183 flow [2025-01-10 06:57:40,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:40,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:40,615 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:40,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:57:40,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:40,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1251545721, now seen corresponding path program 1 times [2025-01-10 06:57:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947413147] [2025-01-10 06:57:40,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:40,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:40,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:40,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:40,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:57:40,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:40,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947413147] [2025-01-10 06:57:40,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947413147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:40,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:40,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796895734] [2025-01-10 06:57:40,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:40,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:40,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:40,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:40,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:40,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:40,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 50 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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-01-10 06:57:40,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:40,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:40,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:41,797 INFO L124 PetriNetUnfolderBase]: 12411/18243 cut-off events. [2025-01-10 06:57:41,797 INFO L125 PetriNetUnfolderBase]: For 4378/4378 co-relation queries the response was YES. [2025-01-10 06:57:41,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39543 conditions, 18243 events. 12411/18243 cut-off events. For 4378/4378 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 119050 event pairs, 5407 based on Foata normal form. 4/17930 useless extension candidates. Maximal degree in co-relation 25656. Up to 15585 conditions per place. [2025-01-10 06:57:41,888 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 40 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-01-10 06:57:41,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 65 transitions, 311 flow [2025-01-10 06:57:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:57:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:57:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-01-10 06:57:41,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6244897959183674 [2025-01-10 06:57:41,889 INFO L175 Difference]: Start difference. First operand has 76 places, 50 transitions, 183 flow. Second operand 5 states and 153 transitions. [2025-01-10 06:57:41,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 65 transitions, 311 flow [2025-01-10 06:57:41,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 65 transitions, 296 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:41,923 INFO L231 Difference]: Finished difference. Result has 77 places, 51 transitions, 190 flow [2025-01-10 06:57:41,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2025-01-10 06:57:41,923 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2025-01-10 06:57:41,923 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 190 flow [2025-01-10 06:57:41,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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-01-10 06:57:41,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:41,924 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:41,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:57:41,924 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:41,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2016032298, now seen corresponding path program 1 times [2025-01-10 06:57:41,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:41,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711564526] [2025-01-10 06:57:41,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:41,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:41,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:41,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:41,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:41,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:41,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:41,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711564526] [2025-01-10 06:57:41,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711564526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:41,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:41,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:57:41,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785684962] [2025-01-10 06:57:41,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:41,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:41,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:41,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:41,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:41,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:41,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 51 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:41,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:41,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:41,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:43,060 INFO L124 PetriNetUnfolderBase]: 12379/18193 cut-off events. [2025-01-10 06:57:43,060 INFO L125 PetriNetUnfolderBase]: For 4222/4222 co-relation queries the response was YES. [2025-01-10 06:57:43,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39445 conditions, 18193 events. 12379/18193 cut-off events. For 4222/4222 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 118739 event pairs, 5375 based on Foata normal form. 16/17900 useless extension candidates. Maximal degree in co-relation 25558. Up to 15585 conditions per place. [2025-01-10 06:57:43,163 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 42 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2025-01-10 06:57:43,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 68 transitions, 320 flow [2025-01-10 06:57:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-01-10 06:57:43,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-01-10 06:57:43,165 INFO L175 Difference]: Start difference. First operand has 77 places, 51 transitions, 190 flow. Second operand 6 states and 178 transitions. [2025-01-10 06:57:43,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 68 transitions, 320 flow [2025-01-10 06:57:43,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 68 transitions, 314 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:43,195 INFO L231 Difference]: Finished difference. Result has 81 places, 52 transitions, 206 flow [2025-01-10 06:57:43,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=81, PETRI_TRANSITIONS=52} [2025-01-10 06:57:43,195 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 17 predicate places. [2025-01-10 06:57:43,195 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 52 transitions, 206 flow [2025-01-10 06:57:43,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:43,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:43,195 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:43,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:57:43,196 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:43,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:43,196 INFO L85 PathProgramCache]: Analyzing trace with hash -453910605, now seen corresponding path program 1 times [2025-01-10 06:57:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:43,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985279115] [2025-01-10 06:57:43,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:43,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:43,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:57:43,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:57:43,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:43,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:57:43,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:43,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985279115] [2025-01-10 06:57:43,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985279115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:43,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:43,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:57:43,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162873482] [2025-01-10 06:57:43,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:43,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:57:43,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:43,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:57:43,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:57:43,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:43,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 52 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-01-10 06:57:43,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:43,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:43,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:44,425 INFO L124 PetriNetUnfolderBase]: 12235/17921 cut-off events. [2025-01-10 06:57:44,425 INFO L125 PetriNetUnfolderBase]: For 5422/5422 co-relation queries the response was YES. [2025-01-10 06:57:44,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39499 conditions, 17921 events. 12235/17921 cut-off events. For 5422/5422 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 116479 event pairs, 2431 based on Foata normal form. 16/17628 useless extension candidates. Maximal degree in co-relation 26106. Up to 14337 conditions per place. [2025-01-10 06:57:44,570 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 52 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2025-01-10 06:57:44,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 79 transitions, 388 flow [2025-01-10 06:57:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:57:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:57:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2025-01-10 06:57:44,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6151603498542274 [2025-01-10 06:57:44,572 INFO L175 Difference]: Start difference. First operand has 81 places, 52 transitions, 206 flow. Second operand 7 states and 211 transitions. [2025-01-10 06:57:44,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 79 transitions, 388 flow [2025-01-10 06:57:44,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 79 transitions, 380 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:44,610 INFO L231 Difference]: Finished difference. Result has 84 places, 53 transitions, 222 flow [2025-01-10 06:57:44,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=84, PETRI_TRANSITIONS=53} [2025-01-10 06:57:44,610 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 20 predicate places. [2025-01-10 06:57:44,610 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 53 transitions, 222 flow [2025-01-10 06:57:44,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-01-10 06:57:44,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:44,610 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:44,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:57:44,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:44,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:44,611 INFO L85 PathProgramCache]: Analyzing trace with hash 978055386, now seen corresponding path program 1 times [2025-01-10 06:57:44,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:44,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171904047] [2025-01-10 06:57:44,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:44,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:44,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:57:44,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:57:44,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:44,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:44,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:44,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171904047] [2025-01-10 06:57:44,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171904047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:44,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:44,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:57:44,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516962335] [2025-01-10 06:57:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:44,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:57:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:44,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:57:44,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:57:44,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:44,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 53 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 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-01-10 06:57:44,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:44,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:44,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:45,811 INFO L124 PetriNetUnfolderBase]: 12043/17665 cut-off events. [2025-01-10 06:57:45,811 INFO L125 PetriNetUnfolderBase]: For 6486/6486 co-relation queries the response was YES. [2025-01-10 06:57:45,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39580 conditions, 17665 events. 12043/17665 cut-off events. For 6486/6486 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 114790 event pairs, 2303 based on Foata normal form. 64/17452 useless extension candidates. Maximal degree in co-relation 26186. Up to 14337 conditions per place. [2025-01-10 06:57:45,939 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 56 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-01-10 06:57:45,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 84 transitions, 414 flow [2025-01-10 06:57:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:57:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:57:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 238 transitions. [2025-01-10 06:57:45,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-01-10 06:57:45,940 INFO L175 Difference]: Start difference. First operand has 84 places, 53 transitions, 222 flow. Second operand 8 states and 238 transitions. [2025-01-10 06:57:45,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 84 transitions, 414 flow [2025-01-10 06:57:45,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 84 transitions, 402 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 06:57:45,976 INFO L231 Difference]: Finished difference. Result has 88 places, 54 transitions, 238 flow [2025-01-10 06:57:45,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=88, PETRI_TRANSITIONS=54} [2025-01-10 06:57:45,977 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 24 predicate places. [2025-01-10 06:57:45,977 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 54 transitions, 238 flow [2025-01-10 06:57:45,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 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-01-10 06:57:45,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:45,977 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:45,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 06:57:45,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:45,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:45,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1300738999, now seen corresponding path program 1 times [2025-01-10 06:57:45,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:45,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130645994] [2025-01-10 06:57:45,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:45,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:45,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:57:45,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:57:45,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:45,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:57:46,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130645994] [2025-01-10 06:57:46,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130645994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:46,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:46,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:57:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035340568] [2025-01-10 06:57:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:46,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:57:46,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:46,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:57:46,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:57:46,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:46,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 54 transitions, 238 flow. Second operand has 9 states, 9 states have (on average 24.444444444444443) internal successors, (220), 9 states have internal predecessors, (220), 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-01-10 06:57:46,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:46,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:46,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:47,097 INFO L124 PetriNetUnfolderBase]: 11211/16289 cut-off events. [2025-01-10 06:57:47,097 INFO L125 PetriNetUnfolderBase]: For 8166/8166 co-relation queries the response was YES. [2025-01-10 06:57:47,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37070 conditions, 16289 events. 11211/16289 cut-off events. For 8166/8166 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 102336 event pairs, 767 based on Foata normal form. 64/16076 useless extension candidates. Maximal degree in co-relation 26042. Up to 7937 conditions per place. [2025-01-10 06:57:47,215 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 64 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2025-01-10 06:57:47,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 460 flow [2025-01-10 06:57:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:57:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:57:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 269 transitions. [2025-01-10 06:57:47,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6099773242630385 [2025-01-10 06:57:47,216 INFO L175 Difference]: Start difference. First operand has 88 places, 54 transitions, 238 flow. Second operand 9 states and 269 transitions. [2025-01-10 06:57:47,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 460 flow [2025-01-10 06:57:47,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 93 transitions, 446 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-10 06:57:47,247 INFO L231 Difference]: Finished difference. Result has 91 places, 54 transitions, 244 flow [2025-01-10 06:57:47,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=91, PETRI_TRANSITIONS=54} [2025-01-10 06:57:47,248 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 27 predicate places. [2025-01-10 06:57:47,248 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 54 transitions, 244 flow [2025-01-10 06:57:47,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.444444444444443) internal successors, (220), 9 states have internal predecessors, (220), 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-01-10 06:57:47,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:47,248 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:47,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 06:57:47,248 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:47,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash -433722796, now seen corresponding path program 1 times [2025-01-10 06:57:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:47,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42779361] [2025-01-10 06:57:47,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:47,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 06:57:47,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 06:57:47,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:47,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:47,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:47,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42779361] [2025-01-10 06:57:47,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42779361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:47,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:47,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:57:47,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179251956] [2025-01-10 06:57:47,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:47,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:57:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:47,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:57:47,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:57:47,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-01-10 06:57:47,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 54 transitions, 244 flow. Second operand has 10 states, 10 states have (on average 24.5) internal successors, (245), 10 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:47,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:47,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-01-10 06:57:47,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:48,194 INFO L124 PetriNetUnfolderBase]: 10187/15035 cut-off events. [2025-01-10 06:57:48,194 INFO L125 PetriNetUnfolderBase]: For 9254/9254 co-relation queries the response was YES. [2025-01-10 06:57:48,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34537 conditions, 15035 events. 10187/15035 cut-off events. For 9254/9254 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 95843 event pairs, 255 based on Foata normal form. 256/15142 useless extension candidates. Maximal degree in co-relation 23508. Up to 7937 conditions per place. [2025-01-10 06:57:48,293 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 70 selfloop transitions, 9 changer transitions 0/100 dead transitions. [2025-01-10 06:57:48,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 100 transitions, 488 flow [2025-01-10 06:57:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 298 transitions. [2025-01-10 06:57:48,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081632653061224 [2025-01-10 06:57:48,295 INFO L175 Difference]: Start difference. First operand has 91 places, 54 transitions, 244 flow. Second operand 10 states and 298 transitions. [2025-01-10 06:57:48,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 100 transitions, 488 flow [2025-01-10 06:57:48,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 100 transitions, 464 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-01-10 06:57:48,323 INFO L231 Difference]: Finished difference. Result has 89 places, 53 transitions, 230 flow [2025-01-10 06:57:48,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=230, PETRI_PLACES=89, PETRI_TRANSITIONS=53} [2025-01-10 06:57:48,324 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 25 predicate places. [2025-01-10 06:57:48,324 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 53 transitions, 230 flow [2025-01-10 06:57:48,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.5) internal successors, (245), 10 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:48,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:48,324 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:48,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 06:57:48,324 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:48,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:48,324 INFO L85 PathProgramCache]: Analyzing trace with hash -195768357, now seen corresponding path program 1 times [2025-01-10 06:57:48,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:48,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845421671] [2025-01-10 06:57:48,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:48,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:48,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:57:48,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:57:48,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:48,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:48,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:57:48,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:57:48,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:57:48,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:48,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:48,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:57:48,339 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:57:48,340 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-10 06:57:48,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 06:57:48,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 06:57:48,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 06:57:48,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 06:57:48,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-01-10 06:57:48,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 06:57:48,340 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:48,340 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:57:48,341 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-10 06:57:48,356 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:48,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 57 transitions, 194 flow [2025-01-10 06:57:48,363 INFO L124 PetriNetUnfolderBase]: 6/120 cut-off events. [2025-01-10 06:57:48,363 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-10 06:57:48,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 120 events. 6/120 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 200 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 145. Up to 12 conditions per place. [2025-01-10 06:57:48,363 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 57 transitions, 194 flow [2025-01-10 06:57:48,364 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 55 transitions, 185 flow [2025-01-10 06:57:48,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:48,365 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;@712ab4cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:48,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:57:48,366 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:48,366 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:57:48,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:48,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:48,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:57:48,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:48,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash 12338359, now seen corresponding path program 1 times [2025-01-10 06:57:48,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:48,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858279957] [2025-01-10 06:57:48,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:48,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:48,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:57:48,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:57:48,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:48,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:48,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:48,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858279957] [2025-01-10 06:57:48,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858279957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:48,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:48,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:48,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800716680] [2025-01-10 06:57:48,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:48,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:48,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:48,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:48,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:48,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2025-01-10 06:57:48,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-01-10 06:57:48,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:48,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2025-01-10 06:57:48,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:52,814 INFO L124 PetriNetUnfolderBase]: 44263/65067 cut-off events. [2025-01-10 06:57:52,814 INFO L125 PetriNetUnfolderBase]: For 19228/19228 co-relation queries the response was YES. [2025-01-10 06:57:52,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124694 conditions, 65067 events. 44263/65067 cut-off events. For 19228/19228 co-relation queries the response was YES. Maximal size of possible extension queue 2500. Compared 483273 event pairs, 33363 based on Foata normal form. 0/59611 useless extension candidates. Maximal degree in co-relation 57562. Up to 53793 conditions per place. [2025-01-10 06:57:53,208 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2025-01-10 06:57:53,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 61 transitions, 265 flow [2025-01-10 06:57:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-01-10 06:57:53,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.695906432748538 [2025-01-10 06:57:53,209 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 185 flow. Second operand 3 states and 119 transitions. [2025-01-10 06:57:53,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 61 transitions, 265 flow [2025-01-10 06:57:53,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 61 transitions, 240 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:53,259 INFO L231 Difference]: Finished difference. Result has 78 places, 56 transitions, 172 flow [2025-01-10 06:57:53,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=78, PETRI_TRANSITIONS=56} [2025-01-10 06:57:53,259 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 2 predicate places. [2025-01-10 06:57:53,259 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 56 transitions, 172 flow [2025-01-10 06:57:53,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-01-10 06:57:53,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:53,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:53,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 06:57:53,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:53,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:53,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1721227542, now seen corresponding path program 1 times [2025-01-10 06:57:53,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:53,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801988951] [2025-01-10 06:57:53,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:53,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:53,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:53,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:53,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:53,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:53,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801988951] [2025-01-10 06:57:53,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801988951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:53,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:53,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:53,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116394948] [2025-01-10 06:57:53,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:53,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:53,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:53,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:53,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:53,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2025-01-10 06:57:53,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 56 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-01-10 06:57:53,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:53,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2025-01-10 06:57:53,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,855 INFO L124 PetriNetUnfolderBase]: 56999/77793 cut-off events. [2025-01-10 06:57:57,856 INFO L125 PetriNetUnfolderBase]: For 12112/12112 co-relation queries the response was YES. [2025-01-10 06:57:58,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152874 conditions, 77793 events. 56999/77793 cut-off events. For 12112/12112 co-relation queries the response was YES. Maximal size of possible extension queue 2809. Compared 517044 event pairs, 43375 based on Foata normal form. 8/74403 useless extension candidates. Maximal degree in co-relation 70291. Up to 69249 conditions per place. [2025-01-10 06:57:58,442 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 35 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2025-01-10 06:57:58,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 63 transitions, 262 flow [2025-01-10 06:57:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-01-10 06:57:58,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2025-01-10 06:57:58,443 INFO L175 Difference]: Start difference. First operand has 78 places, 56 transitions, 172 flow. Second operand 4 states and 144 transitions. [2025-01-10 06:57:58,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 63 transitions, 262 flow [2025-01-10 06:57:58,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 63 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:58,463 INFO L231 Difference]: Finished difference. Result has 82 places, 57 transitions, 188 flow [2025-01-10 06:57:58,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=82, PETRI_TRANSITIONS=57} [2025-01-10 06:57:58,463 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 6 predicate places. [2025-01-10 06:57:58,463 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 57 transitions, 188 flow [2025-01-10 06:57:58,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-01-10 06:57:58,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:58,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:58,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-10 06:57:58,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:57:58,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash -897152615, now seen corresponding path program 1 times [2025-01-10 06:57:58,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:58,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921269578] [2025-01-10 06:57:58,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:58,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:58,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:58,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:58,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:58,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:58,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:58,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921269578] [2025-01-10 06:57:58,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921269578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:58,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:58,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:58,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072125049] [2025-01-10 06:57:58,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:58,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:58,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:58,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:58,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:58,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2025-01-10 06:57:58,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 57 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-01-10 06:57:58,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:58,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2025-01-10 06:57:58,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:04,439 INFO L124 PetriNetUnfolderBase]: 69751/94639 cut-off events. [2025-01-10 06:58:04,439 INFO L125 PetriNetUnfolderBase]: For 12808/12808 co-relation queries the response was YES. [2025-01-10 06:58:04,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189303 conditions, 94639 events. 69751/94639 cut-off events. For 12808/12808 co-relation queries the response was YES. Maximal size of possible extension queue 3239. Compared 633993 event pairs, 55643 based on Foata normal form. 1364/93275 useless extension candidates. Maximal degree in co-relation 87136. Up to 69286 conditions per place. [2025-01-10 06:58:05,110 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 51 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-01-10 06:58:05,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 79 transitions, 340 flow [2025-01-10 06:58:05,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:58:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:58:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2025-01-10 06:58:05,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6929824561403509 [2025-01-10 06:58:05,111 INFO L175 Difference]: Start difference. First operand has 82 places, 57 transitions, 188 flow. Second operand 4 states and 158 transitions. [2025-01-10 06:58:05,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 79 transitions, 340 flow [2025-01-10 06:58:05,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 79 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:58:05,137 INFO L231 Difference]: Finished difference. Result has 85 places, 59 transitions, 206 flow [2025-01-10 06:58:05,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=85, PETRI_TRANSITIONS=59} [2025-01-10 06:58:05,138 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 9 predicate places. [2025-01-10 06:58:05,138 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 59 transitions, 206 flow [2025-01-10 06:58:05,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-01-10 06:58:05,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:05,138 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:05,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-10 06:58:05,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:58:05,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:05,139 INFO L85 PathProgramCache]: Analyzing trace with hash 582760970, now seen corresponding path program 1 times [2025-01-10 06:58:05,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:05,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088938741] [2025-01-10 06:58:05,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:05,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:05,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:58:05,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:58:05,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:05,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:05,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:05,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088938741] [2025-01-10 06:58:05,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088938741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:05,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:05,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:58:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160132682] [2025-01-10 06:58:05,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:05,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:58:05,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:05,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:58:05,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:58:05,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2025-01-10 06:58:05,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 59 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 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-01-10 06:58:05,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:05,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2025-01-10 06:58:05,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:10,671 INFO L124 PetriNetUnfolderBase]: 63375/85663 cut-off events. [2025-01-10 06:58:10,671 INFO L125 PetriNetUnfolderBase]: For 19492/19492 co-relation queries the response was YES. [2025-01-10 06:58:10,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183496 conditions, 85663 events. 63375/85663 cut-off events. For 19492/19492 co-relation queries the response was YES. Maximal size of possible extension queue 2893. Compared 563022 event pairs, 24023 based on Foata normal form. 1360/86341 useless extension candidates. Maximal degree in co-relation 117967. Up to 61536 conditions per place. [2025-01-10 06:58:11,227 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 44 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2025-01-10 06:58:11,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 74 transitions, 332 flow [2025-01-10 06:58:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:58:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:58:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-01-10 06:58:11,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2025-01-10 06:58:11,228 INFO L175 Difference]: Start difference. First operand has 85 places, 59 transitions, 206 flow. Second operand 6 states and 204 transitions. [2025-01-10 06:58:11,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 74 transitions, 332 flow [2025-01-10 06:58:11,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 74 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:11,997 INFO L231 Difference]: Finished difference. Result has 88 places, 58 transitions, 210 flow [2025-01-10 06:58:11,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=88, PETRI_TRANSITIONS=58} [2025-01-10 06:58:11,997 INFO L279 CegarLoopForPetriNet]: 76 programPoint places, 12 predicate places. [2025-01-10 06:58:11,997 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 58 transitions, 210 flow [2025-01-10 06:58:11,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 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-01-10 06:58:11,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:11,997 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:11,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-10 06:58:11,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:58:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash 508318828, now seen corresponding path program 1 times [2025-01-10 06:58:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111142974] [2025-01-10 06:58:11,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:12,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:58:12,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:58:12,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:12,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:58:12,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:12,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111142974] [2025-01-10 06:58:12,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111142974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:12,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:12,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:58:12,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214015005] [2025-01-10 06:58:12,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:12,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:58:12,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:12,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:58:12,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:58:12,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2025-01-10 06:58:12,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 58 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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-01-10 06:58:12,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:12,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2025-01-10 06:58:12,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand