./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-subst.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/chl-simpl-str-subst.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 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:50:30,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:50:30,756 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:50:30,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:50:30,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:50:30,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:50:30,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:50:30,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:50:30,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:50:30,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:50:30,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:50:30,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:50:30,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:50:30,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:50:30,780 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:50:30,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:50:30,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:50:30,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:50:30,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:50:30,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:50:30,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:50:30,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:50:30,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:50:30,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:50:30,780 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:50:30,781 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:50:30,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:50:30,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:50:30,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:50:30,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:50:30,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:50:30,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:50:30,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:50:30,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:50:30,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:30,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:50:30,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:50:30,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:50:30,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:50:30,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:30,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:50:30,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:50:30,782 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:50:30,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:50:30,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:50:30,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:50:30,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:50:30,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:50:30,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:50:30,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:50:30,783 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 -> 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 [2025-01-10 06:50:31,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:50:31,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:50:31,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:50:31,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:50:31,042 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:50:31,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2025-01-10 06:50:32,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dac453956/093a61742706485e9bb163aac1ebcb96/FLAGb9759e995 [2025-01-10 06:50:32,683 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:50:32,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2025-01-10 06:50:32,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dac453956/093a61742706485e9bb163aac1ebcb96/FLAGb9759e995 [2025-01-10 06:50:32,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dac453956/093a61742706485e9bb163aac1ebcb96 [2025-01-10 06:50:32,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:50:32,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:50:32,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:50:32,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:50:32,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:50:32,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:32,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@561c575e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32, skipping insertion in model container [2025-01-10 06:50:32,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:32,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:50:32,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:50:32,921 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:50:32,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:50:32,955 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:50:32,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32 WrapperNode [2025-01-10 06:50:32,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:50:32,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:50:32,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:50:32,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:50:32,964 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:50:32" (1/1) ... [2025-01-10 06:50:32,969 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:50:32" (1/1) ... [2025-01-10 06:50:32,993 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 201 [2025-01-10 06:50:32,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:50:32,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:50:32,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:50:32,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:50:33,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:33,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:33,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:33,014 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:50:33,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:33,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:33,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:33,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:33,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:33,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:33,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:33,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:50:33,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:50:33,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:50:33,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:50:33,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32" (1/1) ... [2025-01-10 06:50:33,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:33,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:50:33,063 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:50:33,068 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:50:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:50:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:50:33,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:50:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:50:33,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:50:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:50:33,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:50:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:50:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:50:33,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:50:33,085 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:50:33,164 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:50:33,165 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:50:33,554 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:50:33,554 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:50:33,773 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:50:33,774 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:50:33,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:33 BoogieIcfgContainer [2025-01-10 06:50:33,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:50:33,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:50:33,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:50:33,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:50:33,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:50:32" (1/3) ... [2025-01-10 06:50:33,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e660d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:50:33, skipping insertion in model container [2025-01-10 06:50:33,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:50:32" (2/3) ... [2025-01-10 06:50:33,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e660d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:50:33, skipping insertion in model container [2025-01-10 06:50:33,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:33" (3/3) ... [2025-01-10 06:50:33,783 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2025-01-10 06:50:33,793 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:50:33,795 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-subst.wvr.c that has 4 procedures, 78 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-01-10 06:50:33,795 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:50:33,872 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:50:33,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 89 transitions, 199 flow [2025-01-10 06:50:33,927 INFO L124 PetriNetUnfolderBase]: 12/86 cut-off events. [2025-01-10 06:50:33,928 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:50:33,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 12/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 326 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2025-01-10 06:50:33,932 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 89 transitions, 199 flow [2025-01-10 06:50:33,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 84 transitions, 183 flow [2025-01-10 06:50:33,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:50:33,949 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;@3c75e4df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:50:33,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-01-10 06:50:33,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:50:33,957 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-01-10 06:50:33,957 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:50:33,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:33,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:33,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:33,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:33,962 INFO L85 PathProgramCache]: Analyzing trace with hash -355083188, now seen corresponding path program 1 times [2025-01-10 06:50:33,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:33,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908781087] [2025-01-10 06:50:33,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:33,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:34,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:50:34,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:50:34,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:34,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:34,146 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:50:34,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:34,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908781087] [2025-01-10 06:50:34,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908781087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:34,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:34,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075156691] [2025-01-10 06:50:34,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:34,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:34,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:34,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:34,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:34,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:34,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:34,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:34,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:34,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:35,543 INFO L124 PetriNetUnfolderBase]: 8633/13840 cut-off events. [2025-01-10 06:50:35,544 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-01-10 06:50:35,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25678 conditions, 13840 events. 8633/13840 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 105779 event pairs, 2832 based on Foata normal form. 364/11549 useless extension candidates. Maximal degree in co-relation 24979. Up to 5668 conditions per place. [2025-01-10 06:50:35,658 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 86 selfloop transitions, 5 changer transitions 0/133 dead transitions. [2025-01-10 06:50:35,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 133 transitions, 475 flow [2025-01-10 06:50:35,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2025-01-10 06:50:35,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7696629213483146 [2025-01-10 06:50:35,676 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 183 flow. Second operand 4 states and 274 transitions. [2025-01-10 06:50:35,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 133 transitions, 475 flow [2025-01-10 06:50:35,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 133 transitions, 460 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:50:35,694 INFO L231 Difference]: Finished difference. Result has 82 places, 86 transitions, 208 flow [2025-01-10 06:50:35,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=82, PETRI_TRANSITIONS=86} [2025-01-10 06:50:35,700 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2025-01-10 06:50:35,701 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 208 flow [2025-01-10 06:50:35,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:35,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:35,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:35,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:50:35,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:35,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:35,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1877323747, now seen corresponding path program 1 times [2025-01-10 06:50:35,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:35,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914254735] [2025-01-10 06:50:35,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:35,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:50:35,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:50:35,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:35,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:35,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:35,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914254735] [2025-01-10 06:50:35,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914254735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:35,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:35,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:50:35,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438222293] [2025-01-10 06:50:35,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:35,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:35,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:35,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:35,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:35,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 89 [2025-01-10 06:50:35,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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:50:35,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:35,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 89 [2025-01-10 06:50:35,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:36,829 INFO L124 PetriNetUnfolderBase]: 6311/11503 cut-off events. [2025-01-10 06:50:36,829 INFO L125 PetriNetUnfolderBase]: For 2345/2363 co-relation queries the response was YES. [2025-01-10 06:50:36,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22474 conditions, 11503 events. 6311/11503 cut-off events. For 2345/2363 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 97811 event pairs, 1511 based on Foata normal form. 18/9931 useless extension candidates. Maximal degree in co-relation 11989. Up to 5147 conditions per place. [2025-01-10 06:50:36,959 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 58 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2025-01-10 06:50:36,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 108 transitions, 379 flow [2025-01-10 06:50:36,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2025-01-10 06:50:36,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7106741573033708 [2025-01-10 06:50:36,964 INFO L175 Difference]: Start difference. First operand has 82 places, 86 transitions, 208 flow. Second operand 4 states and 253 transitions. [2025-01-10 06:50:36,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 108 transitions, 379 flow [2025-01-10 06:50:37,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 108 transitions, 379 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:50:37,029 INFO L231 Difference]: Finished difference. Result has 84 places, 85 transitions, 214 flow [2025-01-10 06:50:37,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2025-01-10 06:50:37,031 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 2 predicate places. [2025-01-10 06:50:37,031 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 214 flow [2025-01-10 06:50:37,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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:50:37,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:37,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:37,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:50:37,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:37,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:37,034 INFO L85 PathProgramCache]: Analyzing trace with hash -966011323, now seen corresponding path program 1 times [2025-01-10 06:50:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:37,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36829425] [2025-01-10 06:50:37,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:37,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:37,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:50:37,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:50:37,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:37,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:37,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:50:37,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:37,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36829425] [2025-01-10 06:50:37,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36829425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:37,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:37,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:50:37,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817832367] [2025-01-10 06:50:37,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:37,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:37,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:37,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:37,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:37,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 89 [2025-01-10 06:50:37,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 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:50:37,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:37,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 89 [2025-01-10 06:50:37,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:38,037 INFO L124 PetriNetUnfolderBase]: 6243/11181 cut-off events. [2025-01-10 06:50:38,037 INFO L125 PetriNetUnfolderBase]: For 3675/4030 co-relation queries the response was YES. [2025-01-10 06:50:38,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21925 conditions, 11181 events. 6243/11181 cut-off events. For 3675/4030 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 93179 event pairs, 1765 based on Foata normal form. 636/9670 useless extension candidates. Maximal degree in co-relation 12608. Up to 4952 conditions per place. [2025-01-10 06:50:38,122 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 61 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-01-10 06:50:38,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 107 transitions, 413 flow [2025-01-10 06:50:38,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2025-01-10 06:50:38,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.702247191011236 [2025-01-10 06:50:38,126 INFO L175 Difference]: Start difference. First operand has 84 places, 85 transitions, 214 flow. Second operand 4 states and 250 transitions. [2025-01-10 06:50:38,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 107 transitions, 413 flow [2025-01-10 06:50:38,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 107 transitions, 399 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:38,140 INFO L231 Difference]: Finished difference. Result has 82 places, 83 transitions, 208 flow [2025-01-10 06:50:38,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=82, PETRI_TRANSITIONS=83} [2025-01-10 06:50:38,141 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2025-01-10 06:50:38,142 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 83 transitions, 208 flow [2025-01-10 06:50:38,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 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:50:38,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:38,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:38,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:50:38,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:38,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:38,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1932537072, now seen corresponding path program 1 times [2025-01-10 06:50:38,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:38,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85126153] [2025-01-10 06:50:38,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:38,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:50:38,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:50:38,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:38,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:38,262 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:50:38,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:38,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85126153] [2025-01-10 06:50:38,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85126153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:38,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:38,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:50:38,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334599606] [2025-01-10 06:50:38,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:38,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:38,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:38,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:38,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:38,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 89 [2025-01-10 06:50:38,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 83 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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:50:38,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:38,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 89 [2025-01-10 06:50:38,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:38,776 INFO L124 PetriNetUnfolderBase]: 6329/11351 cut-off events. [2025-01-10 06:50:38,776 INFO L125 PetriNetUnfolderBase]: For 3355/3373 co-relation queries the response was YES. [2025-01-10 06:50:38,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22824 conditions, 11351 events. 6329/11351 cut-off events. For 3355/3373 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 94746 event pairs, 1511 based on Foata normal form. 200/10182 useless extension candidates. Maximal degree in co-relation 12266. Up to 5329 conditions per place. [2025-01-10 06:50:38,844 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 59 selfloop transitions, 4 changer transitions 0/105 dead transitions. [2025-01-10 06:50:38,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 105 transitions, 383 flow [2025-01-10 06:50:38,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2025-01-10 06:50:38,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.699438202247191 [2025-01-10 06:50:38,846 INFO L175 Difference]: Start difference. First operand has 82 places, 83 transitions, 208 flow. Second operand 4 states and 249 transitions. [2025-01-10 06:50:38,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 105 transitions, 383 flow [2025-01-10 06:50:38,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 105 transitions, 373 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:38,869 INFO L231 Difference]: Finished difference. Result has 81 places, 82 transitions, 206 flow [2025-01-10 06:50:38,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=81, PETRI_TRANSITIONS=82} [2025-01-10 06:50:38,870 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-01-10 06:50:38,870 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 82 transitions, 206 flow [2025-01-10 06:50:38,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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:50:38,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:38,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:38,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:50:38,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:38,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash 118420771, now seen corresponding path program 1 times [2025-01-10 06:50:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289590928] [2025-01-10 06:50:38,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:38,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:38,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:50:38,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:50:38,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:38,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:38,908 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:50:38,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:38,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289590928] [2025-01-10 06:50:38,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289590928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:38,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:38,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:50:38,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654186386] [2025-01-10 06:50:38,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:38,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:38,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:38,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:38,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:38,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 89 [2025-01-10 06:50:38,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 82 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 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:50:38,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:38,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 89 [2025-01-10 06:50:38,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:39,321 INFO L124 PetriNetUnfolderBase]: 4957/9647 cut-off events. [2025-01-10 06:50:39,322 INFO L125 PetriNetUnfolderBase]: For 2857/2995 co-relation queries the response was YES. [2025-01-10 06:50:39,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18122 conditions, 9647 events. 4957/9647 cut-off events. For 2857/2995 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 84613 event pairs, 1729 based on Foata normal form. 138/8142 useless extension candidates. Maximal degree in co-relation 10504. Up to 3328 conditions per place. [2025-01-10 06:50:39,369 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 59 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2025-01-10 06:50:39,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 105 transitions, 403 flow [2025-01-10 06:50:39,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-01-10 06:50:39,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7050561797752809 [2025-01-10 06:50:39,371 INFO L175 Difference]: Start difference. First operand has 81 places, 82 transitions, 206 flow. Second operand 4 states and 251 transitions. [2025-01-10 06:50:39,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 105 transitions, 403 flow [2025-01-10 06:50:39,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 105 transitions, 389 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:39,379 INFO L231 Difference]: Finished difference. Result has 80 places, 81 transitions, 202 flow [2025-01-10 06:50:39,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=80, PETRI_TRANSITIONS=81} [2025-01-10 06:50:39,379 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -2 predicate places. [2025-01-10 06:50:39,379 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 81 transitions, 202 flow [2025-01-10 06:50:39,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 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:50:39,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:39,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:39,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:50:39,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:39,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash 220892581, now seen corresponding path program 1 times [2025-01-10 06:50:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:39,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814612516] [2025-01-10 06:50:39,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:39,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:50:39,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:50:39,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:39,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:39,428 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:50:39,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:39,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814612516] [2025-01-10 06:50:39,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814612516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:39,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890237596] [2025-01-10 06:50:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:39,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:39,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:39,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:39,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 89 [2025-01-10 06:50:39,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 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:50:39,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:39,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 89 [2025-01-10 06:50:39,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:40,089 INFO L124 PetriNetUnfolderBase]: 8866/13773 cut-off events. [2025-01-10 06:50:40,089 INFO L125 PetriNetUnfolderBase]: For 1949/1949 co-relation queries the response was YES. [2025-01-10 06:50:40,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28820 conditions, 13773 events. 8866/13773 cut-off events. For 1949/1949 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 101086 event pairs, 1439 based on Foata normal form. 0/12606 useless extension candidates. Maximal degree in co-relation 16044. Up to 6491 conditions per place. [2025-01-10 06:50:40,165 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 82 selfloop transitions, 6 changer transitions 0/126 dead transitions. [2025-01-10 06:50:40,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 126 transitions, 482 flow [2025-01-10 06:50:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:50:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:50:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 318 transitions. [2025-01-10 06:50:40,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7146067415730337 [2025-01-10 06:50:40,166 INFO L175 Difference]: Start difference. First operand has 80 places, 81 transitions, 202 flow. Second operand 5 states and 318 transitions. [2025-01-10 06:50:40,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 126 transitions, 482 flow [2025-01-10 06:50:40,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 126 transitions, 468 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:40,189 INFO L231 Difference]: Finished difference. Result has 80 places, 80 transitions, 206 flow [2025-01-10 06:50:40,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=80, PETRI_TRANSITIONS=80} [2025-01-10 06:50:40,190 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -2 predicate places. [2025-01-10 06:50:40,190 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 80 transitions, 206 flow [2025-01-10 06:50:40,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 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:50:40,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:40,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:40,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:50:40,191 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash 220893606, now seen corresponding path program 1 times [2025-01-10 06:50:40,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:40,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982041240] [2025-01-10 06:50:40,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:40,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:50:40,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:50:40,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:40,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:40,224 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:50:40,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982041240] [2025-01-10 06:50:40,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982041240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:40,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:40,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464698668] [2025-01-10 06:50:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:40,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:40,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:40,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:40,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:40,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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:50:40,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:40,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:40,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:40,937 INFO L124 PetriNetUnfolderBase]: 7078/12011 cut-off events. [2025-01-10 06:50:40,938 INFO L125 PetriNetUnfolderBase]: For 4309/4309 co-relation queries the response was YES. [2025-01-10 06:50:40,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24672 conditions, 12011 events. 7078/12011 cut-off events. For 4309/4309 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 96028 event pairs, 2971 based on Foata normal form. 182/10647 useless extension candidates. Maximal degree in co-relation 13510. Up to 5734 conditions per place. [2025-01-10 06:50:41,015 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 84 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2025-01-10 06:50:41,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 126 transitions, 476 flow [2025-01-10 06:50:41,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 269 transitions. [2025-01-10 06:50:41,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7556179775280899 [2025-01-10 06:50:41,017 INFO L175 Difference]: Start difference. First operand has 80 places, 80 transitions, 206 flow. Second operand 4 states and 269 transitions. [2025-01-10 06:50:41,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 126 transitions, 476 flow [2025-01-10 06:50:41,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 126 transitions, 464 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:41,040 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 196 flow [2025-01-10 06:50:41,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2025-01-10 06:50:41,040 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -3 predicate places. [2025-01-10 06:50:41,041 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 196 flow [2025-01-10 06:50:41,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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:50:41,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:41,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:41,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:50:41,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:41,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:41,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1025681494, now seen corresponding path program 1 times [2025-01-10 06:50:41,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:41,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744339363] [2025-01-10 06:50:41,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:41,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:41,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:50:41,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:50:41,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:41,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:41,082 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:50:41,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:41,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744339363] [2025-01-10 06:50:41,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744339363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:41,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:41,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:41,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340940333] [2025-01-10 06:50:41,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:41,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:41,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:41,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:41,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:41,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:41,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:41,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:41,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:41,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:42,063 INFO L124 PetriNetUnfolderBase]: 10446/16968 cut-off events. [2025-01-10 06:50:42,063 INFO L125 PetriNetUnfolderBase]: For 5198/5494 co-relation queries the response was YES. [2025-01-10 06:50:42,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34453 conditions, 16968 events. 10446/16968 cut-off events. For 5198/5494 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 135357 event pairs, 3702 based on Foata normal form. 712/15051 useless extension candidates. Maximal degree in co-relation 19694. Up to 7186 conditions per place. [2025-01-10 06:50:42,155 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 88 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2025-01-10 06:50:42,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 128 transitions, 530 flow [2025-01-10 06:50:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2025-01-10 06:50:42,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7584269662921348 [2025-01-10 06:50:42,157 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 196 flow. Second operand 4 states and 270 transitions. [2025-01-10 06:50:42,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 128 transitions, 530 flow [2025-01-10 06:50:42,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 128 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:42,280 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 224 flow [2025-01-10 06:50:42,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2025-01-10 06:50:42,280 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2025-01-10 06:50:42,280 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 224 flow [2025-01-10 06:50:42,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:42,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:42,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:42,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:50:42,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:42,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1742263885, now seen corresponding path program 1 times [2025-01-10 06:50:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:42,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552180806] [2025-01-10 06:50:42,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:42,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:42,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:50:42,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:50:42,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:42,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:42,334 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:50:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552180806] [2025-01-10 06:50:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552180806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:42,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:42,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:50:42,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047071752] [2025-01-10 06:50:42,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:42,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:50:42,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:42,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:50:42,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:50:42,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 89 [2025-01-10 06:50:42,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 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:50:42,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:42,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 89 [2025-01-10 06:50:42,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:43,248 INFO L124 PetriNetUnfolderBase]: 10506/16584 cut-off events. [2025-01-10 06:50:43,248 INFO L125 PetriNetUnfolderBase]: For 6465/6923 co-relation queries the response was YES. [2025-01-10 06:50:43,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36374 conditions, 16584 events. 10506/16584 cut-off events. For 6465/6923 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 127853 event pairs, 1845 based on Foata normal form. 676/15822 useless extension candidates. Maximal degree in co-relation 21993. Up to 4393 conditions per place. [2025-01-10 06:50:43,335 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 110 selfloop transitions, 9 changer transitions 0/156 dead transitions. [2025-01-10 06:50:43,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 156 transitions, 675 flow [2025-01-10 06:50:43,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 368 transitions. [2025-01-10 06:50:43,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6891385767790262 [2025-01-10 06:50:43,338 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 224 flow. Second operand 6 states and 368 transitions. [2025-01-10 06:50:43,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 156 transitions, 675 flow [2025-01-10 06:50:43,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 156 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:50:43,374 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 249 flow [2025-01-10 06:50:43,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-01-10 06:50:43,376 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places. [2025-01-10 06:50:43,376 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 249 flow [2025-01-10 06:50:43,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 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:50:43,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:43,377 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:43,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:50:43,377 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:43,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1731354505, now seen corresponding path program 1 times [2025-01-10 06:50:43,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:43,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402934513] [2025-01-10 06:50:43,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:43,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:43,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:50:43,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:50:43,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:43,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:43,479 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:50:43,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:43,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402934513] [2025-01-10 06:50:43,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402934513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:43,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:43,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:50:43,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925254758] [2025-01-10 06:50:43,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:43,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:43,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:43,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:43,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:43,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 89 [2025-01-10 06:50:43,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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:50:43,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:43,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 89 [2025-01-10 06:50:43,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:44,217 INFO L124 PetriNetUnfolderBase]: 7726/14246 cut-off events. [2025-01-10 06:50:44,217 INFO L125 PetriNetUnfolderBase]: For 11859/12524 co-relation queries the response was YES. [2025-01-10 06:50:44,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31649 conditions, 14246 events. 7726/14246 cut-off events. For 11859/12524 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 126563 event pairs, 2027 based on Foata normal form. 556/13262 useless extension candidates. Maximal degree in co-relation 18368. Up to 5836 conditions per place. [2025-01-10 06:50:44,300 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 62 selfloop transitions, 4 changer transitions 0/104 dead transitions. [2025-01-10 06:50:44,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 104 transitions, 464 flow [2025-01-10 06:50:44,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-01-10 06:50:44,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7050561797752809 [2025-01-10 06:50:44,302 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 249 flow. Second operand 4 states and 251 transitions. [2025-01-10 06:50:44,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 104 transitions, 464 flow [2025-01-10 06:50:44,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 104 transitions, 442 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:44,374 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 242 flow [2025-01-10 06:50:44,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2025-01-10 06:50:44,376 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places. [2025-01-10 06:50:44,376 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 242 flow [2025-01-10 06:50:44,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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:50:44,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:44,377 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:44,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:50:44,378 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:44,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2132249094, now seen corresponding path program 1 times [2025-01-10 06:50:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:44,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776212996] [2025-01-10 06:50:44,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:44,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:44,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:50:44,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:50:44,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:44,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:44,426 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:50:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:44,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776212996] [2025-01-10 06:50:44,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776212996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:44,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:44,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:44,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160781741] [2025-01-10 06:50:44,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:44,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:44,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:44,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:44,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:44,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:44,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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:50:44,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:44,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:44,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:45,586 INFO L124 PetriNetUnfolderBase]: 10766/19813 cut-off events. [2025-01-10 06:50:45,587 INFO L125 PetriNetUnfolderBase]: For 13565/14956 co-relation queries the response was YES. [2025-01-10 06:50:45,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42679 conditions, 19813 events. 10766/19813 cut-off events. For 13565/14956 co-relation queries the response was YES. Maximal size of possible extension queue 1110. Compared 182288 event pairs, 4640 based on Foata normal form. 1047/18012 useless extension candidates. Maximal degree in co-relation 25696. Up to 8518 conditions per place. [2025-01-10 06:50:45,687 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 97 selfloop transitions, 5 changer transitions 0/138 dead transitions. [2025-01-10 06:50:45,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 138 transitions, 668 flow [2025-01-10 06:50:45,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:45,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2025-01-10 06:50:45,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7528089887640449 [2025-01-10 06:50:45,689 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 242 flow. Second operand 4 states and 268 transitions. [2025-01-10 06:50:45,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 138 transitions, 668 flow [2025-01-10 06:50:45,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 138 transitions, 648 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:45,724 INFO L231 Difference]: Finished difference. Result has 87 places, 82 transitions, 261 flow [2025-01-10 06:50:45,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=87, PETRI_TRANSITIONS=82} [2025-01-10 06:50:45,725 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places. [2025-01-10 06:50:45,725 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 82 transitions, 261 flow [2025-01-10 06:50:45,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 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:50:45,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:45,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:45,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:50:45,726 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:45,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:45,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2132248069, now seen corresponding path program 1 times [2025-01-10 06:50:45,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:45,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600195112] [2025-01-10 06:50:45,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:45,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:45,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:50:45,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:50:45,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:45,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:45,791 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:50:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:45,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600195112] [2025-01-10 06:50:45,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600195112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:45,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:45,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492545499] [2025-01-10 06:50:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:45,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:45,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:45,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:45,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 89 [2025-01-10 06:50:45,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 82 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 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:50:45,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:45,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 89 [2025-01-10 06:50:45,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:46,901 INFO L124 PetriNetUnfolderBase]: 13072/21067 cut-off events. [2025-01-10 06:50:46,902 INFO L125 PetriNetUnfolderBase]: For 16274/18213 co-relation queries the response was YES. [2025-01-10 06:50:46,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50638 conditions, 21067 events. 13072/21067 cut-off events. For 16274/18213 co-relation queries the response was YES. Maximal size of possible extension queue 1154. Compared 169967 event pairs, 2189 based on Foata normal form. 1372/21229 useless extension candidates. Maximal degree in co-relation 32023. Up to 9910 conditions per place. [2025-01-10 06:50:47,016 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 96 selfloop transitions, 6 changer transitions 0/136 dead transitions. [2025-01-10 06:50:47,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 136 transitions, 667 flow [2025-01-10 06:50:47,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:50:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:50:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 316 transitions. [2025-01-10 06:50:47,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7101123595505618 [2025-01-10 06:50:47,018 INFO L175 Difference]: Start difference. First operand has 87 places, 82 transitions, 261 flow. Second operand 5 states and 316 transitions. [2025-01-10 06:50:47,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 136 transitions, 667 flow [2025-01-10 06:50:47,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 136 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:47,093 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 275 flow [2025-01-10 06:50:47,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2025-01-10 06:50:47,094 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 8 predicate places. [2025-01-10 06:50:47,094 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 275 flow [2025-01-10 06:50:47,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 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:50:47,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:47,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:47,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:50:47,095 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:47,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1523255093, now seen corresponding path program 1 times [2025-01-10 06:50:47,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:47,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075531126] [2025-01-10 06:50:47,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:47,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:47,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:50:47,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:50:47,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:47,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:47,133 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:50:47,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:47,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075531126] [2025-01-10 06:50:47,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075531126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:47,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:47,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:50:47,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909832309] [2025-01-10 06:50:47,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:47,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:47,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:47,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:47,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:47,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 89 [2025-01-10 06:50:47,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 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:50:47,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:47,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 89 [2025-01-10 06:50:47,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:48,892 INFO L124 PetriNetUnfolderBase]: 13047/21037 cut-off events. [2025-01-10 06:50:48,892 INFO L125 PetriNetUnfolderBase]: For 17511/18543 co-relation queries the response was YES. [2025-01-10 06:50:49,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52795 conditions, 21037 events. 13047/21037 cut-off events. For 17511/18543 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 169428 event pairs, 4671 based on Foata normal form. 910/20592 useless extension candidates. Maximal degree in co-relation 33853. Up to 9062 conditions per place. [2025-01-10 06:50:49,125 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 154 selfloop transitions, 8 changer transitions 0/195 dead transitions. [2025-01-10 06:50:49,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 195 transitions, 1021 flow [2025-01-10 06:50:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 396 transitions. [2025-01-10 06:50:49,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7415730337078652 [2025-01-10 06:50:49,127 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 275 flow. Second operand 6 states and 396 transitions. [2025-01-10 06:50:49,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 195 transitions, 1021 flow [2025-01-10 06:50:49,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 195 transitions, 983 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:49,313 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 290 flow [2025-01-10 06:50:49,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=92, PETRI_TRANSITIONS=83} [2025-01-10 06:50:49,314 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 10 predicate places. [2025-01-10 06:50:49,315 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 290 flow [2025-01-10 06:50:49,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 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:50:49,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:49,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:49,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:50:49,316 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:49,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2132413138, now seen corresponding path program 1 times [2025-01-10 06:50:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15079148] [2025-01-10 06:50:49,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:49,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:50:49,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:50:49,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:49,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:49,363 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:50:49,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:49,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15079148] [2025-01-10 06:50:49,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15079148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:49,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:49,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:50:49,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963472491] [2025-01-10 06:50:49,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:49,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:49,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:49,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:49,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:49,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 89 [2025-01-10 06:50:49,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 83 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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:50:49,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:49,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 89 [2025-01-10 06:50:49,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:50,363 INFO L124 PetriNetUnfolderBase]: 9596/17556 cut-off events. [2025-01-10 06:50:50,363 INFO L125 PetriNetUnfolderBase]: For 22111/23208 co-relation queries the response was YES. [2025-01-10 06:50:50,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42330 conditions, 17556 events. 9596/17556 cut-off events. For 22111/23208 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 158065 event pairs, 2522 based on Foata normal form. 1213/17166 useless extension candidates. Maximal degree in co-relation 29154. Up to 7473 conditions per place. [2025-01-10 06:50:50,478 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 71 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2025-01-10 06:50:50,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 110 transitions, 557 flow [2025-01-10 06:50:50,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2025-01-10 06:50:50,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6938202247191011 [2025-01-10 06:50:50,480 INFO L175 Difference]: Start difference. First operand has 92 places, 83 transitions, 290 flow. Second operand 4 states and 247 transitions. [2025-01-10 06:50:50,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 110 transitions, 557 flow [2025-01-10 06:50:50,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 110 transitions, 529 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-01-10 06:50:50,563 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 278 flow [2025-01-10 06:50:50,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2025-01-10 06:50:50,565 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 8 predicate places. [2025-01-10 06:50:50,565 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 278 flow [2025-01-10 06:50:50,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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:50:50,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:50,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:50,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:50:50,566 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:50,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:50,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1675181420, now seen corresponding path program 1 times [2025-01-10 06:50:50,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:50,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889706533] [2025-01-10 06:50:50,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:50,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:50,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:50:50,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:50:50,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:50,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:50,624 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:50:50,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:50,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889706533] [2025-01-10 06:50:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889706533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:50,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:50,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:50:50,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106510542] [2025-01-10 06:50:50,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:50,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:50:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:50,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:50:50,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:50:50,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 89 [2025-01-10 06:50:50,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 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:50:50,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:50,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 89 [2025-01-10 06:50:50,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:51,937 INFO L124 PetriNetUnfolderBase]: 13072/20501 cut-off events. [2025-01-10 06:50:51,938 INFO L125 PetriNetUnfolderBase]: For 23962/25343 co-relation queries the response was YES. [2025-01-10 06:50:52,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51891 conditions, 20501 events. 13072/20501 cut-off events. For 23962/25343 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 159201 event pairs, 2180 based on Foata normal form. 1931/21222 useless extension candidates. Maximal degree in co-relation 35551. Up to 5475 conditions per place. [2025-01-10 06:50:52,094 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 124 selfloop transitions, 9 changer transitions 0/166 dead transitions. [2025-01-10 06:50:52,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 166 transitions, 880 flow [2025-01-10 06:50:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 365 transitions. [2025-01-10 06:50:52,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6835205992509363 [2025-01-10 06:50:52,096 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 278 flow. Second operand 6 states and 365 transitions. [2025-01-10 06:50:52,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 166 transitions, 880 flow [2025-01-10 06:50:52,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 166 transitions, 854 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:52,173 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 295 flow [2025-01-10 06:50:52,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2025-01-10 06:50:52,174 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 10 predicate places. [2025-01-10 06:50:52,174 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 295 flow [2025-01-10 06:50:52,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 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:50:52,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:52,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:52,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:50:52,174 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:52,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:52,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1680297094, now seen corresponding path program 1 times [2025-01-10 06:50:52,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:52,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099677561] [2025-01-10 06:50:52,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:52,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:50:52,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:50:52,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:52,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:52,222 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:50:52,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:52,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099677561] [2025-01-10 06:50:52,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099677561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:52,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:52,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:52,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672611915] [2025-01-10 06:50:52,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:52,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:52,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:52,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:52,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:52,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:52,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 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:50:52,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:52,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:52,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:53,143 INFO L124 PetriNetUnfolderBase]: 10843/18836 cut-off events. [2025-01-10 06:50:53,144 INFO L125 PetriNetUnfolderBase]: For 26830/28713 co-relation queries the response was YES. [2025-01-10 06:50:53,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47874 conditions, 18836 events. 10843/18836 cut-off events. For 26830/28713 co-relation queries the response was YES. Maximal size of possible extension queue 1023. Compared 163033 event pairs, 4871 based on Foata normal form. 1861/19194 useless extension candidates. Maximal degree in co-relation 33017. Up to 9101 conditions per place. [2025-01-10 06:50:53,248 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 104 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2025-01-10 06:50:53,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 140 transitions, 763 flow [2025-01-10 06:50:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2025-01-10 06:50:53,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7443820224719101 [2025-01-10 06:50:53,250 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 295 flow. Second operand 4 states and 265 transitions. [2025-01-10 06:50:53,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 140 transitions, 763 flow [2025-01-10 06:50:53,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 140 transitions, 729 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:50:53,307 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 281 flow [2025-01-10 06:50:53,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2025-01-10 06:50:53,309 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 8 predicate places. [2025-01-10 06:50:53,309 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 281 flow [2025-01-10 06:50:53,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 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:50:53,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:53,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:53,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:50:53,310 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:53,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1680298119, now seen corresponding path program 1 times [2025-01-10 06:50:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417096181] [2025-01-10 06:50:53,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:53,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:53,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:50:53,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:50:53,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:53,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:53,376 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:50:53,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:53,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417096181] [2025-01-10 06:50:53,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417096181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:53,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:53,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:53,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004493853] [2025-01-10 06:50:53,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:53,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:53,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:53,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:53,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:53,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 89 [2025-01-10 06:50:53,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:53,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:53,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 89 [2025-01-10 06:50:53,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:54,349 INFO L124 PetriNetUnfolderBase]: 13066/20406 cut-off events. [2025-01-10 06:50:54,349 INFO L125 PetriNetUnfolderBase]: For 24139/26698 co-relation queries the response was YES. [2025-01-10 06:50:54,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53226 conditions, 20406 events. 13066/20406 cut-off events. For 24139/26698 co-relation queries the response was YES. Maximal size of possible extension queue 1071. Compared 156640 event pairs, 2539 based on Foata normal form. 2053/21486 useless extension candidates. Maximal degree in co-relation 36589. Up to 9209 conditions per place. [2025-01-10 06:50:54,498 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 102 selfloop transitions, 6 changer transitions 0/138 dead transitions. [2025-01-10 06:50:54,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 733 flow [2025-01-10 06:50:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:50:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:50:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2025-01-10 06:50:54,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7056179775280899 [2025-01-10 06:50:54,500 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 281 flow. Second operand 5 states and 314 transitions. [2025-01-10 06:50:54,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 733 flow [2025-01-10 06:50:54,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 138 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:50:54,567 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 285 flow [2025-01-10 06:50:54,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2025-01-10 06:50:54,568 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places. [2025-01-10 06:50:54,568 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 285 flow [2025-01-10 06:50:54,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.2) internal successors, (241), 5 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:54,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:54,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:54,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:50:54,569 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:54,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1338334283, now seen corresponding path program 1 times [2025-01-10 06:50:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:54,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473877894] [2025-01-10 06:50:54,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:54,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:50:54,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:50:54,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:54,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:54,605 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:50:54,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473877894] [2025-01-10 06:50:54,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473877894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:54,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:54,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:50:54,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220257593] [2025-01-10 06:50:54,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:54,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:50:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:54,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:50:54,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:50:54,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 89 [2025-01-10 06:50:54,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:54,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:54,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 89 [2025-01-10 06:50:54,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:55,531 INFO L124 PetriNetUnfolderBase]: 12976/20373 cut-off events. [2025-01-10 06:50:55,531 INFO L125 PetriNetUnfolderBase]: For 27756/29257 co-relation queries the response was YES. [2025-01-10 06:50:55,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53179 conditions, 20373 events. 12976/20373 cut-off events. For 27756/29257 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 158165 event pairs, 4595 based on Foata normal form. 1776/21142 useless extension candidates. Maximal degree in co-relation 36365. Up to 8717 conditions per place. [2025-01-10 06:50:55,677 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 100 selfloop transitions, 5 changer transitions 0/136 dead transitions. [2025-01-10 06:50:55,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 136 transitions, 719 flow [2025-01-10 06:50:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:50:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:50:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2025-01-10 06:50:55,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7443820224719101 [2025-01-10 06:50:55,678 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 285 flow. Second operand 4 states and 265 transitions. [2025-01-10 06:50:55,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 136 transitions, 719 flow [2025-01-10 06:50:55,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 136 transitions, 698 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:50:55,715 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 290 flow [2025-01-10 06:50:55,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2025-01-10 06:50:55,716 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places. [2025-01-10 06:50:55,716 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 290 flow [2025-01-10 06:50:55,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:50:55,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:55,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:55,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:50:55,716 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:55,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:55,717 INFO L85 PathProgramCache]: Analyzing trace with hash -549633391, now seen corresponding path program 1 times [2025-01-10 06:50:55,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:55,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27500500] [2025-01-10 06:50:55,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:55,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:55,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:50:55,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:50:55,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:55,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:55,759 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:50:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27500500] [2025-01-10 06:50:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27500500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:55,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:55,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:50:55,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790142572] [2025-01-10 06:50:55,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:55,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:50:55,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:55,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:50:55,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:50:55,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 89 [2025-01-10 06:50:55,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 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:50:55,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:55,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 89 [2025-01-10 06:50:55,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:57,019 INFO L124 PetriNetUnfolderBase]: 14136/21773 cut-off events. [2025-01-10 06:50:57,019 INFO L125 PetriNetUnfolderBase]: For 34632/36787 co-relation queries the response was YES. [2025-01-10 06:50:57,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59690 conditions, 21773 events. 14136/21773 cut-off events. For 34632/36787 co-relation queries the response was YES. Maximal size of possible extension queue 1153. Compared 165586 event pairs, 2778 based on Foata normal form. 2709/23427 useless extension candidates. Maximal degree in co-relation 44858. Up to 5672 conditions per place. [2025-01-10 06:50:57,149 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 132 selfloop transitions, 9 changer transitions 0/170 dead transitions. [2025-01-10 06:50:57,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 170 transitions, 980 flow [2025-01-10 06:50:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 362 transitions. [2025-01-10 06:50:57,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6779026217228464 [2025-01-10 06:50:57,151 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 290 flow. Second operand 6 states and 362 transitions. [2025-01-10 06:50:57,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 170 transitions, 980 flow [2025-01-10 06:50:57,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 170 transitions, 964 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:50:57,217 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 311 flow [2025-01-10 06:50:57,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=311, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2025-01-10 06:50:57,218 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 13 predicate places. [2025-01-10 06:50:57,218 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 311 flow [2025-01-10 06:50:57,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 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:50:57,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:50:57,218 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:50:57,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:50:57,218 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-01-10 06:50:57,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:50:57,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1088551903, now seen corresponding path program 1 times [2025-01-10 06:50:57,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:50:57,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082422788] [2025-01-10 06:50:57,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:50:57,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:50:57,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:50:57,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:50:57,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:50:57,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:50:57,265 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:50:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:50:57,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082422788] [2025-01-10 06:50:57,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082422788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:50:57,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:50:57,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:50:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81662446] [2025-01-10 06:50:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:50:57,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:50:57,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:50:57,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:50:57,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:50:57,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 89 [2025-01-10 06:50:57,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 311 flow. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 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:50:57,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:50:57,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 89 [2025-01-10 06:50:57,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:50:58,363 INFO L124 PetriNetUnfolderBase]: 14136/21114 cut-off events. [2025-01-10 06:50:58,363 INFO L125 PetriNetUnfolderBase]: For 35491/37605 co-relation queries the response was YES. [2025-01-10 06:50:58,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61269 conditions, 21114 events. 14136/21114 cut-off events. For 35491/37605 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 153773 event pairs, 5330 based on Foata normal form. 2391/22935 useless extension candidates. Maximal degree in co-relation 46289. Up to 10143 conditions per place. [2025-01-10 06:50:58,466 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 0 selfloop transitions, 0 changer transitions 201/201 dead transitions. [2025-01-10 06:50:58,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 201 transitions, 1189 flow [2025-01-10 06:50:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:50:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:50:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 388 transitions. [2025-01-10 06:50:58,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7265917602996255 [2025-01-10 06:50:58,473 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 311 flow. Second operand 6 states and 388 transitions. [2025-01-10 06:50:58,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 201 transitions, 1189 flow [2025-01-10 06:50:58,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 201 transitions, 1171 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 06:50:58,669 INFO L231 Difference]: Finished difference. Result has 94 places, 0 transitions, 0 flow [2025-01-10 06:50:58,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=94, PETRI_TRANSITIONS=0} [2025-01-10 06:50:58,670 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 12 predicate places. [2025-01-10 06:50:58,670 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 0 transitions, 0 flow [2025-01-10 06:50:58,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 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:50:58,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 39 remaining) [2025-01-10 06:50:58,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 39 remaining) [2025-01-10 06:50:58,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 39 remaining) [2025-01-10 06:50:58,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 39 remaining) [2025-01-10 06:50:58,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 39 remaining) [2025-01-10 06:50:58,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 39 remaining) [2025-01-10 06:50:58,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 39 remaining) [2025-01-10 06:50:58,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 39 remaining) [2025-01-10 06:50:58,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 39 remaining) [2025-01-10 06:50:58,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 39 remaining) [2025-01-10 06:50:58,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 39 remaining) [2025-01-10 06:50:58,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 39 remaining) [2025-01-10 06:50:58,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 39 remaining) [2025-01-10 06:50:58,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 39 remaining) [2025-01-10 06:50:58,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 39 remaining) [2025-01-10 06:50:58,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 39 remaining) [2025-01-10 06:50:58,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 39 remaining) [2025-01-10 06:50:58,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 39 remaining) [2025-01-10 06:50:58,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 39 remaining) [2025-01-10 06:50:58,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 39 remaining) [2025-01-10 06:50:58,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 39 remaining) [2025-01-10 06:50:58,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 39 remaining) [2025-01-10 06:50:58,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 39 remaining) [2025-01-10 06:50:58,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 39 remaining) [2025-01-10 06:50:58,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:50:58,675 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:50:58,679 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:50:58,679 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:50:58,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:50:58 BasicIcfg [2025-01-10 06:50:58,682 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:50:58,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:50:58,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:50:58,683 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:50:58,683 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:50:33" (3/4) ... [2025-01-10 06:50:58,684 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:50:58,686 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 06:50:58,686 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 06:50:58,686 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-10 06:50:58,688 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2025-01-10 06:50:58,688 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-10 06:50:58,688 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 06:50:58,689 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 06:50:58,738 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:50:58,738 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:50:58,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:50:58,739 INFO L158 Benchmark]: Toolchain (without parser) took 25993.98ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 111.8MB in the beginning and 980.4MB in the end (delta: -868.5MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-01-10 06:50:58,739 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:50:58,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.57ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 99.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:50:58,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.34ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:50:58,739 INFO L158 Benchmark]: Boogie Preprocessor took 30.91ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 95.4MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:50:58,739 INFO L158 Benchmark]: RCFGBuilder took 749.13ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 46.8MB in the end (delta: 48.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-10 06:50:58,740 INFO L158 Benchmark]: TraceAbstraction took 24906.30ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 46.0MB in the beginning and 984.6MB in the end (delta: -938.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-01-10 06:50:58,740 INFO L158 Benchmark]: Witness Printer took 55.61ms. Allocated memory is still 2.3GB. Free memory was 984.6MB in the beginning and 980.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:50:58,741 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.57ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 99.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.34ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.91ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 95.4MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 749.13ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 46.8MB in the end (delta: 48.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24906.30ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 46.0MB in the beginning and 984.6MB in the end (delta: -938.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 55.61ms. Allocated memory is still 2.3GB. Free memory was 984.6MB in the beginning and 980.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 39 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1982 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1701 mSDsluCounter, 180 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3944 IncrementalHoareTripleChecker+Invalid, 4045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 83 mSDtfsCounter, 3944 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=311occurred in iteration=19, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:50:58,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE