./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/fibonacci.wvr.c --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/weaver/fibonacci.wvr.c -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 115f061be4541a19227bc1624a8b38d08b679b43ee58fd41d4a05fa6a8fd007e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:51:05,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:51:05,565 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:51:05,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:51:05,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:51:05,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:51:05,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:51:05,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:51:05,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:51:05,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:51:05,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:51:05,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:51:05,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:51:05,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:51:05,587 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:51:05,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:51:05,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:51:05,588 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:51:05,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:51:05,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:51:05,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:51:05,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:51:05,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:51:05,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:51:05,588 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:51:05,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:51:05,589 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:51:05,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:51:05,589 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:51:05,589 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:51:05,589 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:51:05,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:51:05,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:51:05,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:51:05,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:05,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:51:05,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:51:05,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:51:05,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:51:05,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:05,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:51:05,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:51:05,590 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:51:05,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:51:05,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:51:05,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:51:05,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:51:05,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:51:05,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:51:05,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:51:05,591 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 -> 115f061be4541a19227bc1624a8b38d08b679b43ee58fd41d4a05fa6a8fd007e [2025-01-10 06:51:05,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:51:05,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:51:05,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:51:05,843 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:51:05,843 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:51:05,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/fibonacci.wvr.c [2025-01-10 06:51:07,008 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcd1d21ab/28964b49b6e640eda500b812399a3226/FLAG68da41614 [2025-01-10 06:51:07,320 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:51:07,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/fibonacci.wvr.c [2025-01-10 06:51:07,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcd1d21ab/28964b49b6e640eda500b812399a3226/FLAG68da41614 [2025-01-10 06:51:07,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcd1d21ab/28964b49b6e640eda500b812399a3226 [2025-01-10 06:51:07,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:51:07,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:51:07,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:51:07,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:51:07,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:51:07,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fe6369c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07, skipping insertion in model container [2025-01-10 06:51:07,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:51:07,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:51:07,734 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:51:07,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:51:07,761 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:51:07,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07 WrapperNode [2025-01-10 06:51:07,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:51:07,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:51:07,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:51:07,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:51:07,768 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:51:07" (1/1) ... [2025-01-10 06:51:07,773 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:51:07" (1/1) ... [2025-01-10 06:51:07,790 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 216 [2025-01-10 06:51:07,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:51:07,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:51:07,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:51:07,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:51:07,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,810 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:51:07,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,814 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:51:07,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:51:07,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:51:07,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:51:07,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07" (1/1) ... [2025-01-10 06:51:07,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:07,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:07,844 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:51:07,846 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:51:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:51:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:51:07,861 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:51:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:51:07,861 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:51:07,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:51:07,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:51:07,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:51:07,863 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:51:07,921 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:51:07,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:51:08,213 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:51:08,213 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:51:08,434 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:51:08,437 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:51:08,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:51:08 BoogieIcfgContainer [2025-01-10 06:51:08,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:51:08,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:51:08,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:51:08,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:51:08,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:51:07" (1/3) ... [2025-01-10 06:51:08,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0f2380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:51:08, skipping insertion in model container [2025-01-10 06:51:08,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:07" (2/3) ... [2025-01-10 06:51:08,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0f2380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:51:08, skipping insertion in model container [2025-01-10 06:51:08,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:51:08" (3/3) ... [2025-01-10 06:51:08,447 INFO L128 eAbstractionObserver]: Analyzing ICFG fibonacci.wvr.c [2025-01-10 06:51:08,483 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:51:08,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibonacci.wvr.c that has 3 procedures, 87 locations, 1 initial locations, 2 loop locations, and 28 error locations. [2025-01-10 06:51:08,486 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:51:08,554 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:51:08,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 96 transitions, 206 flow [2025-01-10 06:51:08,632 INFO L124 PetriNetUnfolderBase]: 10/94 cut-off events. [2025-01-10 06:51:08,636 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:51:08,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 94 events. 10/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 301 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2025-01-10 06:51:08,641 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 96 transitions, 206 flow [2025-01-10 06:51:08,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 92 transitions, 193 flow [2025-01-10 06:51:08,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:51:08,667 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;@1a6efb3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:51:08,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-01-10 06:51:08,676 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:51:08,676 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-01-10 06:51:08,677 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:51:08,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:08,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:51:08,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:08,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash -958108365, now seen corresponding path program 1 times [2025-01-10 06:51:08,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:08,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602556084] [2025-01-10 06:51:08,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:08,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:08,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:51:08,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:51:08,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:08,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:08,836 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:51:08,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:08,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602556084] [2025-01-10 06:51:08,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602556084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:08,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:08,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:08,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128309177] [2025-01-10 06:51:08,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:08,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:08,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:08,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:08,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:08,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 96 [2025-01-10 06:51:08,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 92 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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:51:08,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:08,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 96 [2025-01-10 06:51:08,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:09,279 INFO L124 PetriNetUnfolderBase]: 1063/2550 cut-off events. [2025-01-10 06:51:09,280 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-10 06:51:09,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4200 conditions, 2550 events. 1063/2550 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 19116 event pairs, 412 based on Foata normal form. 60/2083 useless extension candidates. Maximal degree in co-relation 4124. Up to 929 conditions per place. [2025-01-10 06:51:09,298 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 72 selfloop transitions, 5 changer transitions 0/129 dead transitions. [2025-01-10 06:51:09,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 129 transitions, 427 flow [2025-01-10 06:51:09,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 296 transitions. [2025-01-10 06:51:09,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-01-10 06:51:09,314 INFO L175 Difference]: Start difference. First operand has 89 places, 92 transitions, 193 flow. Second operand 4 states and 296 transitions. [2025-01-10 06:51:09,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 129 transitions, 427 flow [2025-01-10 06:51:09,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 129 transitions, 420 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:09,321 INFO L231 Difference]: Finished difference. Result has 91 places, 94 transitions, 222 flow [2025-01-10 06:51:09,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=91, PETRI_TRANSITIONS=94} [2025-01-10 06:51:09,329 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 2 predicate places. [2025-01-10 06:51:09,329 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 94 transitions, 222 flow [2025-01-10 06:51:09,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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:51:09,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:09,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:09,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:51:09,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:09,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:09,330 INFO L85 PathProgramCache]: Analyzing trace with hash 363412511, now seen corresponding path program 1 times [2025-01-10 06:51:09,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:09,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568597917] [2025-01-10 06:51:09,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:09,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:09,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:51:09,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:51:09,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:09,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:09,421 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:51:09,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:09,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568597917] [2025-01-10 06:51:09,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568597917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:09,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:09,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:09,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685993239] [2025-01-10 06:51:09,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:09,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:09,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:09,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:09,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 96 [2025-01-10 06:51:09,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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:51:09,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:09,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 96 [2025-01-10 06:51:09,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:09,690 INFO L124 PetriNetUnfolderBase]: 873/2206 cut-off events. [2025-01-10 06:51:09,691 INFO L125 PetriNetUnfolderBase]: For 372/380 co-relation queries the response was YES. [2025-01-10 06:51:09,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 2206 events. 873/2206 cut-off events. For 372/380 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 16167 event pairs, 302 based on Foata normal form. 8/1863 useless extension candidates. Maximal degree in co-relation 2162. Up to 662 conditions per place. [2025-01-10 06:51:09,704 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 50 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2025-01-10 06:51:09,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 110 transitions, 364 flow [2025-01-10 06:51:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 281 transitions. [2025-01-10 06:51:09,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7317708333333334 [2025-01-10 06:51:09,707 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 222 flow. Second operand 4 states and 281 transitions. [2025-01-10 06:51:09,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 110 transitions, 364 flow [2025-01-10 06:51:09,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 110 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:09,711 INFO L231 Difference]: Finished difference. Result has 93 places, 93 transitions, 228 flow [2025-01-10 06:51:09,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=93, PETRI_TRANSITIONS=93} [2025-01-10 06:51:09,712 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 4 predicate places. [2025-01-10 06:51:09,712 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 228 flow [2025-01-10 06:51:09,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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:51:09,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:09,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:09,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:51:09,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:09,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1619145065, now seen corresponding path program 1 times [2025-01-10 06:51:09,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:09,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283383448] [2025-01-10 06:51:09,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:09,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:09,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:51:09,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:51:09,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:09,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:09,764 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:51:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:09,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283383448] [2025-01-10 06:51:09,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283383448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:09,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:09,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:09,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518689447] [2025-01-10 06:51:09,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:09,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:09,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:09,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:09,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:09,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 96 [2025-01-10 06:51:09,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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:51:09,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:09,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 96 [2025-01-10 06:51:09,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:09,998 INFO L124 PetriNetUnfolderBase]: 881/2192 cut-off events. [2025-01-10 06:51:09,998 INFO L125 PetriNetUnfolderBase]: For 685/693 co-relation queries the response was YES. [2025-01-10 06:51:10,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 2192 events. 881/2192 cut-off events. For 685/693 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 15901 event pairs, 302 based on Foata normal form. 38/1879 useless extension candidates. Maximal degree in co-relation 2250. Up to 662 conditions per place. [2025-01-10 06:51:10,013 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 51 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-01-10 06:51:10,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 109 transitions, 370 flow [2025-01-10 06:51:10,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2025-01-10 06:51:10,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7213541666666666 [2025-01-10 06:51:10,015 INFO L175 Difference]: Start difference. First operand has 93 places, 93 transitions, 228 flow. Second operand 4 states and 277 transitions. [2025-01-10 06:51:10,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 109 transitions, 370 flow [2025-01-10 06:51:10,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 109 transitions, 362 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:10,020 INFO L231 Difference]: Finished difference. Result has 92 places, 92 transitions, 224 flow [2025-01-10 06:51:10,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=92, PETRI_TRANSITIONS=92} [2025-01-10 06:51:10,021 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 3 predicate places. [2025-01-10 06:51:10,021 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 92 transitions, 224 flow [2025-01-10 06:51:10,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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:51:10,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:10,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:10,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:51:10,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:10,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1783084236, now seen corresponding path program 1 times [2025-01-10 06:51:10,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:10,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086939883] [2025-01-10 06:51:10,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:10,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:51:10,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:51:10,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:10,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:10,071 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:51:10,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:10,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086939883] [2025-01-10 06:51:10,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086939883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:10,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:10,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:10,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601511144] [2025-01-10 06:51:10,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:10,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:10,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:10,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:10,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:10,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 96 [2025-01-10 06:51:10,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 92 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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:51:10,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:10,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 96 [2025-01-10 06:51:10,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:10,410 INFO L124 PetriNetUnfolderBase]: 1246/2933 cut-off events. [2025-01-10 06:51:10,410 INFO L125 PetriNetUnfolderBase]: For 809/844 co-relation queries the response was YES. [2025-01-10 06:51:10,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5351 conditions, 2933 events. 1246/2933 cut-off events. For 809/844 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 22714 event pairs, 474 based on Foata normal form. 101/2503 useless extension candidates. Maximal degree in co-relation 2716. Up to 1128 conditions per place. [2025-01-10 06:51:10,422 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 76 selfloop transitions, 5 changer transitions 0/131 dead transitions. [2025-01-10 06:51:10,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 131 transitions, 514 flow [2025-01-10 06:51:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 294 transitions. [2025-01-10 06:51:10,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.765625 [2025-01-10 06:51:10,423 INFO L175 Difference]: Start difference. First operand has 92 places, 92 transitions, 224 flow. Second operand 4 states and 294 transitions. [2025-01-10 06:51:10,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 131 transitions, 514 flow [2025-01-10 06:51:10,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 131 transitions, 494 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:10,427 INFO L231 Difference]: Finished difference. Result has 94 places, 94 transitions, 250 flow [2025-01-10 06:51:10,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=94, PETRI_TRANSITIONS=94} [2025-01-10 06:51:10,428 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 5 predicate places. [2025-01-10 06:51:10,428 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 94 transitions, 250 flow [2025-01-10 06:51:10,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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:51:10,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:10,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:10,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:51:10,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:10,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1346110273, now seen corresponding path program 1 times [2025-01-10 06:51:10,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:10,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865823993] [2025-01-10 06:51:10,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:10,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:10,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:51:10,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:51:10,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:10,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:10,517 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:51:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865823993] [2025-01-10 06:51:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865823993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:10,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:10,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:10,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083192958] [2025-01-10 06:51:10,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:10,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:10,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:10,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:10,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 96 [2025-01-10 06:51:10,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 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:51:10,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:10,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 96 [2025-01-10 06:51:10,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:10,780 INFO L124 PetriNetUnfolderBase]: 1330/2890 cut-off events. [2025-01-10 06:51:10,780 INFO L125 PetriNetUnfolderBase]: For 769/810 co-relation queries the response was YES. [2025-01-10 06:51:10,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5842 conditions, 2890 events. 1330/2890 cut-off events. For 769/810 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20771 event pairs, 386 based on Foata normal form. 23/2635 useless extension candidates. Maximal degree in co-relation 3442. Up to 877 conditions per place. [2025-01-10 06:51:10,793 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 74 selfloop transitions, 6 changer transitions 0/131 dead transitions. [2025-01-10 06:51:10,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 131 transitions, 524 flow [2025-01-10 06:51:10,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 349 transitions. [2025-01-10 06:51:10,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7270833333333333 [2025-01-10 06:51:10,795 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 250 flow. Second operand 5 states and 349 transitions. [2025-01-10 06:51:10,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 131 transitions, 524 flow [2025-01-10 06:51:10,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 131 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:10,800 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 260 flow [2025-01-10 06:51:10,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2025-01-10 06:51:10,800 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 8 predicate places. [2025-01-10 06:51:10,800 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 260 flow [2025-01-10 06:51:10,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 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:51:10,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:10,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:10,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:51:10,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:10,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1346111298, now seen corresponding path program 1 times [2025-01-10 06:51:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:10,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428009154] [2025-01-10 06:51:10,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:10,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:10,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:51:10,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:51:10,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:10,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:10,851 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:51:10,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:10,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428009154] [2025-01-10 06:51:10,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428009154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:10,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:10,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:10,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097376344] [2025-01-10 06:51:10,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:10,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:10,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:10,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:10,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 96 [2025-01-10 06:51:10,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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:51:10,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:10,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 96 [2025-01-10 06:51:10,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:11,151 INFO L124 PetriNetUnfolderBase]: 1112/2762 cut-off events. [2025-01-10 06:51:11,152 INFO L125 PetriNetUnfolderBase]: For 1214/1237 co-relation queries the response was YES. [2025-01-10 06:51:11,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5470 conditions, 2762 events. 1112/2762 cut-off events. For 1214/1237 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 21493 event pairs, 515 based on Foata normal form. 49/2477 useless extension candidates. Maximal degree in co-relation 2020. Up to 1170 conditions per place. [2025-01-10 06:51:11,164 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 76 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2025-01-10 06:51:11,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 131 transitions, 532 flow [2025-01-10 06:51:11,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 291 transitions. [2025-01-10 06:51:11,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578125 [2025-01-10 06:51:11,166 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 260 flow. Second operand 4 states and 291 transitions. [2025-01-10 06:51:11,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 131 transitions, 532 flow [2025-01-10 06:51:11,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 131 transitions, 520 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:51:11,170 INFO L231 Difference]: Finished difference. Result has 96 places, 92 transitions, 250 flow [2025-01-10 06:51:11,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=96, PETRI_TRANSITIONS=92} [2025-01-10 06:51:11,171 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 7 predicate places. [2025-01-10 06:51:11,171 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 250 flow [2025-01-10 06:51:11,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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:51:11,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:11,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:11,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:51:11,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:11,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash -558962735, now seen corresponding path program 1 times [2025-01-10 06:51:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:11,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248310945] [2025-01-10 06:51:11,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:11,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:51:11,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:51:11,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:11,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:11,205 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:51:11,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:11,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248310945] [2025-01-10 06:51:11,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248310945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:11,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:11,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:11,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484418822] [2025-01-10 06:51:11,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:11,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:11,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:11,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:11,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:11,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 96 [2025-01-10 06:51:11,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 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:51:11,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:11,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 96 [2025-01-10 06:51:11,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:11,415 INFO L124 PetriNetUnfolderBase]: 1010/2629 cut-off events. [2025-01-10 06:51:11,415 INFO L125 PetriNetUnfolderBase]: For 929/956 co-relation queries the response was YES. [2025-01-10 06:51:11,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4991 conditions, 2629 events. 1010/2629 cut-off events. For 929/956 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 20894 event pairs, 329 based on Foata normal form. 27/2289 useless extension candidates. Maximal degree in co-relation 2586. Up to 813 conditions per place. [2025-01-10 06:51:11,427 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 53 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-01-10 06:51:11,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 109 transitions, 422 flow [2025-01-10 06:51:11,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2025-01-10 06:51:11,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2025-01-10 06:51:11,428 INFO L175 Difference]: Start difference. First operand has 96 places, 92 transitions, 250 flow. Second operand 4 states and 280 transitions. [2025-01-10 06:51:11,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 109 transitions, 422 flow [2025-01-10 06:51:11,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 109 transitions, 411 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:11,434 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 250 flow [2025-01-10 06:51:11,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2025-01-10 06:51:11,436 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 7 predicate places. [2025-01-10 06:51:11,436 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 250 flow [2025-01-10 06:51:11,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 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:51:11,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:11,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:11,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:51:11,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:11,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:11,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1220253734, now seen corresponding path program 1 times [2025-01-10 06:51:11,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:11,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455736691] [2025-01-10 06:51:11,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:11,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:51:11,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:51:11,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:11,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:11,521 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:51:11,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:11,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455736691] [2025-01-10 06:51:11,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455736691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:11,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:11,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:51:11,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370357809] [2025-01-10 06:51:11,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:11,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:11,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:11,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:11,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:51:11,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 96 [2025-01-10 06:51:11,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 53.333333333333336) internal successors, (320), 6 states have internal predecessors, (320), 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:51:11,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:11,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 96 [2025-01-10 06:51:11,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:11,859 INFO L124 PetriNetUnfolderBase]: 1293/2819 cut-off events. [2025-01-10 06:51:11,859 INFO L125 PetriNetUnfolderBase]: For 1291/1342 co-relation queries the response was YES. [2025-01-10 06:51:11,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5812 conditions, 2819 events. 1293/2819 cut-off events. For 1291/1342 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 20262 event pairs, 338 based on Foata normal form. 97/2634 useless extension candidates. Maximal degree in co-relation 3384. Up to 816 conditions per place. [2025-01-10 06:51:11,868 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 90 selfloop transitions, 9 changer transitions 0/148 dead transitions. [2025-01-10 06:51:11,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 148 transitions, 640 flow [2025-01-10 06:51:11,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 402 transitions. [2025-01-10 06:51:11,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2025-01-10 06:51:11,869 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 250 flow. Second operand 6 states and 402 transitions. [2025-01-10 06:51:11,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 148 transitions, 640 flow [2025-01-10 06:51:11,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 148 transitions, 614 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:11,873 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 267 flow [2025-01-10 06:51:11,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2025-01-10 06:51:11,873 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 9 predicate places. [2025-01-10 06:51:11,873 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 267 flow [2025-01-10 06:51:11,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.333333333333336) internal successors, (320), 6 states have internal predecessors, (320), 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:51:11,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:11,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:11,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:51:11,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:11,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash -148006576, now seen corresponding path program 1 times [2025-01-10 06:51:11,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:11,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471083583] [2025-01-10 06:51:11,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:11,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:11,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:51:11,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:51:11,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:11,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:11,911 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:51:11,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:11,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471083583] [2025-01-10 06:51:11,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471083583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:11,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:11,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:11,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291227030] [2025-01-10 06:51:11,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:11,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:11,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:11,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:11,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:11,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 96 [2025-01-10 06:51:11,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:11,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:11,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 96 [2025-01-10 06:51:11,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:12,087 INFO L124 PetriNetUnfolderBase]: 1012/2582 cut-off events. [2025-01-10 06:51:12,088 INFO L125 PetriNetUnfolderBase]: For 1801/1885 co-relation queries the response was YES. [2025-01-10 06:51:12,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5208 conditions, 2582 events. 1012/2582 cut-off events. For 1801/1885 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 20112 event pairs, 331 based on Foata normal form. 103/2336 useless extension candidates. Maximal degree in co-relation 2662. Up to 817 conditions per place. [2025-01-10 06:51:12,098 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 56 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-01-10 06:51:12,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 457 flow [2025-01-10 06:51:12,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2025-01-10 06:51:12,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-01-10 06:51:12,100 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 267 flow. Second operand 4 states and 276 transitions. [2025-01-10 06:51:12,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 457 flow [2025-01-10 06:51:12,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 109 transitions, 435 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:51:12,103 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 258 flow [2025-01-10 06:51:12,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2025-01-10 06:51:12,104 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 7 predicate places. [2025-01-10 06:51:12,104 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 258 flow [2025-01-10 06:51:12,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:12,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:12,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:12,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:51:12,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:12,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:12,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1774157767, now seen corresponding path program 1 times [2025-01-10 06:51:12,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:12,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718186551] [2025-01-10 06:51:12,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:12,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:12,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:51:12,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:51:12,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:12,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,142 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:51:12,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:12,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718186551] [2025-01-10 06:51:12,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718186551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:12,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:12,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:12,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448190921] [2025-01-10 06:51:12,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:12,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:12,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:12,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:12,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:12,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 96 [2025-01-10 06:51:12,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 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:51:12,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:12,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 96 [2025-01-10 06:51:12,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:12,471 INFO L124 PetriNetUnfolderBase]: 1252/2772 cut-off events. [2025-01-10 06:51:12,471 INFO L125 PetriNetUnfolderBase]: For 1338/1363 co-relation queries the response was YES. [2025-01-10 06:51:12,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5847 conditions, 2772 events. 1252/2772 cut-off events. For 1338/1363 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 20048 event pairs, 485 based on Foata normal form. 59/2517 useless extension candidates. Maximal degree in co-relation 2883. Up to 1180 conditions per place. [2025-01-10 06:51:12,480 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 113 selfloop transitions, 8 changer transitions 0/167 dead transitions. [2025-01-10 06:51:12,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 167 transitions, 758 flow [2025-01-10 06:51:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 424 transitions. [2025-01-10 06:51:12,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2025-01-10 06:51:12,481 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 258 flow. Second operand 6 states and 424 transitions. [2025-01-10 06:51:12,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 167 transitions, 758 flow [2025-01-10 06:51:12,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 167 transitions, 721 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:51:12,486 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 274 flow [2025-01-10 06:51:12,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2025-01-10 06:51:12,487 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 9 predicate places. [2025-01-10 06:51:12,487 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 274 flow [2025-01-10 06:51:12,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 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:51:12,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:12,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:12,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:51:12,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:12,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash -293235756, now seen corresponding path program 1 times [2025-01-10 06:51:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2200074] [2025-01-10 06:51:12,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:12,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:51:12,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:51:12,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:12,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,520 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:51:12,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:12,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2200074] [2025-01-10 06:51:12,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2200074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:12,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:12,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:12,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267873454] [2025-01-10 06:51:12,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:12,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:12,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:12,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:12,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:12,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 96 [2025-01-10 06:51:12,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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:51:12,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:12,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 96 [2025-01-10 06:51:12,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:12,800 INFO L124 PetriNetUnfolderBase]: 1093/2619 cut-off events. [2025-01-10 06:51:12,800 INFO L125 PetriNetUnfolderBase]: For 2168/2248 co-relation queries the response was YES. [2025-01-10 06:51:12,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5432 conditions, 2619 events. 1093/2619 cut-off events. For 2168/2248 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 19821 event pairs, 519 based on Foata normal form. 113/2383 useless extension candidates. Maximal degree in co-relation 4102. Up to 1178 conditions per place. [2025-01-10 06:51:12,814 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 80 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2025-01-10 06:51:12,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 131 transitions, 602 flow [2025-01-10 06:51:12,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 289 transitions. [2025-01-10 06:51:12,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7526041666666666 [2025-01-10 06:51:12,816 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 274 flow. Second operand 4 states and 289 transitions. [2025-01-10 06:51:12,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 131 transitions, 602 flow [2025-01-10 06:51:12,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 131 transitions, 559 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:12,821 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 257 flow [2025-01-10 06:51:12,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2025-01-10 06:51:12,822 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 7 predicate places. [2025-01-10 06:51:12,822 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 257 flow [2025-01-10 06:51:12,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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:51:12,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:12,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:12,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:51:12,822 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:12,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash -293236781, now seen corresponding path program 1 times [2025-01-10 06:51:12,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:12,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677319761] [2025-01-10 06:51:12,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:12,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:12,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:51:12,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:51:12,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:12,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,905 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:51:12,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:12,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677319761] [2025-01-10 06:51:12,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677319761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:12,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:12,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:12,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819588548] [2025-01-10 06:51:12,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:12,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:12,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:12,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:12,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:12,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 96 [2025-01-10 06:51:12,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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:51:12,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:12,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 96 [2025-01-10 06:51:12,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:13,151 INFO L124 PetriNetUnfolderBase]: 1264/2720 cut-off events. [2025-01-10 06:51:13,152 INFO L125 PetriNetUnfolderBase]: For 1563/1663 co-relation queries the response was YES. [2025-01-10 06:51:13,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5729 conditions, 2720 events. 1264/2720 cut-off events. For 1563/1663 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 19438 event pairs, 331 based on Foata normal form. 100/2537 useless extension candidates. Maximal degree in co-relation 4343. Up to 843 conditions per place. [2025-01-10 06:51:13,162 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 78 selfloop transitions, 6 changer transitions 0/129 dead transitions. [2025-01-10 06:51:13,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 129 transitions, 563 flow [2025-01-10 06:51:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 347 transitions. [2025-01-10 06:51:13,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7229166666666667 [2025-01-10 06:51:13,163 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 257 flow. Second operand 5 states and 347 transitions. [2025-01-10 06:51:13,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 129 transitions, 563 flow [2025-01-10 06:51:13,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 129 transitions, 557 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:13,166 INFO L231 Difference]: Finished difference. Result has 97 places, 89 transitions, 261 flow [2025-01-10 06:51:13,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=97, PETRI_TRANSITIONS=89} [2025-01-10 06:51:13,168 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 8 predicate places. [2025-01-10 06:51:13,168 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 89 transitions, 261 flow [2025-01-10 06:51:13,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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:51:13,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:13,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:13,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:51:13,172 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:13,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:13,172 INFO L85 PathProgramCache]: Analyzing trace with hash -137742083, now seen corresponding path program 1 times [2025-01-10 06:51:13,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:13,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5839518] [2025-01-10 06:51:13,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:13,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:51:13,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:51:13,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:13,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:13,205 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:51:13,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:13,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5839518] [2025-01-10 06:51:13,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5839518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:13,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:13,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:13,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922608490] [2025-01-10 06:51:13,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:13,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:13,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:13,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:13,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:13,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 96 [2025-01-10 06:51:13,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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:51:13,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:13,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 96 [2025-01-10 06:51:13,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:13,463 INFO L124 PetriNetUnfolderBase]: 1379/3226 cut-off events. [2025-01-10 06:51:13,463 INFO L125 PetriNetUnfolderBase]: For 1869/1950 co-relation queries the response was YES. [2025-01-10 06:51:13,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6478 conditions, 3226 events. 1379/3226 cut-off events. For 1869/1950 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 25080 event pairs, 586 based on Foata normal form. 149/2946 useless extension candidates. Maximal degree in co-relation 5344. Up to 1307 conditions per place. [2025-01-10 06:51:13,474 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 81 selfloop transitions, 6 changer transitions 0/130 dead transitions. [2025-01-10 06:51:13,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 130 transitions, 569 flow [2025-01-10 06:51:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 296 transitions. [2025-01-10 06:51:13,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2025-01-10 06:51:13,476 INFO L175 Difference]: Start difference. First operand has 97 places, 89 transitions, 261 flow. Second operand 4 states and 296 transitions. [2025-01-10 06:51:13,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 130 transitions, 569 flow [2025-01-10 06:51:13,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 130 transitions, 548 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:13,480 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 290 flow [2025-01-10 06:51:13,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2025-01-10 06:51:13,480 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 10 predicate places. [2025-01-10 06:51:13,480 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 290 flow [2025-01-10 06:51:13,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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:51:13,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:13,481 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:13,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:51:13,481 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:13,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:13,482 INFO L85 PathProgramCache]: Analyzing trace with hash -500404813, now seen corresponding path program 1 times [2025-01-10 06:51:13,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:13,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137131056] [2025-01-10 06:51:13,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:13,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:13,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:51:13,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:51:13,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:13,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:13,553 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:51:13,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:13,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137131056] [2025-01-10 06:51:13,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137131056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:13,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:13,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:51:13,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881060102] [2025-01-10 06:51:13,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:13,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:13,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:13,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:51:13,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 96 [2025-01-10 06:51:13,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 53.666666666666664) internal successors, (322), 6 states have internal predecessors, (322), 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:51:13,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:13,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 96 [2025-01-10 06:51:13,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:13,958 INFO L124 PetriNetUnfolderBase]: 1414/3063 cut-off events. [2025-01-10 06:51:13,958 INFO L125 PetriNetUnfolderBase]: For 2674/2846 co-relation queries the response was YES. [2025-01-10 06:51:13,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6782 conditions, 3063 events. 1414/3063 cut-off events. For 2674/2846 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 22470 event pairs, 383 based on Foata normal form. 211/2947 useless extension candidates. Maximal degree in co-relation 5324. Up to 931 conditions per place. [2025-01-10 06:51:13,971 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 103 selfloop transitions, 9 changer transitions 0/157 dead transitions. [2025-01-10 06:51:13,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 157 transitions, 802 flow [2025-01-10 06:51:13,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 399 transitions. [2025-01-10 06:51:13,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6927083333333334 [2025-01-10 06:51:13,973 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 290 flow. Second operand 6 states and 399 transitions. [2025-01-10 06:51:13,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 157 transitions, 802 flow [2025-01-10 06:51:13,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 157 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:13,978 INFO L231 Difference]: Finished difference. Result has 104 places, 91 transitions, 315 flow [2025-01-10 06:51:13,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=104, PETRI_TRANSITIONS=91} [2025-01-10 06:51:13,978 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 15 predicate places. [2025-01-10 06:51:13,978 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 91 transitions, 315 flow [2025-01-10 06:51:13,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.666666666666664) internal successors, (322), 6 states have internal predecessors, (322), 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:51:13,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:13,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:13,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:51:13,979 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:13,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash 24963495, now seen corresponding path program 1 times [2025-01-10 06:51:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:13,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255251803] [2025-01-10 06:51:13,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:13,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:51:13,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:51:13,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:13,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:14,023 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:51:14,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255251803] [2025-01-10 06:51:14,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255251803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:14,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:14,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:14,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527787702] [2025-01-10 06:51:14,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:14,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:14,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:14,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:14,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:51:14,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 96 [2025-01-10 06:51:14,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 91 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 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:51:14,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:14,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 96 [2025-01-10 06:51:14,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:14,522 INFO L124 PetriNetUnfolderBase]: 2099/4807 cut-off events. [2025-01-10 06:51:14,522 INFO L125 PetriNetUnfolderBase]: For 4844/5046 co-relation queries the response was YES. [2025-01-10 06:51:14,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11047 conditions, 4807 events. 2099/4807 cut-off events. For 4844/5046 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 39732 event pairs, 512 based on Foata normal form. 232/4615 useless extension candidates. Maximal degree in co-relation 6345. Up to 1211 conditions per place. [2025-01-10 06:51:14,539 INFO L140 encePairwiseOnDemand]: 86/96 looper letters, 147 selfloop transitions, 14 changer transitions 0/202 dead transitions. [2025-01-10 06:51:14,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 202 transitions, 1067 flow [2025-01-10 06:51:14,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:51:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:51:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 486 transitions. [2025-01-10 06:51:14,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7232142857142857 [2025-01-10 06:51:14,541 INFO L175 Difference]: Start difference. First operand has 104 places, 91 transitions, 315 flow. Second operand 7 states and 486 transitions. [2025-01-10 06:51:14,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 202 transitions, 1067 flow [2025-01-10 06:51:14,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 202 transitions, 1009 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:51:14,552 INFO L231 Difference]: Finished difference. Result has 108 places, 97 transitions, 384 flow [2025-01-10 06:51:14,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=384, PETRI_PLACES=108, PETRI_TRANSITIONS=97} [2025-01-10 06:51:14,553 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 19 predicate places. [2025-01-10 06:51:14,553 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 97 transitions, 384 flow [2025-01-10 06:51:14,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 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:51:14,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:14,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:14,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:51:14,553 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:14,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:14,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1680329415, now seen corresponding path program 1 times [2025-01-10 06:51:14,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:14,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913094972] [2025-01-10 06:51:14,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:14,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:14,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:51:14,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:51:14,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:14,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:14,583 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:51:14,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:14,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913094972] [2025-01-10 06:51:14,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913094972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:14,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:14,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:14,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436279267] [2025-01-10 06:51:14,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:14,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:14,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:14,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:14,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:14,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 96 [2025-01-10 06:51:14,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 97 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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:51:14,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:14,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 96 [2025-01-10 06:51:14,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:14,857 INFO L124 PetriNetUnfolderBase]: 2179/4833 cut-off events. [2025-01-10 06:51:14,857 INFO L125 PetriNetUnfolderBase]: For 7374/7666 co-relation queries the response was YES. [2025-01-10 06:51:14,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11694 conditions, 4833 events. 2179/4833 cut-off events. For 7374/7666 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 39297 event pairs, 942 based on Foata normal form. 249/4669 useless extension candidates. Maximal degree in co-relation 7609. Up to 2118 conditions per place. [2025-01-10 06:51:14,886 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 100 selfloop transitions, 5 changer transitions 0/151 dead transitions. [2025-01-10 06:51:14,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 151 transitions, 911 flow [2025-01-10 06:51:14,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:14,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2025-01-10 06:51:14,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7473958333333334 [2025-01-10 06:51:14,887 INFO L175 Difference]: Start difference. First operand has 108 places, 97 transitions, 384 flow. Second operand 4 states and 287 transitions. [2025-01-10 06:51:14,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 151 transitions, 911 flow [2025-01-10 06:51:14,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 151 transitions, 891 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:14,903 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 387 flow [2025-01-10 06:51:14,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=387, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2025-01-10 06:51:14,904 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 20 predicate places. [2025-01-10 06:51:14,905 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 387 flow [2025-01-10 06:51:14,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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:51:14,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:14,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:14,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:51:14,905 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:14,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:14,905 INFO L85 PathProgramCache]: Analyzing trace with hash 773837345, now seen corresponding path program 1 times [2025-01-10 06:51:14,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:14,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625141680] [2025-01-10 06:51:14,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:14,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:14,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:51:14,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:51:14,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:14,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:14,979 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:51:14,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625141680] [2025-01-10 06:51:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625141680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:14,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:14,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:51:14,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631550021] [2025-01-10 06:51:14,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:14,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:14,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:14,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:14,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:14,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 96 [2025-01-10 06:51:14,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 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:51:14,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:14,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 96 [2025-01-10 06:51:14,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:15,470 INFO L124 PetriNetUnfolderBase]: 2586/6161 cut-off events. [2025-01-10 06:51:15,471 INFO L125 PetriNetUnfolderBase]: For 8697/8892 co-relation queries the response was YES. [2025-01-10 06:51:15,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14751 conditions, 6161 events. 2586/6161 cut-off events. For 8697/8892 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 54528 event pairs, 690 based on Foata normal form. 267/5861 useless extension candidates. Maximal degree in co-relation 9214. Up to 1628 conditions per place. [2025-01-10 06:51:15,512 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 115 selfloop transitions, 10 changer transitions 0/166 dead transitions. [2025-01-10 06:51:15,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 166 transitions, 911 flow [2025-01-10 06:51:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 369 transitions. [2025-01-10 06:51:15,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76875 [2025-01-10 06:51:15,513 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 387 flow. Second operand 5 states and 369 transitions. [2025-01-10 06:51:15,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 166 transitions, 911 flow [2025-01-10 06:51:15,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 166 transitions, 895 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:15,535 INFO L231 Difference]: Finished difference. Result has 113 places, 98 transitions, 427 flow [2025-01-10 06:51:15,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=113, PETRI_TRANSITIONS=98} [2025-01-10 06:51:15,536 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 24 predicate places. [2025-01-10 06:51:15,536 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 98 transitions, 427 flow [2025-01-10 06:51:15,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 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:51:15,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:15,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:15,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:51:15,537 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:15,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:15,537 INFO L85 PathProgramCache]: Analyzing trace with hash 147337718, now seen corresponding path program 1 times [2025-01-10 06:51:15,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:15,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476317598] [2025-01-10 06:51:15,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:15,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:15,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:51:15,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:51:15,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:15,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:15,576 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:51:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476317598] [2025-01-10 06:51:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476317598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:15,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:15,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:15,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857075050] [2025-01-10 06:51:15,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:15,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:15,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:15,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:15,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:15,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 96 [2025-01-10 06:51:15,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 98 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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:51:15,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:15,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 96 [2025-01-10 06:51:15,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:16,182 INFO L124 PetriNetUnfolderBase]: 3213/7418 cut-off events. [2025-01-10 06:51:16,182 INFO L125 PetriNetUnfolderBase]: For 12698/13028 co-relation queries the response was YES. [2025-01-10 06:51:16,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17990 conditions, 7418 events. 3213/7418 cut-off events. For 12698/13028 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 67381 event pairs, 1525 based on Foata normal form. 432/6977 useless extension candidates. Maximal degree in co-relation 9302. Up to 3150 conditions per place. [2025-01-10 06:51:16,218 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 111 selfloop transitions, 7 changer transitions 0/159 dead transitions. [2025-01-10 06:51:16,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 159 transitions, 1071 flow [2025-01-10 06:51:16,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 294 transitions. [2025-01-10 06:51:16,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.765625 [2025-01-10 06:51:16,219 INFO L175 Difference]: Start difference. First operand has 113 places, 98 transitions, 427 flow. Second operand 4 states and 294 transitions. [2025-01-10 06:51:16,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 159 transitions, 1071 flow [2025-01-10 06:51:16,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 159 transitions, 1036 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:16,236 INFO L231 Difference]: Finished difference. Result has 115 places, 100 transitions, 456 flow [2025-01-10 06:51:16,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=456, PETRI_PLACES=115, PETRI_TRANSITIONS=100} [2025-01-10 06:51:16,236 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 26 predicate places. [2025-01-10 06:51:16,236 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 100 transitions, 456 flow [2025-01-10 06:51:16,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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:51:16,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:16,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:16,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:51:16,237 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:16,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1780846327, now seen corresponding path program 1 times [2025-01-10 06:51:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:16,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213395733] [2025-01-10 06:51:16,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:16,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:16,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:51:16,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:51:16,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:16,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:16,311 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:51:16,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:16,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213395733] [2025-01-10 06:51:16,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213395733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:16,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:16,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:16,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916745340] [2025-01-10 06:51:16,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:16,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:51:16,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:16,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:51:16,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:51:16,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 96 [2025-01-10 06:51:16,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 100 transitions, 456 flow. Second operand has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 7 states have internal predecessors, (363), 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:51:16,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:16,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 96 [2025-01-10 06:51:16,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:17,039 INFO L124 PetriNetUnfolderBase]: 4198/7932 cut-off events. [2025-01-10 06:51:17,039 INFO L125 PetriNetUnfolderBase]: For 12507/13024 co-relation queries the response was YES. [2025-01-10 06:51:17,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21854 conditions, 7932 events. 4198/7932 cut-off events. For 12507/13024 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 62002 event pairs, 200 based on Foata normal form. 417/8046 useless extension candidates. Maximal degree in co-relation 19868. Up to 3397 conditions per place. [2025-01-10 06:51:17,071 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 136 selfloop transitions, 16 changer transitions 0/191 dead transitions. [2025-01-10 06:51:17,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 191 transitions, 1186 flow [2025-01-10 06:51:17,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:51:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:51:17,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 462 transitions. [2025-01-10 06:51:17,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-01-10 06:51:17,073 INFO L175 Difference]: Start difference. First operand has 115 places, 100 transitions, 456 flow. Second operand 7 states and 462 transitions. [2025-01-10 06:51:17,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 191 transitions, 1186 flow [2025-01-10 06:51:17,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 191 transitions, 1186 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:17,104 INFO L231 Difference]: Finished difference. Result has 120 places, 99 transitions, 486 flow [2025-01-10 06:51:17,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=486, PETRI_PLACES=120, PETRI_TRANSITIONS=99} [2025-01-10 06:51:17,104 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 31 predicate places. [2025-01-10 06:51:17,104 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 99 transitions, 486 flow [2025-01-10 06:51:17,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 7 states have internal predecessors, (363), 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:51:17,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:17,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:17,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:51:17,105 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:17,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1438583052, now seen corresponding path program 1 times [2025-01-10 06:51:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:17,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834973695] [2025-01-10 06:51:17,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:17,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:17,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:51:17,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:51:17,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:17,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:17,134 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:51:17,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:17,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834973695] [2025-01-10 06:51:17,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834973695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:17,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:17,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:17,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79751146] [2025-01-10 06:51:17,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:17,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:17,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:17,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:17,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:17,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 96 [2025-01-10 06:51:17,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 99 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:17,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:17,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 96 [2025-01-10 06:51:17,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:17,555 INFO L124 PetriNetUnfolderBase]: 2584/6344 cut-off events. [2025-01-10 06:51:17,555 INFO L125 PetriNetUnfolderBase]: For 15151/15458 co-relation queries the response was YES. [2025-01-10 06:51:17,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16682 conditions, 6344 events. 2584/6344 cut-off events. For 15151/15458 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 57462 event pairs, 643 based on Foata normal form. 305/6249 useless extension candidates. Maximal degree in co-relation 12348. Up to 2330 conditions per place. [2025-01-10 06:51:17,579 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 66 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2025-01-10 06:51:17,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 121 transitions, 743 flow [2025-01-10 06:51:17,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 281 transitions. [2025-01-10 06:51:17,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7317708333333334 [2025-01-10 06:51:17,581 INFO L175 Difference]: Start difference. First operand has 120 places, 99 transitions, 486 flow. Second operand 4 states and 281 transitions. [2025-01-10 06:51:17,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 121 transitions, 743 flow [2025-01-10 06:51:17,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 121 transitions, 716 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:17,602 INFO L231 Difference]: Finished difference. Result has 117 places, 98 transitions, 477 flow [2025-01-10 06:51:17,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=477, PETRI_PLACES=117, PETRI_TRANSITIONS=98} [2025-01-10 06:51:17,603 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 28 predicate places. [2025-01-10 06:51:17,603 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 98 transitions, 477 flow [2025-01-10 06:51:17,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:17,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:17,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:17,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:51:17,604 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:17,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:17,604 INFO L85 PathProgramCache]: Analyzing trace with hash 272502777, now seen corresponding path program 1 times [2025-01-10 06:51:17,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:17,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112966644] [2025-01-10 06:51:17,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:17,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:17,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:51:17,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:51:17,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:17,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:17,646 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:51:17,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:17,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112966644] [2025-01-10 06:51:17,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112966644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:17,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:17,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:17,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330284658] [2025-01-10 06:51:17,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:17,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:17,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:17,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:17,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:51:17,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 96 [2025-01-10 06:51:17,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 98 transitions, 477 flow. Second operand has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 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:51:17,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:17,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 96 [2025-01-10 06:51:17,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:18,565 INFO L124 PetriNetUnfolderBase]: 4596/10389 cut-off events. [2025-01-10 06:51:18,565 INFO L125 PetriNetUnfolderBase]: For 23319/23782 co-relation queries the response was YES. [2025-01-10 06:51:18,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27215 conditions, 10389 events. 4596/10389 cut-off events. For 23319/23782 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 98465 event pairs, 1184 based on Foata normal form. 513/10075 useless extension candidates. Maximal degree in co-relation 16215. Up to 2698 conditions per place. [2025-01-10 06:51:18,630 INFO L140 encePairwiseOnDemand]: 86/96 looper letters, 201 selfloop transitions, 13 changer transitions 0/253 dead transitions. [2025-01-10 06:51:18,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 253 transitions, 2013 flow [2025-01-10 06:51:18,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:51:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:51:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 481 transitions. [2025-01-10 06:51:18,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7157738095238095 [2025-01-10 06:51:18,633 INFO L175 Difference]: Start difference. First operand has 117 places, 98 transitions, 477 flow. Second operand 7 states and 481 transitions. [2025-01-10 06:51:18,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 253 transitions, 2013 flow [2025-01-10 06:51:18,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 253 transitions, 1891 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:18,696 INFO L231 Difference]: Finished difference. Result has 122 places, 103 transitions, 528 flow [2025-01-10 06:51:18,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=528, PETRI_PLACES=122, PETRI_TRANSITIONS=103} [2025-01-10 06:51:18,696 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 33 predicate places. [2025-01-10 06:51:18,696 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 103 transitions, 528 flow [2025-01-10 06:51:18,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 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:51:18,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:18,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:18,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:51:18,697 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:18,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash 628339492, now seen corresponding path program 1 times [2025-01-10 06:51:18,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:18,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058152354] [2025-01-10 06:51:18,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:18,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:18,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:51:18,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:51:18,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:18,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:18,806 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:51:18,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:18,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058152354] [2025-01-10 06:51:18,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058152354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:18,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:18,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:51:18,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32579178] [2025-01-10 06:51:18,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:18,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:51:18,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:18,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:51:18,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:51:18,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 96 [2025-01-10 06:51:18,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 103 transitions, 528 flow. Second operand has 9 states, 9 states have (on average 45.333333333333336) internal successors, (408), 9 states have internal predecessors, (408), 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:51:18,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:18,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 96 [2025-01-10 06:51:18,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:19,941 INFO L124 PetriNetUnfolderBase]: 5379/10327 cut-off events. [2025-01-10 06:51:19,941 INFO L125 PetriNetUnfolderBase]: For 26270/27285 co-relation queries the response was YES. [2025-01-10 06:51:19,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30088 conditions, 10327 events. 5379/10327 cut-off events. For 26270/27285 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 85978 event pairs, 286 based on Foata normal form. 947/10838 useless extension candidates. Maximal degree in co-relation 27492. Up to 2416 conditions per place. [2025-01-10 06:51:19,994 INFO L140 encePairwiseOnDemand]: 84/96 looper letters, 205 selfloop transitions, 23 changer transitions 0/265 dead transitions. [2025-01-10 06:51:19,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 265 transitions, 1962 flow [2025-01-10 06:51:19,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:51:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:51:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 541 transitions. [2025-01-10 06:51:19,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6261574074074074 [2025-01-10 06:51:19,998 INFO L175 Difference]: Start difference. First operand has 122 places, 103 transitions, 528 flow. Second operand 9 states and 541 transitions. [2025-01-10 06:51:19,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 265 transitions, 1962 flow [2025-01-10 06:51:20,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 265 transitions, 1904 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:20,063 INFO L231 Difference]: Finished difference. Result has 128 places, 103 transitions, 572 flow [2025-01-10 06:51:20,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=572, PETRI_PLACES=128, PETRI_TRANSITIONS=103} [2025-01-10 06:51:20,064 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 39 predicate places. [2025-01-10 06:51:20,064 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 103 transitions, 572 flow [2025-01-10 06:51:20,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 45.333333333333336) internal successors, (408), 9 states have internal predecessors, (408), 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:51:20,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:20,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:20,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:51:20,065 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:20,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash 922477756, now seen corresponding path program 1 times [2025-01-10 06:51:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:20,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302522585] [2025-01-10 06:51:20,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:20,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:51:20,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:51:20,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:20,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:20,114 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:51:20,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:20,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302522585] [2025-01-10 06:51:20,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302522585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:20,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:20,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:20,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215382941] [2025-01-10 06:51:20,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:20,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:20,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:20,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:20,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:20,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 96 [2025-01-10 06:51:20,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 103 transitions, 572 flow. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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:51:20,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:20,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 96 [2025-01-10 06:51:20,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:20,750 INFO L124 PetriNetUnfolderBase]: 3856/8972 cut-off events. [2025-01-10 06:51:20,750 INFO L125 PetriNetUnfolderBase]: For 28065/28702 co-relation queries the response was YES. [2025-01-10 06:51:20,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26481 conditions, 8972 events. 3856/8972 cut-off events. For 28065/28702 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 83946 event pairs, 925 based on Foata normal form. 475/9158 useless extension candidates. Maximal degree in co-relation 17768. Up to 3639 conditions per place. [2025-01-10 06:51:20,798 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 76 selfloop transitions, 11 changer transitions 0/129 dead transitions. [2025-01-10 06:51:20,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 129 transitions, 893 flow [2025-01-10 06:51:20,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2025-01-10 06:51:20,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7213541666666666 [2025-01-10 06:51:20,799 INFO L175 Difference]: Start difference. First operand has 128 places, 103 transitions, 572 flow. Second operand 4 states and 277 transitions. [2025-01-10 06:51:20,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 129 transitions, 893 flow [2025-01-10 06:51:20,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 129 transitions, 853 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:51:20,859 INFO L231 Difference]: Finished difference. Result has 123 places, 102 transitions, 546 flow [2025-01-10 06:51:20,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=546, PETRI_PLACES=123, PETRI_TRANSITIONS=102} [2025-01-10 06:51:20,859 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 34 predicate places. [2025-01-10 06:51:20,859 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 546 flow [2025-01-10 06:51:20,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 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:51:20,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:20,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:20,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:51:20,860 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:20,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:20,860 INFO L85 PathProgramCache]: Analyzing trace with hash -142379462, now seen corresponding path program 1 times [2025-01-10 06:51:20,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:20,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875044155] [2025-01-10 06:51:20,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:20,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:20,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:51:20,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:51:20,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:20,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:20,911 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:51:20,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:20,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875044155] [2025-01-10 06:51:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875044155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:20,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:20,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:51:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627810598] [2025-01-10 06:51:20,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:20,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:20,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:20,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:20,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 96 [2025-01-10 06:51:20,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 102 transitions, 546 flow. Second operand has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 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:51:20,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:20,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 96 [2025-01-10 06:51:20,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:21,642 INFO L124 PetriNetUnfolderBase]: 5142/12284 cut-off events. [2025-01-10 06:51:21,643 INFO L125 PetriNetUnfolderBase]: For 33279/34107 co-relation queries the response was YES. [2025-01-10 06:51:21,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33831 conditions, 12284 events. 5142/12284 cut-off events. For 33279/34107 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 123896 event pairs, 1425 based on Foata normal form. 910/12205 useless extension candidates. Maximal degree in co-relation 18625. Up to 3305 conditions per place. [2025-01-10 06:51:21,720 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 152 selfloop transitions, 10 changer transitions 0/199 dead transitions. [2025-01-10 06:51:21,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 199 transitions, 1578 flow [2025-01-10 06:51:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 366 transitions. [2025-01-10 06:51:21,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7625 [2025-01-10 06:51:21,721 INFO L175 Difference]: Start difference. First operand has 123 places, 102 transitions, 546 flow. Second operand 5 states and 366 transitions. [2025-01-10 06:51:21,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 199 transitions, 1578 flow [2025-01-10 06:51:21,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 199 transitions, 1496 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:21,800 INFO L231 Difference]: Finished difference. Result has 125 places, 103 transitions, 568 flow [2025-01-10 06:51:21,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=125, PETRI_TRANSITIONS=103} [2025-01-10 06:51:21,800 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 36 predicate places. [2025-01-10 06:51:21,800 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 103 transitions, 568 flow [2025-01-10 06:51:21,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 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:51:21,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:21,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:21,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:51:21,801 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:21,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:21,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1996311445, now seen corresponding path program 1 times [2025-01-10 06:51:21,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:21,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408513735] [2025-01-10 06:51:21,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:21,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:21,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:51:21,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:51:21,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:21,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:21,826 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:51:21,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:21,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408513735] [2025-01-10 06:51:21,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408513735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:21,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:21,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:21,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051743868] [2025-01-10 06:51:21,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:21,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:21,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:21,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:21,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:21,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 96 [2025-01-10 06:51:21,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 103 transitions, 568 flow. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:21,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:21,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 96 [2025-01-10 06:51:21,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:23,285 INFO L124 PetriNetUnfolderBase]: 9368/22151 cut-off events. [2025-01-10 06:51:23,286 INFO L125 PetriNetUnfolderBase]: For 60546/61858 co-relation queries the response was YES. [2025-01-10 06:51:23,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62959 conditions, 22151 events. 9368/22151 cut-off events. For 60546/61858 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 229345 event pairs, 5076 based on Foata normal form. 1136/22211 useless extension candidates. Maximal degree in co-relation 57863. Up to 7515 conditions per place. [2025-01-10 06:51:23,433 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 137 selfloop transitions, 10 changer transitions 0/188 dead transitions. [2025-01-10 06:51:23,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 188 transitions, 1463 flow [2025-01-10 06:51:23,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-01-10 06:51:23,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8255208333333334 [2025-01-10 06:51:23,434 INFO L175 Difference]: Start difference. First operand has 125 places, 103 transitions, 568 flow. Second operand 4 states and 317 transitions. [2025-01-10 06:51:23,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 188 transitions, 1463 flow [2025-01-10 06:51:23,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 188 transitions, 1428 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:23,551 INFO L231 Difference]: Finished difference. Result has 127 places, 112 transitions, 687 flow [2025-01-10 06:51:23,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=687, PETRI_PLACES=127, PETRI_TRANSITIONS=112} [2025-01-10 06:51:23,552 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 38 predicate places. [2025-01-10 06:51:23,552 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 112 transitions, 687 flow [2025-01-10 06:51:23,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:23,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:23,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:23,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:51:23,553 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:23,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash -502116561, now seen corresponding path program 1 times [2025-01-10 06:51:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:23,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004881093] [2025-01-10 06:51:23,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:23,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:51:23,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:51:23,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:23,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:23,577 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:51:23,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:23,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004881093] [2025-01-10 06:51:23,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004881093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:23,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:23,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:23,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862546780] [2025-01-10 06:51:23,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:23,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:23,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:23,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:23,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:23,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 96 [2025-01-10 06:51:23,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 112 transitions, 687 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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:51:23,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:23,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 96 [2025-01-10 06:51:23,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:25,327 INFO L124 PetriNetUnfolderBase]: 10730/23943 cut-off events. [2025-01-10 06:51:25,327 INFO L125 PetriNetUnfolderBase]: For 72240/73717 co-relation queries the response was YES. [2025-01-10 06:51:25,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69415 conditions, 23943 events. 10730/23943 cut-off events. For 72240/73717 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 240131 event pairs, 4104 based on Foata normal form. 1253/24019 useless extension candidates. Maximal degree in co-relation 38136. Up to 8732 conditions per place. [2025-01-10 06:51:25,468 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 118 selfloop transitions, 13 changer transitions 0/170 dead transitions. [2025-01-10 06:51:25,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 170 transitions, 1325 flow [2025-01-10 06:51:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 291 transitions. [2025-01-10 06:51:25,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578125 [2025-01-10 06:51:25,470 INFO L175 Difference]: Start difference. First operand has 127 places, 112 transitions, 687 flow. Second operand 4 states and 291 transitions. [2025-01-10 06:51:25,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 170 transitions, 1325 flow [2025-01-10 06:51:25,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 170 transitions, 1312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:25,722 INFO L231 Difference]: Finished difference. Result has 128 places, 111 transitions, 690 flow [2025-01-10 06:51:25,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=690, PETRI_PLACES=128, PETRI_TRANSITIONS=111} [2025-01-10 06:51:25,723 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 39 predicate places. [2025-01-10 06:51:25,723 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 111 transitions, 690 flow [2025-01-10 06:51:25,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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:51:25,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:25,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:25,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:51:25,724 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:25,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1194334146, now seen corresponding path program 1 times [2025-01-10 06:51:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:25,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131007574] [2025-01-10 06:51:25,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:25,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:25,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:51:25,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:51:25,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:25,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:25,769 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:51:25,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:25,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131007574] [2025-01-10 06:51:25,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131007574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:25,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:25,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:25,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297359106] [2025-01-10 06:51:25,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:25,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:25,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:25,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:25,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:25,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 96 [2025-01-10 06:51:25,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 111 transitions, 690 flow. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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:51:25,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:25,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 96 [2025-01-10 06:51:25,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:27,742 INFO L124 PetriNetUnfolderBase]: 9053/22609 cut-off events. [2025-01-10 06:51:27,742 INFO L125 PetriNetUnfolderBase]: For 70083/71691 co-relation queries the response was YES. [2025-01-10 06:51:27,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63336 conditions, 22609 events. 9053/22609 cut-off events. For 70083/71691 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 242516 event pairs, 2362 based on Foata normal form. 1546/22197 useless extension candidates. Maximal degree in co-relation 61108. Up to 7952 conditions per place. [2025-01-10 06:51:27,887 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 98 selfloop transitions, 11 changer transitions 0/149 dead transitions. [2025-01-10 06:51:27,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 149 transitions, 1247 flow [2025-01-10 06:51:27,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:27,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2025-01-10 06:51:27,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2025-01-10 06:51:27,888 INFO L175 Difference]: Start difference. First operand has 128 places, 111 transitions, 690 flow. Second operand 4 states and 280 transitions. [2025-01-10 06:51:27,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 149 transitions, 1247 flow [2025-01-10 06:51:28,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 149 transitions, 1214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:28,089 INFO L231 Difference]: Finished difference. Result has 128 places, 110 transitions, 691 flow [2025-01-10 06:51:28,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=691, PETRI_PLACES=128, PETRI_TRANSITIONS=110} [2025-01-10 06:51:28,089 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 39 predicate places. [2025-01-10 06:51:28,089 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 110 transitions, 691 flow [2025-01-10 06:51:28,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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:51:28,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:28,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:28,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 06:51:28,090 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:28,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:28,090 INFO L85 PathProgramCache]: Analyzing trace with hash -118796229, now seen corresponding path program 1 times [2025-01-10 06:51:28,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:28,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98305758] [2025-01-10 06:51:28,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:28,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:28,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:51:28,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:51:28,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:28,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:28,168 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:51:28,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:28,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98305758] [2025-01-10 06:51:28,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98305758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:28,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:28,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:28,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080820566] [2025-01-10 06:51:28,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:28,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:51:28,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:28,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:51:28,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:51:28,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 96 [2025-01-10 06:51:28,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 110 transitions, 691 flow. Second operand has 7 states, 7 states have (on average 52.142857142857146) internal successors, (365), 7 states have internal predecessors, (365), 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:51:28,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:28,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 96 [2025-01-10 06:51:28,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:30,559 INFO L124 PetriNetUnfolderBase]: 14645/27221 cut-off events. [2025-01-10 06:51:30,560 INFO L125 PetriNetUnfolderBase]: For 93376/96343 co-relation queries the response was YES. [2025-01-10 06:51:30,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86021 conditions, 27221 events. 14645/27221 cut-off events. For 93376/96343 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 244127 event pairs, 786 based on Foata normal form. 2552/28834 useless extension candidates. Maximal degree in co-relation 83586. Up to 11612 conditions per place. [2025-01-10 06:51:30,687 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 216 selfloop transitions, 16 changer transitions 0/265 dead transitions. [2025-01-10 06:51:30,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 265 transitions, 2461 flow [2025-01-10 06:51:30,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:51:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:51:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 458 transitions. [2025-01-10 06:51:30,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6815476190476191 [2025-01-10 06:51:30,689 INFO L175 Difference]: Start difference. First operand has 128 places, 110 transitions, 691 flow. Second operand 7 states and 458 transitions. [2025-01-10 06:51:30,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 265 transitions, 2461 flow [2025-01-10 06:51:30,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 265 transitions, 2439 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:30,948 INFO L231 Difference]: Finished difference. Result has 130 places, 109 transitions, 699 flow [2025-01-10 06:51:30,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=699, PETRI_PLACES=130, PETRI_TRANSITIONS=109} [2025-01-10 06:51:30,952 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 41 predicate places. [2025-01-10 06:51:30,953 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 109 transitions, 699 flow [2025-01-10 06:51:30,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.142857142857146) internal successors, (365), 7 states have internal predecessors, (365), 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:51:30,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:30,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:30,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 06:51:30,953 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:30,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:30,953 INFO L85 PathProgramCache]: Analyzing trace with hash 906423285, now seen corresponding path program 1 times [2025-01-10 06:51:30,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:30,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347642062] [2025-01-10 06:51:30,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:30,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:30,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:51:30,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:51:30,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:30,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:30,988 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:51:30,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:30,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347642062] [2025-01-10 06:51:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347642062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:30,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:30,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:30,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474771544] [2025-01-10 06:51:30,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:30,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:30,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:30,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:30,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:31,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 96 [2025-01-10 06:51:31,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 109 transitions, 699 flow. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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:51:31,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:31,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 96 [2025-01-10 06:51:31,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:32,367 INFO L124 PetriNetUnfolderBase]: 9053/21545 cut-off events. [2025-01-10 06:51:32,367 INFO L125 PetriNetUnfolderBase]: For 76939/78547 co-relation queries the response was YES. [2025-01-10 06:51:32,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63093 conditions, 21545 events. 9053/21545 cut-off events. For 76939/78547 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 222508 event pairs, 2362 based on Foata normal form. 1546/22064 useless extension candidates. Maximal degree in co-relation 60886. Up to 8085 conditions per place. [2025-01-10 06:51:32,717 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 99 selfloop transitions, 11 changer transitions 0/147 dead transitions. [2025-01-10 06:51:32,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 147 transitions, 1238 flow [2025-01-10 06:51:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2025-01-10 06:51:32,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-01-10 06:51:32,719 INFO L175 Difference]: Start difference. First operand has 130 places, 109 transitions, 699 flow. Second operand 4 states and 276 transitions. [2025-01-10 06:51:32,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 147 transitions, 1238 flow [2025-01-10 06:51:32,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 147 transitions, 1211 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:32,925 INFO L231 Difference]: Finished difference. Result has 127 places, 108 transitions, 686 flow [2025-01-10 06:51:32,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=686, PETRI_PLACES=127, PETRI_TRANSITIONS=108} [2025-01-10 06:51:32,926 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 38 predicate places. [2025-01-10 06:51:32,927 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 108 transitions, 686 flow [2025-01-10 06:51:32,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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:51:32,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:32,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:32,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 06:51:32,927 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:32,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:32,928 INFO L85 PathProgramCache]: Analyzing trace with hash 612285021, now seen corresponding path program 1 times [2025-01-10 06:51:32,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:32,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943028281] [2025-01-10 06:51:32,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:32,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:32,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:51:32,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:51:32,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:32,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:33,040 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:51:33,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:33,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943028281] [2025-01-10 06:51:33,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943028281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:33,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:33,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:51:33,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932573942] [2025-01-10 06:51:33,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:33,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:51:33,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:33,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:51:33,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:51:33,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 96 [2025-01-10 06:51:33,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 108 transitions, 686 flow. Second operand has 9 states, 9 states have (on average 45.55555555555556) internal successors, (410), 9 states have internal predecessors, (410), 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:51:33,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:33,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 96 [2025-01-10 06:51:33,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:35,467 INFO L124 PetriNetUnfolderBase]: 13247/25025 cut-off events. [2025-01-10 06:51:35,468 INFO L125 PetriNetUnfolderBase]: For 95516/98155 co-relation queries the response was YES. [2025-01-10 06:51:35,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79482 conditions, 25025 events. 13247/25025 cut-off events. For 95516/98155 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 224174 event pairs, 786 based on Foata normal form. 3195/27297 useless extension candidates. Maximal degree in co-relation 77117. Up to 5523 conditions per place. [2025-01-10 06:51:35,728 INFO L140 encePairwiseOnDemand]: 84/96 looper letters, 288 selfloop transitions, 22 changer transitions 0/342 dead transitions. [2025-01-10 06:51:35,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 342 transitions, 3268 flow [2025-01-10 06:51:35,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:51:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:51:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 534 transitions. [2025-01-10 06:51:35,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6180555555555556 [2025-01-10 06:51:35,730 INFO L175 Difference]: Start difference. First operand has 127 places, 108 transitions, 686 flow. Second operand 9 states and 534 transitions. [2025-01-10 06:51:35,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 342 transitions, 3268 flow [2025-01-10 06:51:36,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 342 transitions, 3246 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:36,226 INFO L231 Difference]: Finished difference. Result has 132 places, 108 transitions, 716 flow [2025-01-10 06:51:36,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=716, PETRI_PLACES=132, PETRI_TRANSITIONS=108} [2025-01-10 06:51:36,227 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 43 predicate places. [2025-01-10 06:51:36,227 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 108 transitions, 716 flow [2025-01-10 06:51:36,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 45.55555555555556) internal successors, (410), 9 states have internal predecessors, (410), 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:51:36,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:36,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:36,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 06:51:36,227 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:36,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash -999805119, now seen corresponding path program 1 times [2025-01-10 06:51:36,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:36,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751474851] [2025-01-10 06:51:36,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:36,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:36,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:51:36,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:51:36,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:36,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:36,250 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:51:36,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:36,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751474851] [2025-01-10 06:51:36,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751474851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:36,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:36,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:36,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998638853] [2025-01-10 06:51:36,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:36,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:36,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:36,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:36,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:36,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 96 [2025-01-10 06:51:36,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 108 transitions, 716 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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:51:36,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:36,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 96 [2025-01-10 06:51:36,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:37,753 INFO L124 PetriNetUnfolderBase]: 10784/22859 cut-off events. [2025-01-10 06:51:37,753 INFO L125 PetriNetUnfolderBase]: For 91610/93566 co-relation queries the response was YES. [2025-01-10 06:51:37,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74156 conditions, 22859 events. 10784/22859 cut-off events. For 91610/93566 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 221278 event pairs, 4332 based on Foata normal form. 1878/24468 useless extension candidates. Maximal degree in co-relation 71824. Up to 9151 conditions per place. [2025-01-10 06:51:37,921 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 143 selfloop transitions, 9 changer transitions 0/186 dead transitions. [2025-01-10 06:51:37,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 186 transitions, 1667 flow [2025-01-10 06:51:37,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:37,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 289 transitions. [2025-01-10 06:51:37,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7526041666666666 [2025-01-10 06:51:37,922 INFO L175 Difference]: Start difference. First operand has 132 places, 108 transitions, 716 flow. Second operand 4 states and 289 transitions. [2025-01-10 06:51:37,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 186 transitions, 1667 flow [2025-01-10 06:51:38,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 186 transitions, 1623 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 06:51:38,257 INFO L231 Difference]: Finished difference. Result has 127 places, 107 transitions, 679 flow [2025-01-10 06:51:38,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=679, PETRI_PLACES=127, PETRI_TRANSITIONS=107} [2025-01-10 06:51:38,258 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 38 predicate places. [2025-01-10 06:51:38,258 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 107 transitions, 679 flow [2025-01-10 06:51:38,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 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:51:38,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:38,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:38,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 06:51:38,258 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:38,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:38,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1800967293, now seen corresponding path program 1 times [2025-01-10 06:51:38,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:38,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086209860] [2025-01-10 06:51:38,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:38,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:38,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:51:38,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:51:38,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:38,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:38,296 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:51:38,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:38,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086209860] [2025-01-10 06:51:38,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086209860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:38,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:38,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:38,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955641620] [2025-01-10 06:51:38,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:38,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:38,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:38,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:38,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:38,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 96 [2025-01-10 06:51:38,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 107 transitions, 679 flow. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:38,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:38,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 96 [2025-01-10 06:51:38,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:42,074 INFO L124 PetriNetUnfolderBase]: 18272/40809 cut-off events. [2025-01-10 06:51:42,075 INFO L125 PetriNetUnfolderBase]: For 142611/146230 co-relation queries the response was YES. [2025-01-10 06:51:42,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127164 conditions, 40809 events. 18272/40809 cut-off events. For 142611/146230 co-relation queries the response was YES. Maximal size of possible extension queue 1123. Compared 431745 event pairs, 7090 based on Foata normal form. 3245/43843 useless extension candidates. Maximal degree in co-relation 124164. Up to 14674 conditions per place. [2025-01-10 06:51:42,691 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 166 selfloop transitions, 10 changer transitions 0/211 dead transitions. [2025-01-10 06:51:42,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 211 transitions, 1889 flow [2025-01-10 06:51:42,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions. [2025-01-10 06:51:42,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8203125 [2025-01-10 06:51:42,693 INFO L175 Difference]: Start difference. First operand has 127 places, 107 transitions, 679 flow. Second operand 4 states and 315 transitions. [2025-01-10 06:51:42,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 211 transitions, 1889 flow [2025-01-10 06:51:43,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 211 transitions, 1864 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:43,083 INFO L231 Difference]: Finished difference. Result has 130 places, 116 transitions, 799 flow [2025-01-10 06:51:43,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=799, PETRI_PLACES=130, PETRI_TRANSITIONS=116} [2025-01-10 06:51:43,084 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 41 predicate places. [2025-01-10 06:51:43,084 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 116 transitions, 799 flow [2025-01-10 06:51:43,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:43,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:43,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:43,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-10 06:51:43,085 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:43,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:43,085 INFO L85 PathProgramCache]: Analyzing trace with hash -551320908, now seen corresponding path program 1 times [2025-01-10 06:51:43,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:43,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267678406] [2025-01-10 06:51:43,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:43,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:43,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:51:43,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:51:43,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:43,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:43,117 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:51:43,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:43,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267678406] [2025-01-10 06:51:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267678406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:43,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:43,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821980761] [2025-01-10 06:51:43,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:43,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:43,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:43,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:43,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 96 [2025-01-10 06:51:43,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 116 transitions, 799 flow. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 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:51:43,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:43,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 96 [2025-01-10 06:51:43,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:47,256 INFO L124 PetriNetUnfolderBase]: 24826/46794 cut-off events. [2025-01-10 06:51:47,256 INFO L125 PetriNetUnfolderBase]: For 187459/191839 co-relation queries the response was YES. [2025-01-10 06:51:47,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155626 conditions, 46794 events. 24826/46794 cut-off events. For 187459/191839 co-relation queries the response was YES. Maximal size of possible extension queue 1252. Compared 442366 event pairs, 9436 based on Foata normal form. 4736/51182 useless extension candidates. Maximal degree in co-relation 152424. Up to 20094 conditions per place. [2025-01-10 06:51:47,596 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 226 selfloop transitions, 15 changer transitions 0/273 dead transitions. [2025-01-10 06:51:47,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 273 transitions, 2605 flow [2025-01-10 06:51:47,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 424 transitions. [2025-01-10 06:51:47,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2025-01-10 06:51:47,598 INFO L175 Difference]: Start difference. First operand has 130 places, 116 transitions, 799 flow. Second operand 6 states and 424 transitions. [2025-01-10 06:51:47,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 273 transitions, 2605 flow [2025-01-10 06:51:48,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 273 transitions, 2576 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:48,172 INFO L231 Difference]: Finished difference. Result has 134 places, 117 transitions, 830 flow [2025-01-10 06:51:48,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=830, PETRI_PLACES=134, PETRI_TRANSITIONS=117} [2025-01-10 06:51:48,173 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 45 predicate places. [2025-01-10 06:51:48,173 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 117 transitions, 830 flow [2025-01-10 06:51:48,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 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:51:48,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:48,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:48,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-10 06:51:48,174 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:48,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2088653914, now seen corresponding path program 1 times [2025-01-10 06:51:48,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:48,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037155142] [2025-01-10 06:51:48,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:48,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:48,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:51:48,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:51:48,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:48,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:48,201 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:51:48,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:48,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037155142] [2025-01-10 06:51:48,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037155142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:48,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:48,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:48,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052085284] [2025-01-10 06:51:48,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:48,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:48,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:48,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:48,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:48,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 96 [2025-01-10 06:51:48,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 117 transitions, 830 flow. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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:51:48,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:48,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 96 [2025-01-10 06:51:48,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:52,356 INFO L124 PetriNetUnfolderBase]: 24330/46983 cut-off events. [2025-01-10 06:51:52,356 INFO L125 PetriNetUnfolderBase]: For 234175/238848 co-relation queries the response was YES. [2025-01-10 06:51:52,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163161 conditions, 46983 events. 24330/46983 cut-off events. For 234175/238848 co-relation queries the response was YES. Maximal size of possible extension queue 1319. Compared 455349 event pairs, 9060 based on Foata normal form. 4436/50919 useless extension candidates. Maximal degree in co-relation 159746. Up to 19398 conditions per place. [2025-01-10 06:51:52,896 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 156 selfloop transitions, 10 changer transitions 0/200 dead transitions. [2025-01-10 06:51:52,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 200 transitions, 1922 flow [2025-01-10 06:51:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2025-01-10 06:51:52,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7473958333333334 [2025-01-10 06:51:52,897 INFO L175 Difference]: Start difference. First operand has 134 places, 117 transitions, 830 flow. Second operand 4 states and 287 transitions. [2025-01-10 06:51:52,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 200 transitions, 1922 flow [2025-01-10 06:51:53,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 200 transitions, 1800 flow, removed 24 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:53,606 INFO L231 Difference]: Finished difference. Result has 132 places, 120 transitions, 863 flow [2025-01-10 06:51:53,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=863, PETRI_PLACES=132, PETRI_TRANSITIONS=120} [2025-01-10 06:51:53,606 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 43 predicate places. [2025-01-10 06:51:53,607 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 120 transitions, 863 flow [2025-01-10 06:51:53,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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:51:53,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:53,607 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:53,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-10 06:51:53,607 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-01-10 06:51:53,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash -25618983, now seen corresponding path program 1 times [2025-01-10 06:51:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530855243] [2025-01-10 06:51:53,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:53,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 06:51:53,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 06:51:53,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:53,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:53,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:53,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530855243] [2025-01-10 06:51:53,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530855243] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:53,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830444924] [2025-01-10 06:51:53,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:53,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:53,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:53,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:51:53,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:51:53,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 06:51:53,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 06:51:53,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:53,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:53,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:51:53,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:53,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:51:53,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830444924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:53,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:51:53,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:51:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212185275] [2025-01-10 06:51:53,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:53,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:53,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:53,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:51:53,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 96 [2025-01-10 06:51:53,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 120 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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:51:53,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:53,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 96 [2025-01-10 06:51:53,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand