./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:24:25,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:24:25,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 22:24:25,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:24:25,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:24:25,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:24:25,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:24:25,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:24:25,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:24:25,495 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:24:25,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 22:24:25,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 22:24:25,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:24:25,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:24:25,498 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:24:25,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:24:25,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 22:24:25,499 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 22:24:25,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:24:25,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 22:24:25,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:24:25,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 22:24:25,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 22:24:25,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 22:24:25,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:24:25,502 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 22:24:25,503 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:24:25,503 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 22:24:25,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:24:25,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:24:25,504 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:24:25,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:24:25,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 22:24:25,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 22:24:25,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 22:24:25,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:24:25,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 22:24:25,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 22:24:25,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:24:25,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 22:24:25,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 22:24:25,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 22:24:25,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 22:24:25,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 22:24:25,509 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2024-11-10 22:24:25,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:24:25,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:24:25,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:24:25,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:24:25,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:24:25,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-10 22:24:27,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:24:27,381 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:24:27,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-10 22:24:27,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d69ed6e1/c98fc5cb79204039bf915aabfba55052/FLAG4530115cb [2024-11-10 22:24:27,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d69ed6e1/c98fc5cb79204039bf915aabfba55052 [2024-11-10 22:24:27,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:24:27,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:24:27,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:24:27,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:24:27,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:24:27,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1081a3ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27, skipping insertion in model container [2024-11-10 22:24:27,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:24:27,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:24:27,667 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:24:27,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:24:27,704 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:24:27,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27 WrapperNode [2024-11-10 22:24:27,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:24:27,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:24:27,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:24:27,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:24:27,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,749 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 190 [2024-11-10 22:24:27,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:24:27,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:24:27,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:24:27,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:24:27,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,783 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]. [2024-11-10 22:24:27,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,789 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:24:27,800 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:24:27,801 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:24:27,801 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:24:27,802 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (1/1) ... [2024-11-10 22:24:27,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 22:24:27,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:24:27,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 22:24:27,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 22:24:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 22:24:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 22:24:27,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 22:24:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 22:24:27,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 22:24:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 22:24:27,899 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 22:24:27,899 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-10 22:24:27,899 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-10 22:24:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 22:24:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:24:27,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:24:27,902 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 22:24:28,027 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:24:28,030 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:24:28,385 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 22:24:28,386 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:24:28,639 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:24:28,640 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:24:28,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:24:28 BoogieIcfgContainer [2024-11-10 22:24:28,640 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:24:28,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 22:24:28,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 22:24:28,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 22:24:28,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:24:27" (1/3) ... [2024-11-10 22:24:28,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fce111e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:24:28, skipping insertion in model container [2024-11-10 22:24:28,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:27" (2/3) ... [2024-11-10 22:24:28,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fce111e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:24:28, skipping insertion in model container [2024-11-10 22:24:28,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:24:28" (3/3) ... [2024-11-10 22:24:28,650 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2024-11-10 22:24:28,669 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 22:24:28,670 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-10 22:24:28,670 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 22:24:28,753 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-10 22:24:28,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 73 transitions, 174 flow [2024-11-10 22:24:28,838 INFO L124 PetriNetUnfolderBase]: 3/69 cut-off events. [2024-11-10 22:24:28,839 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 22:24:28,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 69 events. 3/69 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 181 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2024-11-10 22:24:28,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 73 transitions, 174 flow [2024-11-10 22:24:28,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 67 transitions, 155 flow [2024-11-10 22:24:28,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 22:24:28,864 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;@39ed42bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 22:24:28,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-11-10 22:24:28,871 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 22:24:28,875 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-11-10 22:24:28,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 22:24:28,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 22:24:28,876 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:24:28,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-10 22:24:28,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:24:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash 682006572, now seen corresponding path program 1 times [2024-11-10 22:24:28,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:24:28,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577693862] [2024-11-10 22:24:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:24:28,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:24:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:24:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:24:29,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:24:29,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577693862] [2024-11-10 22:24:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577693862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:24:29,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:24:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:24:29,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580927247] [2024-11-10 22:24:29,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:24:29,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 22:24:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:24:29,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:24:29,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:24:29,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2024-11-10 22:24:29,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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) [2024-11-10 22:24:29,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 22:24:29,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2024-11-10 22:24:29,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 22:24:35,122 INFO L124 PetriNetUnfolderBase]: 57657/76775 cut-off events. [2024-11-10 22:24:35,122 INFO L125 PetriNetUnfolderBase]: For 2457/2457 co-relation queries the response was YES. [2024-11-10 22:24:35,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152333 conditions, 76775 events. 57657/76775 cut-off events. For 2457/2457 co-relation queries the response was YES. Maximal size of possible extension queue 3090. Compared 491357 event pairs, 45449 based on Foata normal form. 0/47187 useless extension candidates. Maximal degree in co-relation 144300. Up to 73132 conditions per place. [2024-11-10 22:24:35,843 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 50 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2024-11-10 22:24:35,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 63 transitions, 253 flow [2024-11-10 22:24:35,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:24:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 22:24:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-10 22:24:35,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4520547945205479 [2024-11-10 22:24:35,857 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 155 flow. Second operand 3 states and 99 transitions. [2024-11-10 22:24:35,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 63 transitions, 253 flow [2024-11-10 22:24:36,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 240 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-10 22:24:36,169 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 140 flow [2024-11-10 22:24:36,171 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-11-10 22:24:36,174 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, -9 predicate places. [2024-11-10 22:24:36,175 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 140 flow [2024-11-10 22:24:36,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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) [2024-11-10 22:24:36,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 22:24:36,175 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:24:36,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 22:24:36,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-10 22:24:36,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:24:36,177 INFO L85 PathProgramCache]: Analyzing trace with hash 682006573, now seen corresponding path program 1 times [2024-11-10 22:24:36,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:24:36,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581832373] [2024-11-10 22:24:36,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:24:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:24:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:24:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:24:36,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:24:36,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581832373] [2024-11-10 22:24:36,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581832373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:24:36,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:24:36,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:24:36,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545248210] [2024-11-10 22:24:36,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:24:36,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 22:24:36,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:24:36,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:24:36,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:24:36,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2024-11-10 22:24:36,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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) [2024-11-10 22:24:36,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 22:24:36,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2024-11-10 22:24:36,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 22:24:39,843 INFO L124 PetriNetUnfolderBase]: 57214/76146 cut-off events. [2024-11-10 22:24:39,844 INFO L125 PetriNetUnfolderBase]: For 609/609 co-relation queries the response was YES. [2024-11-10 22:24:40,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150337 conditions, 76146 events. 57214/76146 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 3213. Compared 482893 event pairs, 35458 based on Foata normal form. 0/47638 useless extension candidates. Maximal degree in co-relation 150313. Up to 72627 conditions per place. [2024-11-10 22:24:40,515 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 57 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2024-11-10 22:24:40,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 74 transitions, 294 flow [2024-11-10 22:24:40,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:24:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 22:24:40,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-11-10 22:24:40,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.502283105022831 [2024-11-10 22:24:40,520 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 140 flow. Second operand 3 states and 110 transitions. [2024-11-10 22:24:40,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 74 transitions, 294 flow [2024-11-10 22:24:40,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 22:24:40,524 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 179 flow [2024-11-10 22:24:40,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2024-11-10 22:24:40,525 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, -8 predicate places. [2024-11-10 22:24:40,525 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 179 flow [2024-11-10 22:24:40,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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) [2024-11-10 22:24:40,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 22:24:40,526 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:24:40,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 22:24:40,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-10 22:24:40,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:24:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1892069748, now seen corresponding path program 1 times [2024-11-10 22:24:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:24:40,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163044540] [2024-11-10 22:24:40,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:24:40,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:24:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:24:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:24:40,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:24:40,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163044540] [2024-11-10 22:24:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163044540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:24:40,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:24:40,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:24:40,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16615442] [2024-11-10 22:24:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:24:40,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 22:24:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:24:40,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 22:24:40,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 22:24:40,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2024-11-10 22:24:40,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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) [2024-11-10 22:24:40,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 22:24:40,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2024-11-10 22:24:40,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 22:24:45,465 INFO L124 PetriNetUnfolderBase]: 54876/73305 cut-off events. [2024-11-10 22:24:45,465 INFO L125 PetriNetUnfolderBase]: For 5215/5215 co-relation queries the response was YES. [2024-11-10 22:24:45,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155476 conditions, 73305 events. 54876/73305 cut-off events. For 5215/5215 co-relation queries the response was YES. Maximal size of possible extension queue 3175. Compared 469564 event pairs, 20100 based on Foata normal form. 0/46638 useless extension candidates. Maximal degree in co-relation 141283. Up to 69383 conditions per place. [2024-11-10 22:24:45,859 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 88 selfloop transitions, 11 changer transitions 0/109 dead transitions. [2024-11-10 22:24:45,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 477 flow [2024-11-10 22:24:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 22:24:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 22:24:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-11-10 22:24:45,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5445205479452054 [2024-11-10 22:24:45,861 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 179 flow. Second operand 4 states and 159 transitions. [2024-11-10 22:24:45,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 477 flow [2024-11-10 22:24:45,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 109 transitions, 470 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 22:24:45,865 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 234 flow [2024-11-10 22:24:45,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-11-10 22:24:45,866 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, -5 predicate places. [2024-11-10 22:24:45,866 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 234 flow [2024-11-10 22:24:45,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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) [2024-11-10 22:24:45,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 22:24:45,866 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:24:45,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 22:24:45,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-10 22:24:45,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:24:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash -955619215, now seen corresponding path program 1 times [2024-11-10 22:24:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:24:45,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249064897] [2024-11-10 22:24:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:24:45,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:24:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:24:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:24:45,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:24:45,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249064897] [2024-11-10 22:24:45,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249064897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:24:45,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:24:45,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:24:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679023179] [2024-11-10 22:24:45,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:24:45,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 22:24:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:24:45,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:24:45,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:24:45,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2024-11-10 22:24:45,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2024-11-10 22:24:45,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 22:24:45,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2024-11-10 22:24:45,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 22:24:49,495 INFO L124 PetriNetUnfolderBase]: 55465/73572 cut-off events. [2024-11-10 22:24:49,495 INFO L125 PetriNetUnfolderBase]: For 17683/17683 co-relation queries the response was YES. [2024-11-10 22:24:49,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170025 conditions, 73572 events. 55465/73572 cut-off events. For 17683/17683 co-relation queries the response was YES. Maximal size of possible extension queue 3206. Compared 455701 event pairs, 16940 based on Foata normal form. 0/49574 useless extension candidates. Maximal degree in co-relation 108337. Up to 45907 conditions per place. [2024-11-10 22:24:49,868 INFO L140 encePairwiseOnDemand]: 58/73 looper letters, 93 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2024-11-10 22:24:49,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 114 transitions, 587 flow [2024-11-10 22:24:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:24:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 22:24:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-11-10 22:24:49,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6301369863013698 [2024-11-10 22:24:49,870 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 234 flow. Second operand 3 states and 138 transitions. [2024-11-10 22:24:49,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 114 transitions, 587 flow [2024-11-10 22:24:49,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 114 transitions, 553 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-10 22:24:49,878 INFO L231 Difference]: Finished difference. Result has 74 places, 79 transitions, 296 flow [2024-11-10 22:24:49,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=74, PETRI_TRANSITIONS=79} [2024-11-10 22:24:49,879 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2024-11-10 22:24:49,880 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 79 transitions, 296 flow [2024-11-10 22:24:49,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2024-11-10 22:24:49,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 22:24:49,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:24:49,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 22:24:49,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-10 22:24:49,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:24:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash -955619216, now seen corresponding path program 1 times [2024-11-10 22:24:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:24:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011872712] [2024-11-10 22:24:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:24:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:24:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:24:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:24:50,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:24:50,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011872712] [2024-11-10 22:24:50,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011872712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:24:50,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:24:50,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:24:50,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941582713] [2024-11-10 22:24:50,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:24:50,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 22:24:50,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:24:50,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:24:50,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:24:50,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2024-11-10 22:24:50,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 79 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2024-11-10 22:24:50,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 22:24:50,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2024-11-10 22:24:50,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 22:24:52,380 INFO L124 PetriNetUnfolderBase]: 27301/37000 cut-off events. [2024-11-10 22:24:52,380 INFO L125 PetriNetUnfolderBase]: For 27393/27393 co-relation queries the response was YES. [2024-11-10 22:24:52,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98704 conditions, 37000 events. 27301/37000 cut-off events. For 27393/27393 co-relation queries the response was YES. Maximal size of possible extension queue 1605. Compared 227389 event pairs, 19374 based on Foata normal form. 5938/33805 useless extension candidates. Maximal degree in co-relation 17965. Up to 35452 conditions per place. [2024-11-10 22:24:52,551 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 58 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2024-11-10 22:24:52,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 71 transitions, 378 flow [2024-11-10 22:24:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:24:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 22:24:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-11-10 22:24:52,552 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4337899543378995 [2024-11-10 22:24:52,552 INFO L175 Difference]: Start difference. First operand has 74 places, 79 transitions, 296 flow. Second operand 3 states and 95 transitions. [2024-11-10 22:24:52,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 71 transitions, 378 flow [2024-11-10 22:24:52,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 22:24:52,557 INFO L231 Difference]: Finished difference. Result has 70 places, 71 transitions, 248 flow [2024-11-10 22:24:52,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=70, PETRI_TRANSITIONS=71} [2024-11-10 22:24:52,558 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, -7 predicate places. [2024-11-10 22:24:52,558 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 248 flow [2024-11-10 22:24:52,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) [2024-11-10 22:24:52,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 22:24:52,559 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:24:52,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 22:24:52,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-10 22:24:52,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:24:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash 618869412, now seen corresponding path program 1 times [2024-11-10 22:24:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:24:52,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295885023] [2024-11-10 22:24:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:24:52,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:24:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:24:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:24:52,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:24:52,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295885023] [2024-11-10 22:24:52,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295885023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:24:52,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:24:52,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 22:24:52,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916648644] [2024-11-10 22:24:52,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:24:52,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 22:24:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:24:52,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 22:24:52,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 22:24:52,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2024-11-10 22:24:52,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:24:52,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 22:24:52,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2024-11-10 22:24:52,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 22:24:54,442 INFO L124 PetriNetUnfolderBase]: 22166/30561 cut-off events. [2024-11-10 22:24:54,442 INFO L125 PetriNetUnfolderBase]: For 10080/10080 co-relation queries the response was YES. [2024-11-10 22:24:54,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76945 conditions, 30561 events. 22166/30561 cut-off events. For 10080/10080 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 186173 event pairs, 4361 based on Foata normal form. 0/24196 useless extension candidates. Maximal degree in co-relation 76912. Up to 27029 conditions per place. [2024-11-10 22:24:54,614 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 110 selfloop transitions, 15 changer transitions 0/135 dead transitions. [2024-11-10 22:24:54,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 135 transitions, 686 flow [2024-11-10 22:24:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 22:24:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 22:24:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2024-11-10 22:24:54,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5232876712328767 [2024-11-10 22:24:54,616 INFO L175 Difference]: Start difference. First operand has 70 places, 71 transitions, 248 flow. Second operand 5 states and 191 transitions. [2024-11-10 22:24:54,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 135 transitions, 686 flow [2024-11-10 22:24:54,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 135 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 22:24:54,619 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 320 flow [2024-11-10 22:24:54,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2024-11-10 22:24:54,620 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, -4 predicate places. [2024-11-10 22:24:54,621 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 320 flow [2024-11-10 22:24:54,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:24:54,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 22:24:54,621 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:24:54,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 22:24:54,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-10 22:24:54,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:24:54,622 INFO L85 PathProgramCache]: Analyzing trace with hash -853116118, now seen corresponding path program 1 times [2024-11-10 22:24:54,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:24:54,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844020319] [2024-11-10 22:24:54,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:24:54,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:24:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:24:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:24:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:24:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844020319] [2024-11-10 22:24:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844020319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:24:54,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:24:54,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:24:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123705003] [2024-11-10 22:24:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:24:54,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 22:24:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:24:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 22:24:54,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 22:24:54,699 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2024-11-10 22:24:54,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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) [2024-11-10 22:24:54,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 22:24:54,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2024-11-10 22:24:54,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 22:24:56,215 INFO L124 PetriNetUnfolderBase]: 18088/24234 cut-off events. [2024-11-10 22:24:56,215 INFO L125 PetriNetUnfolderBase]: For 16743/16848 co-relation queries the response was YES. [2024-11-10 22:24:56,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66242 conditions, 24234 events. 18088/24234 cut-off events. For 16743/16848 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 132487 event pairs, 2607 based on Foata normal form. 94/21227 useless extension candidates. Maximal degree in co-relation 28529. Up to 12537 conditions per place. [2024-11-10 22:24:56,331 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 121 selfloop transitions, 11 changer transitions 0/142 dead transitions. [2024-11-10 22:24:56,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 906 flow [2024-11-10 22:24:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 22:24:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 22:24:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2024-11-10 22:24:56,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5753424657534246 [2024-11-10 22:24:56,332 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 320 flow. Second operand 4 states and 168 transitions. [2024-11-10 22:24:56,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 906 flow [2024-11-10 22:24:56,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 142 transitions, 824 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-11-10 22:24:56,337 INFO L231 Difference]: Finished difference. Result has 74 places, 79 transitions, 344 flow [2024-11-10 22:24:56,337 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=74, PETRI_TRANSITIONS=79} [2024-11-10 22:24:56,338 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2024-11-10 22:24:56,338 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 79 transitions, 344 flow [2024-11-10 22:24:56,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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) [2024-11-10 22:24:56,338 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 22:24:56,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:24:56,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 22:24:56,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-10 22:24:56,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:24:56,339 INFO L85 PathProgramCache]: Analyzing trace with hash -974283829, now seen corresponding path program 1 times [2024-11-10 22:24:56,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:24:56,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247285609] [2024-11-10 22:24:56,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:24:56,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:24:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:24:56,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:24:56,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:24:56,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247285609] [2024-11-10 22:24:56,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247285609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:24:56,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:24:56,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 22:24:56,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340358724] [2024-11-10 22:24:56,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:24:56,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 22:24:56,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:24:56,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 22:24:56,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 22:24:56,431 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2024-11-10 22:24:56,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 79 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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) [2024-11-10 22:24:56,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 22:24:56,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2024-11-10 22:24:56,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 22:24:57,293 INFO L124 PetriNetUnfolderBase]: 12122/17359 cut-off events. [2024-11-10 22:24:57,293 INFO L125 PetriNetUnfolderBase]: For 17142/17142 co-relation queries the response was YES. [2024-11-10 22:24:57,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47976 conditions, 17359 events. 12122/17359 cut-off events. For 17142/17142 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 101668 event pairs, 563 based on Foata normal form. 0/15650 useless extension candidates. Maximal degree in co-relation 42262. Up to 8953 conditions per place. [2024-11-10 22:24:57,381 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 135 selfloop transitions, 19 changer transitions 0/164 dead transitions. [2024-11-10 22:24:57,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 164 transitions, 945 flow [2024-11-10 22:24:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 22:24:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 22:24:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2024-11-10 22:24:57,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5068493150684932 [2024-11-10 22:24:57,383 INFO L175 Difference]: Start difference. First operand has 74 places, 79 transitions, 344 flow. Second operand 6 states and 222 transitions. [2024-11-10 22:24:57,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 164 transitions, 945 flow [2024-11-10 22:24:57,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 164 transitions, 887 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-11-10 22:24:57,394 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 328 flow [2024-11-10 22:24:57,394 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2024-11-10 22:24:57,395 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, -4 predicate places. [2024-11-10 22:24:57,395 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 328 flow [2024-11-10 22:24:57,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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) [2024-11-10 22:24:57,395 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 22:24:57,396 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:24:57,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 22:24:57,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-10 22:24:57,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:24:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash -691683168, now seen corresponding path program 1 times [2024-11-10 22:24:57,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:24:57,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339346594] [2024-11-10 22:24:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:24:57,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:24:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:24:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:24:57,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:24:57,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339346594] [2024-11-10 22:24:57,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339346594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:24:57,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:24:57,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:24:57,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166523708] [2024-11-10 22:24:57,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:24:57,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 22:24:57,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:24:57,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:24:57,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:24:57,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 73 [2024-11-10 22:24:57,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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) [2024-11-10 22:24:57,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 22:24:57,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 73 [2024-11-10 22:24:57,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 22:24:58,591 INFO L124 PetriNetUnfolderBase]: 18250/24821 cut-off events. [2024-11-10 22:24:58,591 INFO L125 PetriNetUnfolderBase]: For 27429/27429 co-relation queries the response was YES. [2024-11-10 22:24:58,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67217 conditions, 24821 events. 18250/24821 cut-off events. For 27429/27429 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 136631 event pairs, 10904 based on Foata normal form. 0/23630 useless extension candidates. Maximal degree in co-relation 20334. Up to 21770 conditions per place. [2024-11-10 22:24:58,684 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 104 selfloop transitions, 8 changer transitions 0/116 dead transitions. [2024-11-10 22:24:58,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 116 transitions, 734 flow [2024-11-10 22:24:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:24:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 22:24:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-10 22:24:58,685 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4885844748858447 [2024-11-10 22:24:58,685 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 328 flow. Second operand 3 states and 107 transitions. [2024-11-10 22:24:58,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 116 transitions, 734 flow [2024-11-10 22:24:58,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 116 transitions, 618 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-11-10 22:24:58,702 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 305 flow [2024-11-10 22:24:58,703 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2024-11-10 22:24:58,703 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, -7 predicate places. [2024-11-10 22:24:58,703 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 305 flow [2024-11-10 22:24:58,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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) [2024-11-10 22:24:58,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 22:24:58,704 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:24:58,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 22:24:58,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-10 22:24:58,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:24:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash -352776982, now seen corresponding path program 1 times [2024-11-10 22:24:58,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:24:58,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813504794] [2024-11-10 22:24:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:24:58,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:24:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:24:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:24:58,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:24:58,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813504794] [2024-11-10 22:24:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813504794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:24:58,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:24:58,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 22:24:58,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821913114] [2024-11-10 22:24:58,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:24:58,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 22:24:58,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:24:58,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 22:24:58,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 22:24:58,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2024-11-10 22:24:58,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:24:58,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 22:24:58,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2024-11-10 22:24:58,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 22:24:59,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), 9#L100-1true, 42#L76true, Black: 100#(<= ~s~0 0), 70#L56-5true, 131#(<= ~s~0 1), 13#L66-5true, 64#L46-5true, 82#true, 125#(not (= ~x~0 1)), Black: 123#true]) [2024-11-10 22:24:59,779 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-10 22:24:59,779 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-10 22:24:59,779 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-10 22:24:59,779 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-10 22:24:59,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), 42#L76true, Black: 100#(<= ~s~0 0), 70#L56-5true, 131#(<= ~s~0 1), 64#L46-5true, 13#L66-5true, 62#L101true, 82#true, Black: 123#true, 125#(not (= ~x~0 1))]) [2024-11-10 22:24:59,830 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-10 22:24:59,830 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:24:59,830 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-10 22:24:59,830 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:24:59,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), 9#L100-1true, 44#thread4EXITtrue, Black: 100#(<= ~s~0 0), 70#L56-5true, 131#(<= ~s~0 1), 64#L46-5true, 13#L66-5true, 82#true, Black: 123#true, 125#(not (= ~x~0 1))]) [2024-11-10 22:24:59,831 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-10 22:24:59,831 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-10 22:24:59,831 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:24:59,831 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:24:59,851 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 9#L100-1true, 132#(<= ~s~0 2), Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 70#L56-5true, 3#L76-5true, 82#true, 68#L46true, 125#(not (= ~x~0 1)), Black: 123#true]) [2024-11-10 22:24:59,851 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-10 22:24:59,852 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-10 22:24:59,852 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-10 22:24:59,852 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:24:59,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 44#thread4EXITtrue, 70#L56-5true, 131#(<= ~s~0 1), 62#L101true, 13#L66-5true, 64#L46-5true, 82#true, 125#(not (= ~x~0 1)), Black: 123#true]) [2024-11-10 22:24:59,859 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-10 22:24:59,859 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-10 22:24:59,859 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-10 22:24:59,859 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:24:59,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 132#(<= ~s~0 2), Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 3#L76-5true, 70#L56-5true, 62#L101true, 82#true, 68#L46true, 125#(not (= ~x~0 1)), Black: 123#true]) [2024-11-10 22:24:59,877 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-10 22:24:59,877 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:24:59,877 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-10 22:24:59,877 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-10 22:24:59,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 9#L100-1true, 132#(<= ~s~0 2), 18#thread1EXITtrue, Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 70#L56-5true, 3#L76-5true, 82#true, 125#(not (= ~x~0 1)), Black: 123#true]) [2024-11-10 22:24:59,878 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-10 22:24:59,878 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-10 22:24:59,878 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:24:59,878 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-10 22:24:59,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 132#(<= ~s~0 2), 18#thread1EXITtrue, Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 3#L76-5true, 70#L56-5true, 62#L101true, 82#true, 125#(not (= ~x~0 1)), Black: 123#true]) [2024-11-10 22:24:59,890 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-10 22:24:59,890 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-10 22:24:59,890 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-10 22:24:59,890 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-10 22:24:59,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 132#(<= ~s~0 2), Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 70#L56-5true, 3#L76-5true, 82#true, 52#L102true, 125#(not (= ~x~0 1)), Black: 123#true]) [2024-11-10 22:24:59,898 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-10 22:24:59,898 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-10 22:24:59,898 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-10 22:24:59,898 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-10 22:24:59,902 INFO L124 PetriNetUnfolderBase]: 13893/19335 cut-off events. [2024-11-10 22:24:59,902 INFO L125 PetriNetUnfolderBase]: For 12900/13422 co-relation queries the response was YES. [2024-11-10 22:24:59,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49618 conditions, 19335 events. 13893/19335 cut-off events. For 12900/13422 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 111452 event pairs, 1682 based on Foata normal form. 352/18889 useless extension candidates. Maximal degree in co-relation 9680. Up to 7613 conditions per place. [2024-11-10 22:24:59,987 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 131 selfloop transitions, 15 changer transitions 4/163 dead transitions. [2024-11-10 22:24:59,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 163 transitions, 867 flow [2024-11-10 22:24:59,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 22:24:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 22:24:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 196 transitions. [2024-11-10 22:24:59,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.536986301369863 [2024-11-10 22:24:59,989 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 305 flow. Second operand 5 states and 196 transitions. [2024-11-10 22:24:59,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 163 transitions, 867 flow [2024-11-10 22:24:59,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 163 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 22:24:59,998 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 335 flow [2024-11-10 22:24:59,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2024-11-10 22:24:59,998 INFO L277 CegarLoopForPetriNet]: 77 programPoint places, -4 predicate places. [2024-11-10 22:24:59,998 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 335 flow [2024-11-10 22:24:59,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:24:59,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 22:24:59,999 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:24:59,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 22:24:59,999 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-11-10 22:25:00,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:25:00,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1635038059, now seen corresponding path program 1 times [2024-11-10 22:25:00,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:25:00,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131046100] [2024-11-10 22:25:00,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:25:00,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:25:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:25:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:25:00,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:25:00,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131046100] [2024-11-10 22:25:00,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131046100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:25:00,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:25:00,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 22:25:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510252946] [2024-11-10 22:25:00,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:25:00,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 22:25:00,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:25:00,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 22:25:00,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 22:25:00,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 73 [2024-11-10 22:25:00,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:25:00,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 22:25:00,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 73 [2024-11-10 22:25:00,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 22:25:01,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), 9#L100-1true, 42#L76true, Black: 100#(<= ~s~0 0), Black: 132#(<= ~s~0 2), 70#L56-5true, 137#(<= ~s~0 1), 131#(<= ~s~0 1), 64#L46-5true, 13#L66-5true, 82#true, Black: 123#true]) [2024-11-10 22:25:01,230 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-10 22:25:01,230 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-10 22:25:01,231 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-10 22:25:01,231 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-10 22:25:01,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), 42#L76true, Black: 132#(<= ~s~0 2), Black: 100#(<= ~s~0 0), 137#(<= ~s~0 1), 70#L56-5true, 131#(<= ~s~0 1), 64#L46-5true, 62#L101true, 13#L66-5true, 82#true, Black: 123#true]) [2024-11-10 22:25:01,303 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-10 22:25:01,303 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:25:01,303 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-10 22:25:01,303 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:25:01,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), 9#L100-1true, Black: 100#(<= ~s~0 0), Black: 132#(<= ~s~0 2), 44#thread4EXITtrue, 137#(<= ~s~0 1), 70#L56-5true, 131#(<= ~s~0 1), 64#L46-5true, 13#L66-5true, 82#true, Black: 123#true]) [2024-11-10 22:25:01,305 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-10 22:25:01,305 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-10 22:25:01,306 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:25:01,306 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:25:01,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([522] L66-5-->L66: Formula: (and (<= |v_thread3Thread1of1ForFork3_#t~post6#1_5| 2147483646) (= v_~s~0_127 |v_thread3Thread1of1ForFork3_#t~post6#1_5|) (= v_~s~0_126 (+ |v_thread3Thread1of1ForFork3_#t~post6#1_5| 1)) (<= 0 (+ 2147483649 |v_thread3Thread1of1ForFork3_#t~post6#1_5|))) InVars {~s~0=v_~s~0_127} OutVars{thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post6#1, ~s~0][88], [17#L66true, 9#L100-1true, 132#(<= ~s~0 2), Black: 115#(<= ~s~0 1), Black: 100#(<= ~s~0 0), 70#L56-5true, 138#(<= ~s~0 2), 3#L76-5true, 82#true, 68#L46true, Black: 123#true]) [2024-11-10 22:25:01,348 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-10 22:25:01,348 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-10 22:25:01,348 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-10 22:25:01,348 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-10 22:25:01,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([495] L45-1-->L46-5: Formula: (= v_~x~0_14 0) InVars {} OutVars{~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x~0][68], [115#(<= ~s~0 1), Black: 132#(<= ~s~0 2), Black: 100#(<= ~s~0 0), 44#thread4EXITtrue, 137#(<= ~s~0 1), 70#L56-5true, 131#(<= ~s~0 1), 64#L46-5true, 62#L101true, 13#L66-5true, 82#true, Black: 123#true]) [2024-11-10 22:25:01,363 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-10 22:25:01,363 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-10 22:25:01,363 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-10 22:25:01,364 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event