./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-100.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/unwind3-100.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 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:57:52,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:57:52,337 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:52,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:57:52,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:57:52,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:57:52,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:57:52,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:57:52,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:57:52,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:57:52,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:57:52,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:57:52,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:57:52,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:57:52,371 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:57:52,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:57:52,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:57:52,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:57:52,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:57:52,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:57:52,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:57:52,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:57:52,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:57:52,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:57:52,373 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:57:52,373 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:57:52,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:57:52,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:57:52,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:57:52,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:57:52,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:57:52,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:52,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:52,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:52,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:52,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:57:52,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:52,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:52,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:52,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:52,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:57:52,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:57:52,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:57:52,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:57:52,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:57:52,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:57:52,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:57:52,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:57:52,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:57:52,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:57:52,376 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 -> 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 [2025-01-10 06:57:52,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:57:52,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:57:52,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:57:52,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:57:52,621 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:57:52,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-01-10 06:57:53,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c7477be7/b08f7bb34ea640f7bfdf2dd2c2d2f84d/FLAG9ba90b612 [2025-01-10 06:57:54,309 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:57:54,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-01-10 06:57:54,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c7477be7/b08f7bb34ea640f7bfdf2dd2c2d2f84d/FLAG9ba90b612 [2025-01-10 06:57:54,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c7477be7/b08f7bb34ea640f7bfdf2dd2c2d2f84d [2025-01-10 06:57:54,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:57:54,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:57:54,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:54,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:57:54,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:57:54,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8fa3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54, skipping insertion in model container [2025-01-10 06:57:54,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:57:54,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:54,571 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:57:54,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:54,637 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:57:54,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54 WrapperNode [2025-01-10 06:57:54,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:54,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:54,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:57:54,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:57:54,642 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:54" (1/1) ... [2025-01-10 06:57:54,652 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:54" (1/1) ... [2025-01-10 06:57:54,667 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2025-01-10 06:57:54,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:54,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:57:54,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:57:54,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:57:54,674 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:54" (1/1) ... [2025-01-10 06:57:54,674 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:54" (1/1) ... [2025-01-10 06:57:54,676 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:54" (1/1) ... [2025-01-10 06:57:54,690 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:54,692 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:54" (1/1) ... [2025-01-10 06:57:54,693 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:54" (1/1) ... [2025-01-10 06:57:54,696 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:54" (1/1) ... [2025-01-10 06:57:54,696 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:54" (1/1) ... [2025-01-10 06:57:54,704 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:54" (1/1) ... [2025-01-10 06:57:54,706 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:54" (1/1) ... [2025-01-10 06:57:54,710 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:54" (1/1) ... [2025-01-10 06:57:54,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:57:54,712 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:57:54,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:57:54,712 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:57:54,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (1/1) ... [2025-01-10 06:57:54,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:54,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:54,754 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:54,757 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:54,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:57:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 06:57:54,780 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 06:57:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 06:57:54,780 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 06:57:54,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:57:54,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:57:54,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:57:54,782 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:54,887 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:57:54,889 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:57:55,022 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:57:55,024 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:57:55,110 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:57:55,111 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:57:55,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:55 BoogieIcfgContainer [2025-01-10 06:57:55,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:57:55,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:57:55,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:57:55,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:57:55,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:57:54" (1/3) ... [2025-01-10 06:57:55,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1858831f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:55, skipping insertion in model container [2025-01-10 06:57:55,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:54" (2/3) ... [2025-01-10 06:57:55,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1858831f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:55, skipping insertion in model container [2025-01-10 06:57:55,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:55" (3/3) ... [2025-01-10 06:57:55,120 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-01-10 06:57:55,138 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:57:55,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 32 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-01-10 06:57:55,140 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:57:55,196 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:55,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 74 flow [2025-01-10 06:57:55,265 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2025-01-10 06:57:55,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:55,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 47 events. 2/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2025-01-10 06:57:55,274 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 74 flow [2025-01-10 06:57:55,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 32 transitions, 71 flow [2025-01-10 06:57:55,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:55,291 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;@54446ea9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:55,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 06:57:55,299 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:55,300 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-10 06:57:55,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:55,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:55,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:55,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-01-10 06:57:55,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash -677132059, now seen corresponding path program 1 times [2025-01-10 06:57:55,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:55,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324567572] [2025-01-10 06:57:55,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:55,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:55,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:55,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,505 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:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324567572] [2025-01-10 06:57:55,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324567572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:55,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:55,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:55,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863800909] [2025-01-10 06:57:55,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:55,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:55,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:55,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:55,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:55,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2025-01-10 06:57:55,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:55,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:55,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2025-01-10 06:57:55,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:55,662 INFO L124 PetriNetUnfolderBase]: 92/234 cut-off events. [2025-01-10 06:57:55,662 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 06:57:55,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 234 events. 92/234 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1024 event pairs, 11 based on Foata normal form. 27/238 useless extension candidates. Maximal degree in co-relation 371. Up to 140 conditions per place. [2025-01-10 06:57:55,666 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 26 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2025-01-10 06:57:55,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 150 flow [2025-01-10 06:57:55,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:57:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:57:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-01-10 06:57:55,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-01-10 06:57:55,676 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 71 flow. Second operand 5 states and 97 transitions. [2025-01-10 06:57:55,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 150 flow [2025-01-10 06:57:55,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:55,680 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 72 flow [2025-01-10 06:57:55,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-01-10 06:57:55,684 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2025-01-10 06:57:55,684 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 72 flow [2025-01-10 06:57:55,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:55,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:55,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:55,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:57:55,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-01-10 06:57:55,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash -677132379, now seen corresponding path program 1 times [2025-01-10 06:57:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:55,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420996458] [2025-01-10 06:57:55,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:55,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:55,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:55,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,749 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:55,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:55,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420996458] [2025-01-10 06:57:55,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420996458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:55,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:55,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:55,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370382188] [2025-01-10 06:57:55,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:55,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:55,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:55,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:55,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:55,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 33 [2025-01-10 06:57:55,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:55,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:55,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 33 [2025-01-10 06:57:55,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:55,839 INFO L124 PetriNetUnfolderBase]: 44/156 cut-off events. [2025-01-10 06:57:55,840 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 06:57:55,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 156 events. 44/156 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 702 event pairs, 14 based on Foata normal form. 3/142 useless extension candidates. Maximal degree in co-relation 218. Up to 86 conditions per place. [2025-01-10 06:57:55,841 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 16 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-01-10 06:57:55,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 116 flow [2025-01-10 06:57:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-01-10 06:57:55,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2025-01-10 06:57:55,843 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 72 flow. Second operand 3 states and 69 transitions. [2025-01-10 06:57:55,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 116 flow [2025-01-10 06:57:55,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:55,845 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 76 flow [2025-01-10 06:57:55,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2025-01-10 06:57:55,846 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2025-01-10 06:57:55,846 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 76 flow [2025-01-10 06:57:55,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:55,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:55,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:55,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:57:55,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-01-10 06:57:55,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:55,847 INFO L85 PathProgramCache]: Analyzing trace with hash 482885909, now seen corresponding path program 1 times [2025-01-10 06:57:55,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:55,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379522593] [2025-01-10 06:57:55,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:55,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:57:55,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:57:55,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:55,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:55,935 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:55,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:55,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379522593] [2025-01-10 06:57:55,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379522593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:55,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:55,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:55,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372620966] [2025-01-10 06:57:55,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:55,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:55,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:55,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:55,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-01-10 06:57:55,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:55,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:55,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-01-10 06:57:55,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:55,994 INFO L124 PetriNetUnfolderBase]: 46/135 cut-off events. [2025-01-10 06:57:55,994 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:57:55,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 135 events. 46/135 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 555 event pairs, 14 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 247. Up to 84 conditions per place. [2025-01-10 06:57:55,996 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 16 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-01-10 06:57:55,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 116 flow [2025-01-10 06:57:55,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-01-10 06:57:55,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-01-10 06:57:55,997 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 76 flow. Second operand 4 states and 76 transitions. [2025-01-10 06:57:55,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 116 flow [2025-01-10 06:57:55,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:55,998 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 73 flow [2025-01-10 06:57:55,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-01-10 06:57:55,998 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2025-01-10 06:57:55,998 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 73 flow [2025-01-10 06:57:55,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:55,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:55,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:55,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:57:55,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-01-10 06:57:55,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:55,999 INFO L85 PathProgramCache]: Analyzing trace with hash 483742895, now seen corresponding path program 1 times [2025-01-10 06:57:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:55,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533145000] [2025-01-10 06:57:55,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:57:56,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:57:56,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:56,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:56,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533145000] [2025-01-10 06:57:56,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533145000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:56,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:56,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:56,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463310943] [2025-01-10 06:57:56,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:56,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:56,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:56,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:56,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:56,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2025-01-10 06:57:56,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:56,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:56,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2025-01-10 06:57:56,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:56,159 INFO L124 PetriNetUnfolderBase]: 56/146 cut-off events. [2025-01-10 06:57:56,159 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 06:57:56,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 146 events. 56/146 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 550 event pairs, 3 based on Foata normal form. 13/157 useless extension candidates. Maximal degree in co-relation 280. Up to 60 conditions per place. [2025-01-10 06:57:56,162 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 30 selfloop transitions, 3 changer transitions 3/46 dead transitions. [2025-01-10 06:57:56,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 46 transitions, 195 flow [2025-01-10 06:57:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:57:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:57:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-01-10 06:57:56,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-01-10 06:57:56,164 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 73 flow. Second operand 5 states and 105 transitions. [2025-01-10 06:57:56,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 46 transitions, 195 flow [2025-01-10 06:57:56,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 185 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:56,166 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 67 flow [2025-01-10 06:57:56,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2025-01-10 06:57:56,166 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2025-01-10 06:57:56,169 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 67 flow [2025-01-10 06:57:56,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:56,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:56,170 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:56,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:57:56,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-01-10 06:57:56,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:56,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1010912338, now seen corresponding path program 1 times [2025-01-10 06:57:56,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:56,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733493442] [2025-01-10 06:57:56,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:56,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:56,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:56,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:57:56,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:56,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:56,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:56,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:57:56,222 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:57:56,223 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-10 06:57:56,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-01-10 06:57:56,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-01-10 06:57:56,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 16 remaining) [2025-01-10 06:57:56,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-01-10 06:57:56,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-01-10 06:57:56,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-01-10 06:57:56,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-01-10 06:57:56,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-01-10 06:57:56,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-01-10 06:57:56,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-01-10 06:57:56,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-01-10 06:57:56,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-01-10 06:57:56,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-01-10 06:57:56,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-01-10 06:57:56,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-01-10 06:57:56,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:57:56,231 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 06:57:56,233 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:57:56,233 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:57:56,270 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:56,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 126 flow [2025-01-10 06:57:56,285 INFO L124 PetriNetUnfolderBase]: 3/75 cut-off events. [2025-01-10 06:57:56,285 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:57:56,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 75 events. 3/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 238 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 86. Up to 6 conditions per place. [2025-01-10 06:57:56,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 126 flow [2025-01-10 06:57:56,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 40 transitions, 93 flow [2025-01-10 06:57:56,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:56,291 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;@54446ea9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:56,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-10 06:57:56,295 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:56,295 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-10 06:57:56,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:56,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:56,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:56,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:56,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash 683862924, now seen corresponding path program 1 times [2025-01-10 06:57:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:56,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273035872] [2025-01-10 06:57:56,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:56,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:56,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,343 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:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273035872] [2025-01-10 06:57:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273035872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:56,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939753583] [2025-01-10 06:57:56,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:56,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:56,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:56,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:56,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:56,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2025-01-10 06:57:56,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:56,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:56,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2025-01-10 06:57:56,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:56,453 INFO L124 PetriNetUnfolderBase]: 263/659 cut-off events. [2025-01-10 06:57:56,453 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 06:57:56,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 659 events. 263/659 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4114 event pairs, 180 based on Foata normal form. 3/571 useless extension candidates. Maximal degree in co-relation 389. Up to 440 conditions per place. [2025-01-10 06:57:56,462 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 23 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2025-01-10 06:57:56,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 157 flow [2025-01-10 06:57:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-01-10 06:57:56,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2025-01-10 06:57:56,464 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 93 flow. Second operand 3 states and 112 transitions. [2025-01-10 06:57:56,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 157 flow [2025-01-10 06:57:56,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:56,465 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 113 flow [2025-01-10 06:57:56,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-01-10 06:57:56,466 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-01-10 06:57:56,466 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 113 flow [2025-01-10 06:57:56,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:56,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:56,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:56,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:57:56,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:56,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash 683863244, now seen corresponding path program 1 times [2025-01-10 06:57:56,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:56,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709641450] [2025-01-10 06:57:56,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:56,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:56,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,565 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:56,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:56,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709641450] [2025-01-10 06:57:56,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709641450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:56,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:56,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:56,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318971375] [2025-01-10 06:57:56,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:56,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:56,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:56,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:56,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:56,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 06:57:56,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:56,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:56,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 06:57:56,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:56,842 INFO L124 PetriNetUnfolderBase]: 962/1777 cut-off events. [2025-01-10 06:57:56,842 INFO L125 PetriNetUnfolderBase]: For 87/144 co-relation queries the response was YES. [2025-01-10 06:57:56,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3491 conditions, 1777 events. 962/1777 cut-off events. For 87/144 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10530 event pairs, 90 based on Foata normal form. 151/1812 useless extension candidates. Maximal degree in co-relation 3374. Up to 654 conditions per place. [2025-01-10 06:57:56,852 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 64 selfloop transitions, 7 changer transitions 0/87 dead transitions. [2025-01-10 06:57:56,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 371 flow [2025-01-10 06:57:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2025-01-10 06:57:56,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6477987421383647 [2025-01-10 06:57:56,855 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 113 flow. Second operand 6 states and 206 transitions. [2025-01-10 06:57:56,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 371 flow [2025-01-10 06:57:56,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 87 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:56,856 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 153 flow [2025-01-10 06:57:56,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-01-10 06:57:56,857 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2025-01-10 06:57:56,857 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 153 flow [2025-01-10 06:57:56,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:56,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:56,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:56,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:57:56,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:56,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:56,858 INFO L85 PathProgramCache]: Analyzing trace with hash -275895863, now seen corresponding path program 1 times [2025-01-10 06:57:56,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:56,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914731571] [2025-01-10 06:57:56,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:57:56,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:57:56,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,900 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:56,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:56,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914731571] [2025-01-10 06:57:56,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914731571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:56,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:56,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3669090] [2025-01-10 06:57:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:56,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:56,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:56,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:56,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2025-01-10 06:57:56,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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:56,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:56,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2025-01-10 06:57:56,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,051 INFO L124 PetriNetUnfolderBase]: 486/1022 cut-off events. [2025-01-10 06:57:57,052 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-01-10 06:57:57,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 1022 events. 486/1022 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6829 event pairs, 400 based on Foata normal form. 1/869 useless extension candidates. Maximal degree in co-relation 1521. Up to 796 conditions per place. [2025-01-10 06:57:57,059 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 24 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-01-10 06:57:57,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 215 flow [2025-01-10 06:57:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2025-01-10 06:57:57,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5801886792452831 [2025-01-10 06:57:57,060 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 153 flow. Second operand 4 states and 123 transitions. [2025-01-10 06:57:57,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 215 flow [2025-01-10 06:57:57,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:57,064 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 154 flow [2025-01-10 06:57:57,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2025-01-10 06:57:57,065 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2025-01-10 06:57:57,065 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 154 flow [2025-01-10 06:57:57,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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:57,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:57:57,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:57,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:57,067 INFO L85 PathProgramCache]: Analyzing trace with hash -275075619, now seen corresponding path program 1 times [2025-01-10 06:57:57,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:57,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163236084] [2025-01-10 06:57:57,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:57,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:57:57,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:57:57,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,118 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:57,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:57,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163236084] [2025-01-10 06:57:57,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163236084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:57,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:57,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:57,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095288042] [2025-01-10 06:57:57,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:57,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:57,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:57,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:57,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:57,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 06:57:57,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:57,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:57,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 06:57:57,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,277 INFO L124 PetriNetUnfolderBase]: 713/1322 cut-off events. [2025-01-10 06:57:57,277 INFO L125 PetriNetUnfolderBase]: For 633/720 co-relation queries the response was YES. [2025-01-10 06:57:57,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3081 conditions, 1322 events. 713/1322 cut-off events. For 633/720 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7347 event pairs, 125 based on Foata normal form. 77/1362 useless extension candidates. Maximal degree in co-relation 3007. Up to 633 conditions per place. [2025-01-10 06:57:57,284 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 60 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2025-01-10 06:57:57,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 402 flow [2025-01-10 06:57:57,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2025-01-10 06:57:57,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6320754716981132 [2025-01-10 06:57:57,285 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 154 flow. Second operand 6 states and 201 transitions. [2025-01-10 06:57:57,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 402 flow [2025-01-10 06:57:57,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 388 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:57,290 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 167 flow [2025-01-10 06:57:57,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2025-01-10 06:57:57,290 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2025-01-10 06:57:57,292 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 167 flow [2025-01-10 06:57:57,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:57,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,292 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:57:57,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:57,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:57,293 INFO L85 PathProgramCache]: Analyzing trace with hash 36821845, now seen corresponding path program 1 times [2025-01-10 06:57:57,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:57,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492592789] [2025-01-10 06:57:57,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:57,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:57:57,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:57:57,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,362 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:57,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:57,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492592789] [2025-01-10 06:57:57,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492592789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:57,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:57,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:57,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244056808] [2025-01-10 06:57:57,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:57,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:57,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:57,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:57,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:57,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2025-01-10 06:57:57,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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:57,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:57,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2025-01-10 06:57:57,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,515 INFO L124 PetriNetUnfolderBase]: 400/912 cut-off events. [2025-01-10 06:57:57,515 INFO L125 PetriNetUnfolderBase]: For 494/496 co-relation queries the response was YES. [2025-01-10 06:57:57,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 912 events. 400/912 cut-off events. For 494/496 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6109 event pairs, 158 based on Foata normal form. 16/823 useless extension candidates. Maximal degree in co-relation 940. Up to 475 conditions per place. [2025-01-10 06:57:57,519 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 27 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2025-01-10 06:57:57,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 257 flow [2025-01-10 06:57:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-10 06:57:57,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6650943396226415 [2025-01-10 06:57:57,520 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 167 flow. Second operand 4 states and 141 transitions. [2025-01-10 06:57:57,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 257 flow [2025-01-10 06:57:57,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 241 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:57,522 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 157 flow [2025-01-10 06:57:57,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2025-01-10 06:57:57,522 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2025-01-10 06:57:57,523 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 157 flow [2025-01-10 06:57:57,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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:57,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,523 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:57:57,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:57,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:57,523 INFO L85 PathProgramCache]: Analyzing trace with hash 36822389, now seen corresponding path program 1 times [2025-01-10 06:57:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:57,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818457262] [2025-01-10 06:57:57,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:57,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:57:57,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:57:57,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,571 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:57,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:57,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818457262] [2025-01-10 06:57:57,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818457262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:57,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:57,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:57,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181828020] [2025-01-10 06:57:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:57,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:57,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:57,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:57,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:57,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 06:57:57,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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:57,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:57,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 06:57:57,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,807 INFO L124 PetriNetUnfolderBase]: 914/1670 cut-off events. [2025-01-10 06:57:57,807 INFO L125 PetriNetUnfolderBase]: For 875/909 co-relation queries the response was YES. [2025-01-10 06:57:57,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3987 conditions, 1670 events. 914/1670 cut-off events. For 875/909 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9660 event pairs, 102 based on Foata normal form. 52/1700 useless extension candidates. Maximal degree in co-relation 2632. Up to 485 conditions per place. [2025-01-10 06:57:57,815 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 61 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2025-01-10 06:57:57,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 427 flow [2025-01-10 06:57:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2025-01-10 06:57:57,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6226415094339622 [2025-01-10 06:57:57,817 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 157 flow. Second operand 6 states and 198 transitions. [2025-01-10 06:57:57,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 427 flow [2025-01-10 06:57:57,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:57,823 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 214 flow [2025-01-10 06:57:57,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2025-01-10 06:57:57,824 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2025-01-10 06:57:57,824 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 214 flow [2025-01-10 06:57:57,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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:57,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,825 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:57:57,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:57,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:57,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1141477475, now seen corresponding path program 1 times [2025-01-10 06:57:57,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:57,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908320506] [2025-01-10 06:57:57,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:57,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:57:57,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:57:57,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,865 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:57,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:57,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908320506] [2025-01-10 06:57:57,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908320506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:57,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:57,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:57,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560436002] [2025-01-10 06:57:57,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:57,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:57,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:57,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:57,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:57,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2025-01-10 06:57:57,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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:57,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:57,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2025-01-10 06:57:57,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,961 INFO L124 PetriNetUnfolderBase]: 460/1074 cut-off events. [2025-01-10 06:57:57,962 INFO L125 PetriNetUnfolderBase]: For 362/362 co-relation queries the response was YES. [2025-01-10 06:57:57,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 1074 events. 460/1074 cut-off events. For 362/362 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7632 event pairs, 96 based on Foata normal form. 0/990 useless extension candidates. Maximal degree in co-relation 1651. Up to 668 conditions per place. [2025-01-10 06:57:57,966 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 29 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-01-10 06:57:57,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 58 transitions, 321 flow [2025-01-10 06:57:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-01-10 06:57:57,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6698113207547169 [2025-01-10 06:57:57,967 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 214 flow. Second operand 4 states and 142 transitions. [2025-01-10 06:57:57,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 58 transitions, 321 flow [2025-01-10 06:57:57,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 58 transitions, 318 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:57,969 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 225 flow [2025-01-10 06:57:57,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2025-01-10 06:57:57,970 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2025-01-10 06:57:57,970 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 225 flow [2025-01-10 06:57:57,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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:57,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:57:57,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:57,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:57,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1140637377, now seen corresponding path program 1 times [2025-01-10 06:57:57,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:57,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818687464] [2025-01-10 06:57:57,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:57,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:57:57,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:57:57,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:58,003 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,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818687464] [2025-01-10 06:57:58,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818687464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:58,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:58,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940754369] [2025-01-10 06:57:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:58,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:58,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:58,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:58,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:58,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 53 [2025-01-10 06:57:58,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:58,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 53 [2025-01-10 06:57:58,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:58,158 INFO L124 PetriNetUnfolderBase]: 855/1768 cut-off events. [2025-01-10 06:57:58,159 INFO L125 PetriNetUnfolderBase]: For 764/764 co-relation queries the response was YES. [2025-01-10 06:57:58,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3905 conditions, 1768 events. 855/1768 cut-off events. For 764/764 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12790 event pairs, 572 based on Foata normal form. 46/1691 useless extension candidates. Maximal degree in co-relation 2845. Up to 1012 conditions per place. [2025-01-10 06:57:58,164 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 37 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2025-01-10 06:57:58,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 365 flow [2025-01-10 06:57:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2025-01-10 06:57:58,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7075471698113207 [2025-01-10 06:57:58,165 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 225 flow. Second operand 4 states and 150 transitions. [2025-01-10 06:57:58,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 365 flow [2025-01-10 06:57:58,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 356 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:58,167 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 238 flow [2025-01-10 06:57:58,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2025-01-10 06:57:58,168 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2025-01-10 06:57:58,168 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 238 flow [2025-01-10 06:57:58,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:58,168 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:58,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:57:58,168 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:58,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1141494363, now seen corresponding path program 1 times [2025-01-10 06:57:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:58,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608268098] [2025-01-10 06:57:58,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:58,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:58,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:57:58,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:57:58,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:58,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:58,198 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,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:58,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608268098] [2025-01-10 06:57:58,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608268098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:58,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:58,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:58,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367454819] [2025-01-10 06:57:58,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:58,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:58,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:58,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:58,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:58,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 06:57:58,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:58,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 06:57:58,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:58,456 INFO L124 PetriNetUnfolderBase]: 1254/2310 cut-off events. [2025-01-10 06:57:58,457 INFO L125 PetriNetUnfolderBase]: For 3142/3278 co-relation queries the response was YES. [2025-01-10 06:57:58,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6549 conditions, 2310 events. 1254/2310 cut-off events. For 3142/3278 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14588 event pairs, 270 based on Foata normal form. 76/2360 useless extension candidates. Maximal degree in co-relation 4493. Up to 1142 conditions per place. [2025-01-10 06:57:58,492 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 69 selfloop transitions, 7 changer transitions 0/90 dead transitions. [2025-01-10 06:57:58,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 557 flow [2025-01-10 06:57:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2025-01-10 06:57:58,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6163522012578616 [2025-01-10 06:57:58,495 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 238 flow. Second operand 6 states and 196 transitions. [2025-01-10 06:57:58,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 557 flow [2025-01-10 06:57:58,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 534 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:58,509 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 238 flow [2025-01-10 06:57:58,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2025-01-10 06:57:58,511 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2025-01-10 06:57:58,511 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 238 flow [2025-01-10 06:57:58,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:58,511 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:58,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:57:58,511 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:58,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:58,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1743202377, now seen corresponding path program 1 times [2025-01-10 06:57:58,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425994466] [2025-01-10 06:57:58,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:58,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:58,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:58,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:58,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:58,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:57:58,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:58,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:58,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:58,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:58,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:57:58,543 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:57:58,543 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-01-10 06:57:58,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-01-10 06:57:58,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-01-10 06:57:58,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 22 remaining) [2025-01-10 06:57:58,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-01-10 06:57:58,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-01-10 06:57:58,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-01-10 06:57:58,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-01-10 06:57:58,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-01-10 06:57:58,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-01-10 06:57:58,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-01-10 06:57:58,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-01-10 06:57:58,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-01-10 06:57:58,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-01-10 06:57:58,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-01-10 06:57:58,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-01-10 06:57:58,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-01-10 06:57:58,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-01-10 06:57:58,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-01-10 06:57:58,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-01-10 06:57:58,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-01-10 06:57:58,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-01-10 06:57:58,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:57:58,546 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:58,546 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:57:58,547 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:57:58,581 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:58,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 182 flow [2025-01-10 06:57:58,588 INFO L124 PetriNetUnfolderBase]: 4/103 cut-off events. [2025-01-10 06:57:58,589 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:57:58,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 103 events. 4/103 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 338 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 120. Up to 8 conditions per place. [2025-01-10 06:57:58,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 73 transitions, 182 flow [2025-01-10 06:57:58,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 48 transitions, 117 flow [2025-01-10 06:57:58,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:58,591 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;@54446ea9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:58,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-01-10 06:57:58,592 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:58,592 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-10 06:57:58,592 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:58,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:58,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:58,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:57:58,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1088234745, now seen corresponding path program 1 times [2025-01-10 06:57:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:58,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150149786] [2025-01-10 06:57:58,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:58,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:58,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:58,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:58,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:58,632 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,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:58,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150149786] [2025-01-10 06:57:58,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150149786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:58,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:58,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:58,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373941365] [2025-01-10 06:57:58,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:58,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:58,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:58,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:58,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:58,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-01-10 06:57:58,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:58,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-01-10 06:57:58,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:59,261 INFO L124 PetriNetUnfolderBase]: 6854/10448 cut-off events. [2025-01-10 06:57:59,261 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2025-01-10 06:57:59,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20682 conditions, 10448 events. 6854/10448 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 66138 event pairs, 914 based on Foata normal form. 690/10383 useless extension candidates. Maximal degree in co-relation 13215. Up to 3601 conditions per place. [2025-01-10 06:57:59,313 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 78 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2025-01-10 06:57:59,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 107 transitions, 444 flow [2025-01-10 06:57:59,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 279 transitions. [2025-01-10 06:57:59,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.636986301369863 [2025-01-10 06:57:59,315 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 117 flow. Second operand 6 states and 279 transitions. [2025-01-10 06:57:59,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 107 transitions, 444 flow [2025-01-10 06:57:59,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 432 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:59,317 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 179 flow [2025-01-10 06:57:59,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-01-10 06:57:59,317 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2025-01-10 06:57:59,317 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 179 flow [2025-01-10 06:57:59,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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:59,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:59,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:59,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:57:59,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:57:59,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:59,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1088235513, now seen corresponding path program 1 times [2025-01-10 06:57:59,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:59,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834160695] [2025-01-10 06:57:59,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:59,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:59,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:59,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:59,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:59,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:59,341 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:59,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:59,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834160695] [2025-01-10 06:57:59,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834160695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:59,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:59,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:59,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039753068] [2025-01-10 06:57:59,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:59,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:59,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:59,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:59,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:59,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 73 [2025-01-10 06:57:59,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:59,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:59,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 73 [2025-01-10 06:57:59,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:59,672 INFO L124 PetriNetUnfolderBase]: 2859/6009 cut-off events. [2025-01-10 06:57:59,673 INFO L125 PetriNetUnfolderBase]: For 1187/1292 co-relation queries the response was YES. [2025-01-10 06:57:59,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11985 conditions, 6009 events. 2859/6009 cut-off events. For 1187/1292 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 53864 event pairs, 2211 based on Foata normal form. 33/4964 useless extension candidates. Maximal degree in co-relation 7341. Up to 3966 conditions per place. [2025-01-10 06:57:59,698 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 27 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-01-10 06:57:59,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 255 flow [2025-01-10 06:57:59,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-01-10 06:57:59,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6894977168949772 [2025-01-10 06:57:59,699 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 179 flow. Second operand 3 states and 151 transitions. [2025-01-10 06:57:59,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 255 flow [2025-01-10 06:57:59,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:59,702 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 199 flow [2025-01-10 06:57:59,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-01-10 06:57:59,703 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2025-01-10 06:57:59,703 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 199 flow [2025-01-10 06:57:59,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:59,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:59,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:59,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:57:59,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:57:59,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:59,704 INFO L85 PathProgramCache]: Analyzing trace with hash 623686099, now seen corresponding path program 1 times [2025-01-10 06:57:59,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:59,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436613473] [2025-01-10 06:57:59,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:59,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:59,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:57:59,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:57:59,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:59,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:59,728 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:59,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:59,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436613473] [2025-01-10 06:57:59,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436613473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:59,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:59,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466018777] [2025-01-10 06:57:59,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:59,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:59,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:59,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:59,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-01-10 06:57:59,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 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:59,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:59,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-01-10 06:57:59,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:00,183 INFO L124 PetriNetUnfolderBase]: 3273/6750 cut-off events. [2025-01-10 06:58:00,184 INFO L125 PetriNetUnfolderBase]: For 1543/1662 co-relation queries the response was YES. [2025-01-10 06:58:00,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13856 conditions, 6750 events. 3273/6750 cut-off events. For 1543/1662 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 60905 event pairs, 2563 based on Foata normal form. 35/5524 useless extension candidates. Maximal degree in co-relation 8469. Up to 4518 conditions per place. [2025-01-10 06:58:00,306 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 27 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2025-01-10 06:58:00,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 59 transitions, 266 flow [2025-01-10 06:58:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:58:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:58:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2025-01-10 06:58:00,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5684931506849316 [2025-01-10 06:58:00,311 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 199 flow. Second operand 4 states and 166 transitions. [2025-01-10 06:58:00,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 59 transitions, 266 flow [2025-01-10 06:58:00,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 59 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:00,313 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 198 flow [2025-01-10 06:58:00,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2025-01-10 06:58:00,318 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2025-01-10 06:58:00,318 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 198 flow [2025-01-10 06:58:00,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 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:58:00,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:00,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:00,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:58:00,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:00,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash 624461657, now seen corresponding path program 1 times [2025-01-10 06:58:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:00,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620842161] [2025-01-10 06:58:00,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:00,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:00,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:58:00,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:58:00,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:00,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:00,355 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:00,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:00,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620842161] [2025-01-10 06:58:00,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620842161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:00,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:00,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965024474] [2025-01-10 06:58:00,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:00,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:58:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:00,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:58:00,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:58:00,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-01-10 06:58:00,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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:00,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:00,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-01-10 06:58:00,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:00,958 INFO L124 PetriNetUnfolderBase]: 5443/8331 cut-off events. [2025-01-10 06:58:00,958 INFO L125 PetriNetUnfolderBase]: For 4531/5048 co-relation queries the response was YES. [2025-01-10 06:58:00,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20395 conditions, 8331 events. 5443/8331 cut-off events. For 4531/5048 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 51750 event pairs, 1175 based on Foata normal form. 401/8542 useless extension candidates. Maximal degree in co-relation 20320. Up to 4245 conditions per place. [2025-01-10 06:58:01,019 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 76 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2025-01-10 06:58:01,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 104 transitions, 531 flow [2025-01-10 06:58:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:58:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:58:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2025-01-10 06:58:01,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6187214611872146 [2025-01-10 06:58:01,021 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 198 flow. Second operand 6 states and 271 transitions. [2025-01-10 06:58:01,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 104 transitions, 531 flow [2025-01-10 06:58:01,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 516 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:58:01,026 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 223 flow [2025-01-10 06:58:01,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2025-01-10 06:58:01,026 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2025-01-10 06:58:01,027 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 223 flow [2025-01-10 06:58:01,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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:01,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:01,027 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:01,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:58:01,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:01,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:01,028 INFO L85 PathProgramCache]: Analyzing trace with hash 485541205, now seen corresponding path program 1 times [2025-01-10 06:58:01,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:01,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858524312] [2025-01-10 06:58:01,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:01,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:01,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:58:01,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:58:01,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:01,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:01,059 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:01,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:01,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858524312] [2025-01-10 06:58:01,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858524312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:01,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486619979] [2025-01-10 06:58:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:01,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:58:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:01,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:58:01,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:58:01,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 73 [2025-01-10 06:58:01,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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:58:01,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:01,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 73 [2025-01-10 06:58:01,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:01,425 INFO L124 PetriNetUnfolderBase]: 2661/5221 cut-off events. [2025-01-10 06:58:01,426 INFO L125 PetriNetUnfolderBase]: For 1833/1926 co-relation queries the response was YES. [2025-01-10 06:58:01,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10643 conditions, 5221 events. 2661/5221 cut-off events. For 1833/1926 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 44821 event pairs, 912 based on Foata normal form. 94/4481 useless extension candidates. Maximal degree in co-relation 5118. Up to 2721 conditions per place. [2025-01-10 06:58:01,456 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 32 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-01-10 06:58:01,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 327 flow [2025-01-10 06:58:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:58:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:58:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2025-01-10 06:58:01,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6643835616438356 [2025-01-10 06:58:01,458 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 223 flow. Second operand 4 states and 194 transitions. [2025-01-10 06:58:01,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 327 flow [2025-01-10 06:58:01,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 318 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 06:58:01,461 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 218 flow [2025-01-10 06:58:01,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2025-01-10 06:58:01,461 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2025-01-10 06:58:01,461 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 218 flow [2025-01-10 06:58:01,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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:58:01,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:01,462 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:01,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:58:01,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:01,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash 485541525, now seen corresponding path program 1 times [2025-01-10 06:58:01,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:01,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949678038] [2025-01-10 06:58:01,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:01,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:58:01,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:58:01,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:01,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:01,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949678038] [2025-01-10 06:58:01,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949678038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:01,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:01,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964853387] [2025-01-10 06:58:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:01,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:58:01,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:01,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:58:01,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:58:01,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-01-10 06:58:01,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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:01,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:01,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-01-10 06:58:01,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:02,208 INFO L124 PetriNetUnfolderBase]: 9524/14821 cut-off events. [2025-01-10 06:58:02,208 INFO L125 PetriNetUnfolderBase]: For 9351/9754 co-relation queries the response was YES. [2025-01-10 06:58:02,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36516 conditions, 14821 events. 9524/14821 cut-off events. For 9351/9754 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 103338 event pairs, 1828 based on Foata normal form. 442/14919 useless extension candidates. Maximal degree in co-relation 20374. Up to 5319 conditions per place. [2025-01-10 06:58:02,324 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 83 selfloop transitions, 15 changer transitions 0/117 dead transitions. [2025-01-10 06:58:02,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 117 transitions, 650 flow [2025-01-10 06:58:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:58:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:58:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2025-01-10 06:58:02,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6187214611872146 [2025-01-10 06:58:02,326 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 218 flow. Second operand 6 states and 271 transitions. [2025-01-10 06:58:02,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 117 transitions, 650 flow [2025-01-10 06:58:02,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 117 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:58:02,384 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 347 flow [2025-01-10 06:58:02,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2025-01-10 06:58:02,385 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2025-01-10 06:58:02,385 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 347 flow [2025-01-10 06:58:02,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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:02,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:02,386 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:02,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:58:02,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:02,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2128091476, now seen corresponding path program 1 times [2025-01-10 06:58:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:02,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169463738] [2025-01-10 06:58:02,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:02,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:58:02,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:58:02,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:02,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:02,419 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:02,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:02,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169463738] [2025-01-10 06:58:02,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169463738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:02,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:02,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816286926] [2025-01-10 06:58:02,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:02,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:58:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:02,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:58:02,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:58:02,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 73 [2025-01-10 06:58:02,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 347 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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:58:02,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:02,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 73 [2025-01-10 06:58:02,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:02,922 INFO L124 PetriNetUnfolderBase]: 4573/8312 cut-off events. [2025-01-10 06:58:02,922 INFO L125 PetriNetUnfolderBase]: For 2912/3058 co-relation queries the response was YES. [2025-01-10 06:58:02,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17661 conditions, 8312 events. 4573/8312 cut-off events. For 2912/3058 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 74109 event pairs, 3063 based on Foata normal form. 49/7042 useless extension candidates. Maximal degree in co-relation 10668. Up to 6616 conditions per place. [2025-01-10 06:58:02,997 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 35 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2025-01-10 06:58:02,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 79 transitions, 478 flow [2025-01-10 06:58:02,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:58:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:58:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2025-01-10 06:58:02,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6712328767123288 [2025-01-10 06:58:02,998 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 347 flow. Second operand 4 states and 196 transitions. [2025-01-10 06:58:02,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 79 transitions, 478 flow [2025-01-10 06:58:03,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 79 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:03,007 INFO L231 Difference]: Finished difference. Result has 79 places, 67 transitions, 372 flow [2025-01-10 06:58:03,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2025-01-10 06:58:03,008 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2025-01-10 06:58:03,008 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 372 flow [2025-01-10 06:58:03,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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:58:03,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:03,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:03,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:58:03,009 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:03,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:03,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2128872986, now seen corresponding path program 1 times [2025-01-10 06:58:03,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:03,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753315168] [2025-01-10 06:58:03,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:03,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:03,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:58:03,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:58:03,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:03,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:03,038 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:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753315168] [2025-01-10 06:58:03,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753315168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:03,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:03,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:03,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819513853] [2025-01-10 06:58:03,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:03,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:58:03,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:03,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:58:03,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:58:03,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 73 [2025-01-10 06:58:03,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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:03,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:03,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 73 [2025-01-10 06:58:03,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:03,851 INFO L124 PetriNetUnfolderBase]: 7911/15213 cut-off events. [2025-01-10 06:58:03,851 INFO L125 PetriNetUnfolderBase]: For 8600/9353 co-relation queries the response was YES. [2025-01-10 06:58:03,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33652 conditions, 15213 events. 7911/15213 cut-off events. For 8600/9353 co-relation queries the response was YES. Maximal size of possible extension queue 983. Compared 145062 event pairs, 5278 based on Foata normal form. 464/13659 useless extension candidates. Maximal degree in co-relation 20490. Up to 8063 conditions per place. [2025-01-10 06:58:03,945 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 45 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2025-01-10 06:58:03,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 88 transitions, 538 flow [2025-01-10 06:58:03,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:58:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:58:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-01-10 06:58:03,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.702054794520548 [2025-01-10 06:58:03,946 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 372 flow. Second operand 4 states and 205 transitions. [2025-01-10 06:58:03,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 88 transitions, 538 flow [2025-01-10 06:58:03,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 88 transitions, 529 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 06:58:03,969 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 385 flow [2025-01-10 06:58:03,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=385, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2025-01-10 06:58:03,969 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2025-01-10 06:58:03,969 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 385 flow [2025-01-10 06:58:03,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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:03,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:03,969 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:03,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:58:03,970 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:03,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2128081539, now seen corresponding path program 1 times [2025-01-10 06:58:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:03,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197429703] [2025-01-10 06:58:03,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:03,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:03,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:58:03,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:58:03,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:03,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:04,006 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:04,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197429703] [2025-01-10 06:58:04,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197429703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:04,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:04,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:04,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200849513] [2025-01-10 06:58:04,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:04,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:58:04,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:04,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:58:04,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:58:04,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-01-10 06:58:04,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 385 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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:04,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:04,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-01-10 06:58:04,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:05,452 INFO L124 PetriNetUnfolderBase]: 13599/21228 cut-off events. [2025-01-10 06:58:05,452 INFO L125 PetriNetUnfolderBase]: For 33974/36000 co-relation queries the response was YES. [2025-01-10 06:58:05,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62468 conditions, 21228 events. 13599/21228 cut-off events. For 33974/36000 co-relation queries the response was YES. Maximal size of possible extension queue 1101. Compared 157639 event pairs, 3940 based on Foata normal form. 798/21599 useless extension candidates. Maximal degree in co-relation 34995. Up to 10847 conditions per place. [2025-01-10 06:58:05,554 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 95 selfloop transitions, 11 changer transitions 0/125 dead transitions. [2025-01-10 06:58:05,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 848 flow [2025-01-10 06:58:05,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:58:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:58:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 266 transitions. [2025-01-10 06:58:05,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6073059360730594 [2025-01-10 06:58:05,555 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 385 flow. Second operand 6 states and 266 transitions. [2025-01-10 06:58:05,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 848 flow [2025-01-10 06:58:05,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 125 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:58:05,635 INFO L231 Difference]: Finished difference. Result has 85 places, 68 transitions, 395 flow [2025-01-10 06:58:05,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=85, PETRI_TRANSITIONS=68} [2025-01-10 06:58:05,636 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2025-01-10 06:58:05,636 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 68 transitions, 395 flow [2025-01-10 06:58:05,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:05,636 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:05,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:58:05,637 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:05,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:05,637 INFO L85 PathProgramCache]: Analyzing trace with hash -963327804, now seen corresponding path program 1 times [2025-01-10 06:58:05,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:05,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422146760] [2025-01-10 06:58:05,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:05,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:05,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:58:05,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:58:05,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:05,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:05,676 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,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:05,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422146760] [2025-01-10 06:58:05,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422146760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:05,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:05,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:58:05,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118546909] [2025-01-10 06:58:05,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:05,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:58:05,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:05,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:58:05,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:58:05,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 73 [2025-01-10 06:58:05,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 68 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 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,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:05,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 73 [2025-01-10 06:58:05,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:07,294 INFO L124 PetriNetUnfolderBase]: 16754/25600 cut-off events. [2025-01-10 06:58:07,294 INFO L125 PetriNetUnfolderBase]: For 41421/43783 co-relation queries the response was YES. [2025-01-10 06:58:07,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74365 conditions, 25600 events. 16754/25600 cut-off events. For 41421/43783 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 188238 event pairs, 2800 based on Foata normal form. 500/25844 useless extension candidates. Maximal degree in co-relation 73716. Up to 8407 conditions per place. [2025-01-10 06:58:07,420 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 165 selfloop transitions, 26 changer transitions 0/208 dead transitions. [2025-01-10 06:58:07,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 208 transitions, 1384 flow [2025-01-10 06:58:07,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:58:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:58:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 445 transitions. [2025-01-10 06:58:07,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095890410958904 [2025-01-10 06:58:07,422 INFO L175 Difference]: Start difference. First operand has 85 places, 68 transitions, 395 flow. Second operand 10 states and 445 transitions. [2025-01-10 06:58:07,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 208 transitions, 1384 flow [2025-01-10 06:58:07,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 208 transitions, 1377 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:58:07,586 INFO L231 Difference]: Finished difference. Result has 95 places, 79 transitions, 549 flow [2025-01-10 06:58:07,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=549, PETRI_PLACES=95, PETRI_TRANSITIONS=79} [2025-01-10 06:58:07,586 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2025-01-10 06:58:07,586 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 79 transitions, 549 flow [2025-01-10 06:58:07,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 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:07,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:07,587 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:07,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:58:07,587 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:07,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash 335496600, now seen corresponding path program 1 times [2025-01-10 06:58:07,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:07,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371420738] [2025-01-10 06:58:07,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:07,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:07,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:58:07,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:58:07,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:07,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:07,636 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:07,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371420738] [2025-01-10 06:58:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371420738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:07,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:07,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:58:07,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662514403] [2025-01-10 06:58:07,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:07,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:58:07,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:07,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:58:07,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:58:07,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 73 [2025-01-10 06:58:07,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 79 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 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:07,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:07,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 73 [2025-01-10 06:58:07,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:10,200 INFO L124 PetriNetUnfolderBase]: 17543/26699 cut-off events. [2025-01-10 06:58:10,201 INFO L125 PetriNetUnfolderBase]: For 62209/64581 co-relation queries the response was YES. [2025-01-10 06:58:10,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83037 conditions, 26699 events. 17543/26699 cut-off events. For 62209/64581 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 196254 event pairs, 3028 based on Foata normal form. 342/26701 useless extension candidates. Maximal degree in co-relation 63133. Up to 9478 conditions per place. [2025-01-10 06:58:10,366 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 168 selfloop transitions, 31 changer transitions 0/216 dead transitions. [2025-01-10 06:58:10,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 216 transitions, 1566 flow [2025-01-10 06:58:10,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:58:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:58:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 444 transitions. [2025-01-10 06:58:10,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6082191780821918 [2025-01-10 06:58:10,368 INFO L175 Difference]: Start difference. First operand has 95 places, 79 transitions, 549 flow. Second operand 10 states and 444 transitions. [2025-01-10 06:58:10,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 216 transitions, 1566 flow [2025-01-10 06:58:10,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 216 transitions, 1501 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-01-10 06:58:10,924 INFO L231 Difference]: Finished difference. Result has 102 places, 89 transitions, 667 flow [2025-01-10 06:58:10,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=667, PETRI_PLACES=102, PETRI_TRANSITIONS=89} [2025-01-10 06:58:10,925 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2025-01-10 06:58:10,925 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 89 transitions, 667 flow [2025-01-10 06:58:10,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 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:10,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:10,925 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:10,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:58:10,925 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:10,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:10,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1767617375, now seen corresponding path program 1 times [2025-01-10 06:58:10,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:10,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399940132] [2025-01-10 06:58:10,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:10,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:10,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:58:10,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:58:10,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:10,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:10,981 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:10,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:10,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399940132] [2025-01-10 06:58:10,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399940132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:10,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:10,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:58:10,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888775743] [2025-01-10 06:58:10,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:10,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:58:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:10,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:58:10,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:58:11,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-01-10 06:58:11,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 89 transitions, 667 flow. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 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,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:11,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-01-10 06:58:11,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:11,924 INFO L124 PetriNetUnfolderBase]: 7678/14183 cut-off events. [2025-01-10 06:58:11,925 INFO L125 PetriNetUnfolderBase]: For 11450/12292 co-relation queries the response was YES. [2025-01-10 06:58:11,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34173 conditions, 14183 events. 7678/14183 cut-off events. For 11450/12292 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 136239 event pairs, 5022 based on Foata normal form. 163/12882 useless extension candidates. Maximal degree in co-relation 28162. Up to 11071 conditions per place. [2025-01-10 06:58:11,990 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 38 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-01-10 06:58:11,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 100 transitions, 799 flow [2025-01-10 06:58:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:58:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:58:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2025-01-10 06:58:11,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5616438356164384 [2025-01-10 06:58:11,991 INFO L175 Difference]: Start difference. First operand has 102 places, 89 transitions, 667 flow. Second operand 5 states and 205 transitions. [2025-01-10 06:58:11,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 100 transitions, 799 flow [2025-01-10 06:58:12,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 100 transitions, 731 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-01-10 06:58:12,030 INFO L231 Difference]: Finished difference. Result has 101 places, 88 transitions, 606 flow [2025-01-10 06:58:12,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=606, PETRI_PLACES=101, PETRI_TRANSITIONS=88} [2025-01-10 06:58:12,030 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 44 predicate places. [2025-01-10 06:58:12,030 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 88 transitions, 606 flow [2025-01-10 06:58:12,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 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,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:12,031 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:12,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 06:58:12,031 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:12,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:12,031 INFO L85 PathProgramCache]: Analyzing trace with hash 544298138, now seen corresponding path program 1 times [2025-01-10 06:58:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:12,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944470838] [2025-01-10 06:58:12,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:12,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:12,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:58:12,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:58:12,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:12,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:12,084 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:12,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:12,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944470838] [2025-01-10 06:58:12,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944470838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:12,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:12,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:58:12,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954755839] [2025-01-10 06:58:12,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:12,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:58:12,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:12,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:58:12,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:58:12,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 73 [2025-01-10 06:58:12,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 88 transitions, 606 flow. Second operand has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 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,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:12,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 73 [2025-01-10 06:58:12,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:14,335 INFO L124 PetriNetUnfolderBase]: 17023/25822 cut-off events. [2025-01-10 06:58:14,336 INFO L125 PetriNetUnfolderBase]: For 64437/66967 co-relation queries the response was YES. [2025-01-10 06:58:14,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80997 conditions, 25822 events. 17023/25822 cut-off events. For 64437/66967 co-relation queries the response was YES. Maximal size of possible extension queue 1340. Compared 190122 event pairs, 3044 based on Foata normal form. 406/25919 useless extension candidates. Maximal degree in co-relation 80828. Up to 7325 conditions per place. [2025-01-10 06:58:14,514 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 203 selfloop transitions, 29 changer transitions 0/249 dead transitions. [2025-01-10 06:58:14,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 249 transitions, 1783 flow [2025-01-10 06:58:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:58:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:58:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 531 transitions. [2025-01-10 06:58:14,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6061643835616438 [2025-01-10 06:58:14,654 INFO L175 Difference]: Start difference. First operand has 101 places, 88 transitions, 606 flow. Second operand 12 states and 531 transitions. [2025-01-10 06:58:14,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 249 transitions, 1783 flow [2025-01-10 06:58:15,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 249 transitions, 1757 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:58:15,131 INFO L231 Difference]: Finished difference. Result has 108 places, 93 transitions, 711 flow [2025-01-10 06:58:15,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=711, PETRI_PLACES=108, PETRI_TRANSITIONS=93} [2025-01-10 06:58:15,132 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 51 predicate places. [2025-01-10 06:58:15,132 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 93 transitions, 711 flow [2025-01-10 06:58:15,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 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:15,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:15,132 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:15,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 06:58:15,133 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:15,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1223229096, now seen corresponding path program 1 times [2025-01-10 06:58:15,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:15,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082660914] [2025-01-10 06:58:15,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:15,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:58:15,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:58:15,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:15,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:15,179 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:15,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:15,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082660914] [2025-01-10 06:58:15,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082660914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:15,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:15,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:15,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695310451] [2025-01-10 06:58:15,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:15,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:58:15,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:15,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:58:15,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:58:15,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-01-10 06:58:15,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 93 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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:15,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:15,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-01-10 06:58:15,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:18,124 INFO L124 PetriNetUnfolderBase]: 22360/35429 cut-off events. [2025-01-10 06:58:18,124 INFO L125 PetriNetUnfolderBase]: For 85528/88616 co-relation queries the response was YES. [2025-01-10 06:58:18,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107103 conditions, 35429 events. 22360/35429 cut-off events. For 85528/88616 co-relation queries the response was YES. Maximal size of possible extension queue 1922. Compared 290643 event pairs, 4894 based on Foata normal form. 722/35667 useless extension candidates. Maximal degree in co-relation 88175. Up to 13479 conditions per place. [2025-01-10 06:58:18,417 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 119 selfloop transitions, 28 changer transitions 0/177 dead transitions. [2025-01-10 06:58:18,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 177 transitions, 1548 flow [2025-01-10 06:58:18,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:58:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:58:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 269 transitions. [2025-01-10 06:58:18,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6141552511415526 [2025-01-10 06:58:18,419 INFO L175 Difference]: Start difference. First operand has 108 places, 93 transitions, 711 flow. Second operand 6 states and 269 transitions. [2025-01-10 06:58:18,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 177 transitions, 1548 flow [2025-01-10 06:58:19,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 177 transitions, 1460 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-01-10 06:58:19,279 INFO L231 Difference]: Finished difference. Result has 111 places, 113 transitions, 980 flow [2025-01-10 06:58:19,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=980, PETRI_PLACES=111, PETRI_TRANSITIONS=113} [2025-01-10 06:58:19,280 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 54 predicate places. [2025-01-10 06:58:19,280 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 113 transitions, 980 flow [2025-01-10 06:58:19,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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:19,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:19,280 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:19,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 06:58:19,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:19,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1810460392, now seen corresponding path program 1 times [2025-01-10 06:58:19,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:19,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627715676] [2025-01-10 06:58:19,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:19,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:19,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:58:19,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:58:19,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:19,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:19,337 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:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:19,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627715676] [2025-01-10 06:58:19,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627715676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:19,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:19,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:58:19,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293276082] [2025-01-10 06:58:19,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:19,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:58:19,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:19,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:58:19,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:58:19,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 73 [2025-01-10 06:58:19,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 113 transitions, 980 flow. Second operand has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 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:19,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:19,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 73 [2025-01-10 06:58:19,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:21,992 INFO L124 PetriNetUnfolderBase]: 22670/35827 cut-off events. [2025-01-10 06:58:21,993 INFO L125 PetriNetUnfolderBase]: For 100211/103998 co-relation queries the response was YES. [2025-01-10 06:58:22,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115005 conditions, 35827 events. 22670/35827 cut-off events. For 100211/103998 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 293723 event pairs, 4330 based on Foata normal form. 794/36226 useless extension candidates. Maximal degree in co-relation 114828. Up to 9984 conditions per place. [2025-01-10 06:58:22,166 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 214 selfloop transitions, 39 changer transitions 0/271 dead transitions. [2025-01-10 06:58:22,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 271 transitions, 2207 flow [2025-01-10 06:58:22,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:58:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:58:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 531 transitions. [2025-01-10 06:58:22,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6061643835616438 [2025-01-10 06:58:22,167 INFO L175 Difference]: Start difference. First operand has 111 places, 113 transitions, 980 flow. Second operand 12 states and 531 transitions. [2025-01-10 06:58:22,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 271 transitions, 2207 flow [2025-01-10 06:58:22,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 271 transitions, 2206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:22,773 INFO L231 Difference]: Finished difference. Result has 121 places, 116 transitions, 1112 flow [2025-01-10 06:58:22,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1112, PETRI_PLACES=121, PETRI_TRANSITIONS=116} [2025-01-10 06:58:22,773 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 64 predicate places. [2025-01-10 06:58:22,774 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 116 transitions, 1112 flow [2025-01-10 06:58:22,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 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:22,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:22,774 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:22,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 06:58:22,774 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:22,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:22,775 INFO L85 PathProgramCache]: Analyzing trace with hash -734620199, now seen corresponding path program 1 times [2025-01-10 06:58:22,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:22,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933887511] [2025-01-10 06:58:22,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:22,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:22,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:58:22,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:58:22,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:22,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:22,808 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:22,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:22,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933887511] [2025-01-10 06:58:22,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933887511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:22,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:22,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:58:22,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120859747] [2025-01-10 06:58:22,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:22,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:58:22,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:22,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:58:22,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:58:22,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-01-10 06:58:22,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 116 transitions, 1112 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:22,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:22,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-01-10 06:58:22,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:24,176 INFO L124 PetriNetUnfolderBase]: 10348/20073 cut-off events. [2025-01-10 06:58:24,177 INFO L125 PetriNetUnfolderBase]: For 14420/14695 co-relation queries the response was YES. [2025-01-10 06:58:24,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47450 conditions, 20073 events. 10348/20073 cut-off events. For 14420/14695 co-relation queries the response was YES. Maximal size of possible extension queue 1891. Compared 208930 event pairs, 2649 based on Foata normal form. 102/18955 useless extension candidates. Maximal degree in co-relation 39726. Up to 13252 conditions per place. [2025-01-10 06:58:24,307 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 40 selfloop transitions, 6 changer transitions 0/129 dead transitions. [2025-01-10 06:58:24,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 129 transitions, 1284 flow [2025-01-10 06:58:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:58:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:58:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2025-01-10 06:58:24,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.565068493150685 [2025-01-10 06:58:24,309 INFO L175 Difference]: Start difference. First operand has 121 places, 116 transitions, 1112 flow. Second operand 4 states and 165 transitions. [2025-01-10 06:58:24,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 129 transitions, 1284 flow [2025-01-10 06:58:24,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 129 transitions, 1190 flow, removed 13 selfloop flow, removed 9 redundant places. [2025-01-10 06:58:24,394 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 1044 flow [2025-01-10 06:58:24,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1044, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2025-01-10 06:58:24,394 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 58 predicate places. [2025-01-10 06:58:24,394 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 1044 flow [2025-01-10 06:58:24,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:24,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:24,395 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:24,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 06:58:24,395 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:24,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash -734603311, now seen corresponding path program 1 times [2025-01-10 06:58:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:24,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033510084] [2025-01-10 06:58:24,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:24,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:24,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:58:24,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:58:24,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:24,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:24,423 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:24,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:24,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033510084] [2025-01-10 06:58:24,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033510084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:24,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:24,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:24,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818866659] [2025-01-10 06:58:24,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:24,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:58:24,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:24,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:58:24,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:58:24,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-01-10 06:58:24,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 1044 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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:24,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:24,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-01-10 06:58:24,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:26,726 INFO L124 PetriNetUnfolderBase]: 21126/33676 cut-off events. [2025-01-10 06:58:26,726 INFO L125 PetriNetUnfolderBase]: For 95848/98254 co-relation queries the response was YES. [2025-01-10 06:58:26,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109577 conditions, 33676 events. 21126/33676 cut-off events. For 95848/98254 co-relation queries the response was YES. Maximal size of possible extension queue 1846. Compared 277844 event pairs, 6908 based on Foata normal form. 760/33877 useless extension candidates. Maximal degree in co-relation 92019. Up to 16521 conditions per place. [2025-01-10 06:58:26,953 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 129 selfloop transitions, 15 changer transitions 0/172 dead transitions. [2025-01-10 06:58:26,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 172 transitions, 1658 flow [2025-01-10 06:58:26,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:58:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:58:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 264 transitions. [2025-01-10 06:58:26,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6027397260273972 [2025-01-10 06:58:26,954 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 1044 flow. Second operand 6 states and 264 transitions. [2025-01-10 06:58:26,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 172 transitions, 1658 flow [2025-01-10 06:58:27,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 172 transitions, 1637 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:58:27,651 INFO L231 Difference]: Finished difference. Result has 117 places, 115 transitions, 1057 flow [2025-01-10 06:58:27,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1057, PETRI_PLACES=117, PETRI_TRANSITIONS=115} [2025-01-10 06:58:27,652 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 60 predicate places. [2025-01-10 06:58:27,652 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 115 transitions, 1057 flow [2025-01-10 06:58:27,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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:27,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:27,652 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:27,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-10 06:58:27,652 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:27,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1595362959, now seen corresponding path program 1 times [2025-01-10 06:58:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740733544] [2025-01-10 06:58:27,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:27,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:58:27,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:58:27,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:27,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:58:27,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:58:27,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:58:27,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:58:27,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:27,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:58:27,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:58:27,663 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:58:27,663 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 28 remaining) [2025-01-10 06:58:27,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2025-01-10 06:58:27,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2025-01-10 06:58:27,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2025-01-10 06:58:27,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2025-01-10 06:58:27,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-10 06:58:27,665 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:27,665 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:58:27,665 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 06:58:27,690 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:58:27,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 93 transitions, 242 flow [2025-01-10 06:58:27,694 INFO L124 PetriNetUnfolderBase]: 5/131 cut-off events. [2025-01-10 06:58:27,694 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 06:58:27,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 131 events. 5/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 155. Up to 10 conditions per place. [2025-01-10 06:58:27,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 93 transitions, 242 flow [2025-01-10 06:58:27,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 56 transitions, 143 flow [2025-01-10 06:58:27,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:58:27,696 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;@54446ea9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:58:27,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-01-10 06:58:27,697 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:58:27,697 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-10 06:58:27,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:58:27,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:27,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:27,697 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 31 more)] === [2025-01-10 06:58:27,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:27,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1698460074, now seen corresponding path program 1 times [2025-01-10 06:58:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:27,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672826954] [2025-01-10 06:58:27,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:27,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:58:27,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:58:27,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:27,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:27,716 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:27,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:27,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672826954] [2025-01-10 06:58:27,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672826954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:27,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:27,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:27,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542106048] [2025-01-10 06:58:27,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:27,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:58:27,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:27,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:58:27,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:58:27,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 93 [2025-01-10 06:58:27,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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:27,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:27,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 93 [2025-01-10 06:58:27,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:29,869 INFO L124 PetriNetUnfolderBase]: 39926/54246 cut-off events. [2025-01-10 06:58:29,869 INFO L125 PetriNetUnfolderBase]: For 2575/2575 co-relation queries the response was YES. [2025-01-10 06:58:30,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109465 conditions, 54246 events. 39926/54246 cut-off events. For 2575/2575 co-relation queries the response was YES. Maximal size of possible extension queue 2298. Compared 342976 event pairs, 7002 based on Foata normal form. 2958/53978 useless extension candidates. Maximal degree in co-relation 49567. Up to 21801 conditions per place. [2025-01-10 06:58:30,263 INFO L140 encePairwiseOnDemand]: 83/93 looper letters, 91 selfloop transitions, 11 changer transitions 0/126 dead transitions. [2025-01-10 06:58:30,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 126 transitions, 549 flow [2025-01-10 06:58:30,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:58:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:58:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 348 transitions. [2025-01-10 06:58:30,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2025-01-10 06:58:30,265 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 143 flow. Second operand 6 states and 348 transitions. [2025-01-10 06:58:30,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 126 transitions, 549 flow [2025-01-10 06:58:30,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 126 transitions, 521 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:30,270 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 217 flow [2025-01-10 06:58:30,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2025-01-10 06:58:30,271 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 7 predicate places. [2025-01-10 06:58:30,271 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 217 flow [2025-01-10 06:58:30,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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:30,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:30,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:30,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-10 06:58:30,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 31 more)] === [2025-01-10 06:58:30,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:30,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1698460394, now seen corresponding path program 1 times [2025-01-10 06:58:30,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:30,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014020176] [2025-01-10 06:58:30,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:30,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:30,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:58:30,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:58:30,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:30,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:30,293 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:30,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:30,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014020176] [2025-01-10 06:58:30,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014020176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:30,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:30,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:58:30,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378743938] [2025-01-10 06:58:30,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:30,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:58:30,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:30,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:58:30,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:58:30,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 93 [2025-01-10 06:58:30,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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:30,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:30,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 93 [2025-01-10 06:58:30,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:31,838 INFO L124 PetriNetUnfolderBase]: 16038/30845 cut-off events. [2025-01-10 06:58:31,838 INFO L125 PetriNetUnfolderBase]: For 5964/7188 co-relation queries the response was YES. [2025-01-10 06:58:31,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61758 conditions, 30845 events. 16038/30845 cut-off events. For 5964/7188 co-relation queries the response was YES. Maximal size of possible extension queue 2083. Compared 317621 event pairs, 13162 based on Foata normal form. 213/25084 useless extension candidates. Maximal degree in co-relation 34171. Up to 19725 conditions per place. [2025-01-10 06:58:32,012 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 30 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2025-01-10 06:58:32,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 70 transitions, 299 flow [2025-01-10 06:58:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:58:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:58:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2025-01-10 06:58:32,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6810035842293907 [2025-01-10 06:58:32,013 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 217 flow. Second operand 3 states and 190 transitions. [2025-01-10 06:58:32,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 70 transitions, 299 flow [2025-01-10 06:58:32,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 70 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:32,028 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 237 flow [2025-01-10 06:58:32,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2025-01-10 06:58:32,028 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 9 predicate places. [2025-01-10 06:58:32,028 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 237 flow [2025-01-10 06:58:32,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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:32,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:32,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:32,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-10 06:58:32,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 31 more)] === [2025-01-10 06:58:32,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:32,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1113368270, now seen corresponding path program 1 times [2025-01-10 06:58:32,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:32,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644076143] [2025-01-10 06:58:32,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:32,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:32,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:58:32,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:58:32,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:32,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:32,047 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:32,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:32,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644076143] [2025-01-10 06:58:32,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644076143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:32,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:32,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:32,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163690714] [2025-01-10 06:58:32,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:32,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:58:32,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:32,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:58:32,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:58:32,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 93 [2025-01-10 06:58:32,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:32,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:32,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 93 [2025-01-10 06:58:32,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:33,890 INFO L124 PetriNetUnfolderBase]: 18328/34904 cut-off events. [2025-01-10 06:58:33,890 INFO L125 PetriNetUnfolderBase]: For 7596/9022 co-relation queries the response was YES. [2025-01-10 06:58:33,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71359 conditions, 34904 events. 18328/34904 cut-off events. For 7596/9022 co-relation queries the response was YES. Maximal size of possible extension queue 2266. Compared 362914 event pairs, 15166 based on Foata normal form. 239/28164 useless extension candidates. Maximal degree in co-relation 39510. Up to 22497 conditions per place. [2025-01-10 06:58:34,119 INFO L140 encePairwiseOnDemand]: 89/93 looper letters, 30 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2025-01-10 06:58:34,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 69 transitions, 310 flow [2025-01-10 06:58:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:58:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:58:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2025-01-10 06:58:34,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5618279569892473 [2025-01-10 06:58:34,120 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 237 flow. Second operand 4 states and 209 transitions. [2025-01-10 06:58:34,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 69 transitions, 310 flow [2025-01-10 06:58:34,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 69 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:34,130 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 236 flow [2025-01-10 06:58:34,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2025-01-10 06:58:34,131 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 11 predicate places. [2025-01-10 06:58:34,131 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 236 flow [2025-01-10 06:58:34,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:34,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:34,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:34,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-10 06:58:34,131 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 31 more)] === [2025-01-10 06:58:34,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:34,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1112654279, now seen corresponding path program 1 times [2025-01-10 06:58:34,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:34,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489466059] [2025-01-10 06:58:34,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:34,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:34,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:58:34,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:58:34,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:34,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:34,155 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:34,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:34,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489466059] [2025-01-10 06:58:34,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489466059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:34,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:34,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:34,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100941319] [2025-01-10 06:58:34,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:34,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:58:34,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:34,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:58:34,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:58:34,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 93 [2025-01-10 06:58:34,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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:34,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:34,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 93 [2025-01-10 06:58:34,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:36,463 INFO L124 PetriNetUnfolderBase]: 32727/45177 cut-off events. [2025-01-10 06:58:36,464 INFO L125 PetriNetUnfolderBase]: For 25904/27929 co-relation queries the response was YES. [2025-01-10 06:58:36,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113674 conditions, 45177 events. 32727/45177 cut-off events. For 25904/27929 co-relation queries the response was YES. Maximal size of possible extension queue 1882. Compared 290280 event pairs, 8111 based on Foata normal form. 1441/46121 useless extension candidates. Maximal degree in co-relation 113598. Up to 23569 conditions per place. [2025-01-10 06:58:36,701 INFO L140 encePairwiseOnDemand]: 84/93 looper letters, 89 selfloop transitions, 10 changer transitions 0/123 dead transitions. [2025-01-10 06:58:36,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 123 transitions, 640 flow [2025-01-10 06:58:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:58:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:58:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 339 transitions. [2025-01-10 06:58:36,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2025-01-10 06:58:36,703 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 236 flow. Second operand 6 states and 339 transitions. [2025-01-10 06:58:36,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 123 transitions, 640 flow [2025-01-10 06:58:36,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 123 transitions, 624 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:58:36,710 INFO L231 Difference]: Finished difference. Result has 79 places, 67 transitions, 273 flow [2025-01-10 06:58:36,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2025-01-10 06:58:36,711 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 12 predicate places. [2025-01-10 06:58:36,711 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 273 flow [2025-01-10 06:58:36,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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:36,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:36,711 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:36,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-10 06:58:36,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 31 more)] === [2025-01-10 06:58:36,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2124652971, now seen corresponding path program 1 times [2025-01-10 06:58:36,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:36,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877556778] [2025-01-10 06:58:36,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:36,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:36,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:58:36,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:58:36,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:36,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:36,731 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:36,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:36,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877556778] [2025-01-10 06:58:36,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877556778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:36,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:36,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:36,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201976244] [2025-01-10 06:58:36,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:36,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:58:36,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:36,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:58:36,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:58:36,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 93 [2025-01-10 06:58:36,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 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:36,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:36,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 93 [2025-01-10 06:58:36,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand