./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-misc-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2ed7b18db6948b1f53058568aeeb46b9da6de135bdadf46ddc91e86240dfa66 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:43:47,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:43:47,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:43:47,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:43:47,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:43:47,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:43:47,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:43:47,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:43:47,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:43:47,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:43:47,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:43:47,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:43:47,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:43:47,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:43:47,188 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:43:47,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:43:47,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:43:47,189 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:43:47,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:43:47,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:43:47,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:43:47,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:43:47,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:43:47,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:43:47,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:43:47,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:43:47,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:43:47,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:43:47,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:43:47,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:43:47,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:43:47,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:43:47,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:43:47,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:43:47,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:43:47,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:43:47,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:43:47,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:43:47,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:43:47,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:43:47,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:43:47,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:43:47,196 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 ! call(reach_error())) ) 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 -> b2ed7b18db6948b1f53058568aeeb46b9da6de135bdadf46ddc91e86240dfa66 [2024-11-09 02:43:47,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:43:47,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:43:47,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:43:47,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:43:47,449 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:43:47,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-3.wvr.c [2024-11-09 02:43:48,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:43:49,010 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:43:49,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3.wvr.c [2024-11-09 02:43:49,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac2cd9803/7bdea628e3434f26a9952900d31e4db8/FLAGe124a0e36 [2024-11-09 02:43:49,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac2cd9803/7bdea628e3434f26a9952900d31e4db8 [2024-11-09 02:43:49,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:43:49,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:43:49,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:43:49,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:43:49,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:43:49,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ea82d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49, skipping insertion in model container [2024-11-09 02:43:49,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:43:49,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3.wvr.c[2092,2105] [2024-11-09 02:43:49,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:43:49,301 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:43:49,319 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3.wvr.c[2092,2105] [2024-11-09 02:43:49,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:43:49,336 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:43:49,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49 WrapperNode [2024-11-09 02:43:49,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:43:49,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:43:49,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:43:49,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:43:49,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,367 INFO L138 Inliner]: procedures = 18, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2024-11-09 02:43:49,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:43:49,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:43:49,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:43:49,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:43:49,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,380 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,392 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-09 02:43:49,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:43:49,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:43:49,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:43:49,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:43:49,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (1/1) ... [2024-11-09 02:43:49,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:43:49,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:43:49,446 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-09 02:43:49,449 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-09 02:43:49,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:43:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 02:43:49,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 02:43:49,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 02:43:49,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 02:43:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:43:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:43:49,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:43:49,502 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 02:43:49,596 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:43:49,600 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:43:49,800 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:43:49,801 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:43:49,934 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:43:49,935 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 02:43:49,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:43:49 BoogieIcfgContainer [2024-11-09 02:43:49,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:43:49,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:43:49,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:43:49,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:43:49,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:43:49" (1/3) ... [2024-11-09 02:43:49,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e038ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:43:49, skipping insertion in model container [2024-11-09 02:43:49,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:49" (2/3) ... [2024-11-09 02:43:49,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e038ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:43:49, skipping insertion in model container [2024-11-09 02:43:49,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:43:49" (3/3) ... [2024-11-09 02:43:49,947 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3.wvr.c [2024-11-09 02:43:49,965 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:43:49,966 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:43:49,966 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:43:50,022 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 02:43:50,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 74 flow [2024-11-09 02:43:50,087 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-11-09 02:43:50,088 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 02:43:50,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 4/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-11-09 02:43:50,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 30 transitions, 74 flow [2024-11-09 02:43:50,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 66 flow [2024-11-09 02:43:50,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:43:50,113 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;@7394d0a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:43:50,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 02:43:50,126 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:43:50,126 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-11-09 02:43:50,127 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 02:43:50,127 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:43:50,128 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:43:50,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:43:50,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:43:50,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2032875618, now seen corresponding path program 1 times [2024-11-09 02:43:50,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:43:50,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024159176] [2024-11-09 02:43:50,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:50,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:43:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:50,334 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-09 02:43:50,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:43:50,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024159176] [2024-11-09 02:43:50,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024159176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:43:50,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:43:50,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:43:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387308188] [2024-11-09 02:43:50,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:43:50,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:43:50,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:43:50,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:43:50,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:43:50,382 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-09 02:43:50,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-09 02:43:50,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:43:50,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-09 02:43:50,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:43:50,487 INFO L124 PetriNetUnfolderBase]: 146/284 cut-off events. [2024-11-09 02:43:50,487 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-09 02:43:50,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 284 events. 146/284 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1122 event pairs, 12 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 458. Up to 185 conditions per place. [2024-11-09 02:43:50,495 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 21 selfloop transitions, 5 changer transitions 1/38 dead transitions. [2024-11-09 02:43:50,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 151 flow [2024-11-09 02:43:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:43:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:43:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-09 02:43:50,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2024-11-09 02:43:50,521 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 66 flow. Second operand 3 states and 67 transitions. [2024-11-09 02:43:50,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 151 flow [2024-11-09 02:43:50,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 137 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 02:43:50,529 INFO L231 Difference]: Finished difference. Result has 29 places, 31 transitions, 91 flow [2024-11-09 02:43:50,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=31} [2024-11-09 02:43:50,534 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2024-11-09 02:43:50,535 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 31 transitions, 91 flow [2024-11-09 02:43:50,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-09 02:43:50,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:43:50,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:43:50,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:43:50,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:43:50,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:43:50,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2071922210, now seen corresponding path program 1 times [2024-11-09 02:43:50,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:43:50,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340001752] [2024-11-09 02:43:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:50,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:43:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:43:50,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:43:50,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340001752] [2024-11-09 02:43:50,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340001752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:43:50,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:43:50,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:43:50,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606973844] [2024-11-09 02:43:50,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:43:50,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:43:50,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:43:50,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:43:50,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:43:50,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 30 [2024-11-09 02:43:50,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 31 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-09 02:43:50,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:43:50,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 30 [2024-11-09 02:43:50,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:43:50,832 INFO L124 PetriNetUnfolderBase]: 129/272 cut-off events. [2024-11-09 02:43:50,832 INFO L125 PetriNetUnfolderBase]: For 48/60 co-relation queries the response was YES. [2024-11-09 02:43:50,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 272 events. 129/272 cut-off events. For 48/60 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1195 event pairs, 22 based on Foata normal form. 12/247 useless extension candidates. Maximal degree in co-relation 341. Up to 108 conditions per place. [2024-11-09 02:43:50,839 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 22 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2024-11-09 02:43:50,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 39 transitions, 160 flow [2024-11-09 02:43:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:43:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:43:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-11-09 02:43:50,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2024-11-09 02:43:50,843 INFO L175 Difference]: Start difference. First operand has 29 places, 31 transitions, 91 flow. Second operand 3 states and 68 transitions. [2024-11-09 02:43:50,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 39 transitions, 160 flow [2024-11-09 02:43:50,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 153 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 02:43:50,845 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 96 flow [2024-11-09 02:43:50,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2024-11-09 02:43:50,848 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-11-09 02:43:50,848 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 96 flow [2024-11-09 02:43:50,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-09 02:43:50,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:43:50,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:43:50,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:43:50,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:43:50,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:43:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash 534562757, now seen corresponding path program 1 times [2024-11-09 02:43:50,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:43:50,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803700457] [2024-11-09 02:43:50,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:43:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:43:50,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:43:50,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803700457] [2024-11-09 02:43:50,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803700457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:43:50,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:43:50,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:43:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727816437] [2024-11-09 02:43:50,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:43:50,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:43:50,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:43:50,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:43:50,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:43:50,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 30 [2024-11-09 02:43:50,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 96 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-09 02:43:50,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:43:50,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 30 [2024-11-09 02:43:50,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:43:51,036 INFO L124 PetriNetUnfolderBase]: 128/302 cut-off events. [2024-11-09 02:43:51,036 INFO L125 PetriNetUnfolderBase]: For 77/83 co-relation queries the response was YES. [2024-11-09 02:43:51,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 302 events. 128/302 cut-off events. For 77/83 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1484 event pairs, 22 based on Foata normal form. 9/264 useless extension candidates. Maximal degree in co-relation 330. Up to 107 conditions per place. [2024-11-09 02:43:51,041 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 23 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2024-11-09 02:43:51,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 174 flow [2024-11-09 02:43:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:43:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:43:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-09 02:43:51,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2024-11-09 02:43:51,044 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 96 flow. Second operand 3 states and 67 transitions. [2024-11-09 02:43:51,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 174 flow [2024-11-09 02:43:51,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:43:51,049 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 106 flow [2024-11-09 02:43:51,049 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2024-11-09 02:43:51,050 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2024-11-09 02:43:51,050 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 106 flow [2024-11-09 02:43:51,050 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-09 02:43:51,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:43:51,051 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] [2024-11-09 02:43:51,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:43:51,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:43:51,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:43:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash -389726327, now seen corresponding path program 1 times [2024-11-09 02:43:51,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:43:51,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624894568] [2024-11-09 02:43:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:51,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:43:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 02:43:51,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:43:51,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624894568] [2024-11-09 02:43:51,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624894568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:43:51,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:43:51,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:43:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511506983] [2024-11-09 02:43:51,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:43:51,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:43:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:43:51,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:43:51,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:43:51,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-09 02:43:51,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:43:51,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:43:51,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-09 02:43:51,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:43:51,458 INFO L124 PetriNetUnfolderBase]: 218/428 cut-off events. [2024-11-09 02:43:51,458 INFO L125 PetriNetUnfolderBase]: For 135/163 co-relation queries the response was YES. [2024-11-09 02:43:51,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 428 events. 218/428 cut-off events. For 135/163 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1775 event pairs, 50 based on Foata normal form. 16/394 useless extension candidates. Maximal degree in co-relation 379. Up to 139 conditions per place. [2024-11-09 02:43:51,463 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 33 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2024-11-09 02:43:51,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 240 flow [2024-11-09 02:43:51,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:43:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:43:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-11-09 02:43:51,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.725 [2024-11-09 02:43:51,467 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 106 flow. Second operand 4 states and 87 transitions. [2024-11-09 02:43:51,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 240 flow [2024-11-09 02:43:51,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 51 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:43:51,470 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 136 flow [2024-11-09 02:43:51,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2024-11-09 02:43:51,471 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-11-09 02:43:51,472 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 136 flow [2024-11-09 02:43:51,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:43:51,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:43:51,473 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 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-09 02:43:51,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:43:51,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:43:51,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:43:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1232034179, now seen corresponding path program 1 times [2024-11-09 02:43:51,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:43:51,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832793298] [2024-11-09 02:43:51,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:51,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:43:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 02:43:51,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:43:51,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832793298] [2024-11-09 02:43:51,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832793298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:43:51,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:43:51,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:43:51,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299078385] [2024-11-09 02:43:51,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:43:51,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:43:51,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:43:51,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:43:51,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:43:51,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 30 [2024-11-09 02:43:51,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 136 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-09 02:43:51,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:43:51,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 30 [2024-11-09 02:43:51,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:43:51,689 INFO L124 PetriNetUnfolderBase]: 192/411 cut-off events. [2024-11-09 02:43:51,690 INFO L125 PetriNetUnfolderBase]: For 372/392 co-relation queries the response was YES. [2024-11-09 02:43:51,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 411 events. 192/411 cut-off events. For 372/392 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2001 event pairs, 37 based on Foata normal form. 16/397 useless extension candidates. Maximal degree in co-relation 542. Up to 188 conditions per place. [2024-11-09 02:43:51,694 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 27 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2024-11-09 02:43:51,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 238 flow [2024-11-09 02:43:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:43:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:43:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-11-09 02:43:51,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-11-09 02:43:51,696 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 136 flow. Second operand 3 states and 65 transitions. [2024-11-09 02:43:51,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 238 flow [2024-11-09 02:43:51,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 234 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-09 02:43:51,700 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 138 flow [2024-11-09 02:43:51,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-11-09 02:43:51,701 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2024-11-09 02:43:51,701 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 138 flow [2024-11-09 02:43:51,701 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-09 02:43:51,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:43:51,701 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 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-09 02:43:51,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:43:51,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:43:51,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:43:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash -416163333, now seen corresponding path program 1 times [2024-11-09 02:43:51,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:43:51,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94066447] [2024-11-09 02:43:51,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:51,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:43:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 02:43:51,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:43:51,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94066447] [2024-11-09 02:43:51,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94066447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:43:51,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:43:51,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:43:51,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237350805] [2024-11-09 02:43:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:43:51,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:43:51,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:43:51,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:43:51,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:43:51,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-09 02:43:51,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 02:43:51,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:43:51,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-09 02:43:51,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:43:52,032 INFO L124 PetriNetUnfolderBase]: 392/744 cut-off events. [2024-11-09 02:43:52,032 INFO L125 PetriNetUnfolderBase]: For 805/839 co-relation queries the response was YES. [2024-11-09 02:43:52,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 744 events. 392/744 cut-off events. For 805/839 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4031 event pairs, 93 based on Foata normal form. 36/730 useless extension candidates. Maximal degree in co-relation 1127. Up to 228 conditions per place. [2024-11-09 02:43:52,038 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 39 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-11-09 02:43:52,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 334 flow [2024-11-09 02:43:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:43:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:43:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-11-09 02:43:52,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2024-11-09 02:43:52,040 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 138 flow. Second operand 4 states and 86 transitions. [2024-11-09 02:43:52,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 334 flow [2024-11-09 02:43:52,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 02:43:52,042 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 164 flow [2024-11-09 02:43:52,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-11-09 02:43:52,043 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-11-09 02:43:52,043 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 164 flow [2024-11-09 02:43:52,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 02:43:52,044 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:43:52,044 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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-09 02:43:52,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:43:52,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:43:52,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:43:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1046309381, now seen corresponding path program 1 times [2024-11-09 02:43:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:43:52,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007059345] [2024-11-09 02:43:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:52,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:43:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:43:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:43:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007059345] [2024-11-09 02:43:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007059345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:43:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237949067] [2024-11-09 02:43:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:52,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:43:52,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:43:52,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:43:52,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:43:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:52,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 02:43:52,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:43:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:43:52,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:43:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:43:52,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237949067] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:43:52,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:43:52,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-09 02:43:52,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461843152] [2024-11-09 02:43:52,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:43:52,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:43:52,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:43:52,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:43:52,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:43:52,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-09 02:43:52,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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-09 02:43:52,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:43:52,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-09 02:43:52,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:43:52,727 INFO L124 PetriNetUnfolderBase]: 956/1991 cut-off events. [2024-11-09 02:43:52,727 INFO L125 PetriNetUnfolderBase]: For 2295/2402 co-relation queries the response was YES. [2024-11-09 02:43:52,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5714 conditions, 1991 events. 956/1991 cut-off events. For 2295/2402 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 11854 event pairs, 145 based on Foata normal form. 40/1994 useless extension candidates. Maximal degree in co-relation 1526. Up to 658 conditions per place. [2024-11-09 02:43:52,745 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 65 selfloop transitions, 15 changer transitions 1/94 dead transitions. [2024-11-09 02:43:52,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 94 transitions, 602 flow [2024-11-09 02:43:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:43:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:43:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-11-09 02:43:52,747 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.82 [2024-11-09 02:43:52,747 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 164 flow. Second operand 5 states and 123 transitions. [2024-11-09 02:43:52,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 94 transitions, 602 flow [2024-11-09 02:43:52,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 94 transitions, 594 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-11-09 02:43:52,751 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 259 flow [2024-11-09 02:43:52,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2024-11-09 02:43:52,752 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-11-09 02:43:52,752 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 259 flow [2024-11-09 02:43:52,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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-09 02:43:52,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:43:52,753 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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-09 02:43:52,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 02:43:52,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:43:52,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:43:52,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:43:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1698300779, now seen corresponding path program 2 times [2024-11-09 02:43:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:43:52,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843371675] [2024-11-09 02:43:52,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:52,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:43:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:43:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:43:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843371675] [2024-11-09 02:43:53,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843371675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:43:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9442006] [2024-11-09 02:43:53,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 02:43:53,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:43:53,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:43:53,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:43:53,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 02:43:53,224 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 02:43:53,225 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:43:53,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 02:43:53,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:43:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:43:53,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:43:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:43:53,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9442006] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:43:53,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:43:53,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-09 02:43:53,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309698330] [2024-11-09 02:43:53,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:43:53,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:43:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:43:53,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:43:53,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:43:53,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-09 02:43:53,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 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-09 02:43:53,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:43:53,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-09 02:43:53,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:43:53,867 INFO L124 PetriNetUnfolderBase]: 1767/3695 cut-off events. [2024-11-09 02:43:53,868 INFO L125 PetriNetUnfolderBase]: For 5865/6092 co-relation queries the response was YES. [2024-11-09 02:43:53,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11581 conditions, 3695 events. 1767/3695 cut-off events. For 5865/6092 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 26144 event pairs, 171 based on Foata normal form. 94/3721 useless extension candidates. Maximal degree in co-relation 3819. Up to 1033 conditions per place. [2024-11-09 02:43:53,901 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 81 selfloop transitions, 31 changer transitions 1/126 dead transitions. [2024-11-09 02:43:53,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 126 transitions, 889 flow [2024-11-09 02:43:53,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:43:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:43:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-11-09 02:43:53,902 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-11-09 02:43:53,903 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 259 flow. Second operand 6 states and 150 transitions. [2024-11-09 02:43:53,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 126 transitions, 889 flow [2024-11-09 02:43:53,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 126 transitions, 833 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-11-09 02:43:53,910 INFO L231 Difference]: Finished difference. Result has 53 places, 65 transitions, 386 flow [2024-11-09 02:43:53,910 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=53, PETRI_TRANSITIONS=65} [2024-11-09 02:43:53,911 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2024-11-09 02:43:53,911 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 65 transitions, 386 flow [2024-11-09 02:43:53,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 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-09 02:43:53,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:43:53,911 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:43:53,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 02:43:54,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 02:43:54,116 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:43:54,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:43:54,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1487210303, now seen corresponding path program 3 times [2024-11-09 02:43:54,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:43:54,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458011907] [2024-11-09 02:43:54,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:54,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:43:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 02:43:54,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:43:54,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458011907] [2024-11-09 02:43:54,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458011907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:43:54,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064833816] [2024-11-09 02:43:54,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 02:43:54,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:43:54,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:43:54,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:43:54,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 02:43:54,555 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 02:43:54,555 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:43:54,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 02:43:54,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:43:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 02:43:54,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:43:54,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064833816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:43:54,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 02:43:54,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-09 02:43:54,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412906829] [2024-11-09 02:43:54,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:43:54,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:43:54,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:43:54,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:43:54,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:43:54,618 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 30 [2024-11-09 02:43:54,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 65 transitions, 386 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-09 02:43:54,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:43:54,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 30 [2024-11-09 02:43:54,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:43:55,234 INFO L124 PetriNetUnfolderBase]: 3176/5769 cut-off events. [2024-11-09 02:43:55,234 INFO L125 PetriNetUnfolderBase]: For 10195/10471 co-relation queries the response was YES. [2024-11-09 02:43:55,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18702 conditions, 5769 events. 3176/5769 cut-off events. For 10195/10471 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 40472 event pairs, 740 based on Foata normal form. 194/5849 useless extension candidates. Maximal degree in co-relation 7260. Up to 2146 conditions per place. [2024-11-09 02:43:55,283 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 80 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2024-11-09 02:43:55,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 115 transitions, 872 flow [2024-11-09 02:43:55,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:43:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:43:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-11-09 02:43:55,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2024-11-09 02:43:55,285 INFO L175 Difference]: Start difference. First operand has 53 places, 65 transitions, 386 flow. Second operand 4 states and 82 transitions. [2024-11-09 02:43:55,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 115 transitions, 872 flow [2024-11-09 02:43:55,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 115 transitions, 823 flow, removed 17 selfloop flow, removed 1 redundant places. [2024-11-09 02:43:55,294 INFO L231 Difference]: Finished difference. Result has 57 places, 68 transitions, 407 flow [2024-11-09 02:43:55,295 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=407, PETRI_PLACES=57, PETRI_TRANSITIONS=68} [2024-11-09 02:43:55,296 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2024-11-09 02:43:55,296 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 68 transitions, 407 flow [2024-11-09 02:43:55,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-09 02:43:55,297 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:43:55,297 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:43:55,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 02:43:55,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:43:55,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:43:55,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:43:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1192142523, now seen corresponding path program 4 times [2024-11-09 02:43:55,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:43:55,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682866864] [2024-11-09 02:43:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:55,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:43:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 02:43:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:43:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682866864] [2024-11-09 02:43:55,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682866864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:43:55,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:43:55,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:43:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880018943] [2024-11-09 02:43:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:43:55,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:43:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:43:55,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:43:55,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:43:55,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-09 02:43:55,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 68 transitions, 407 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-09 02:43:55,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:43:55,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-09 02:43:55,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:43:56,262 INFO L124 PetriNetUnfolderBase]: 1938/4022 cut-off events. [2024-11-09 02:43:56,263 INFO L125 PetriNetUnfolderBase]: For 10499/10697 co-relation queries the response was YES. [2024-11-09 02:43:56,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13454 conditions, 4022 events. 1938/4022 cut-off events. For 10499/10697 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 29705 event pairs, 651 based on Foata normal form. 363/4152 useless extension candidates. Maximal degree in co-relation 5768. Up to 1795 conditions per place. [2024-11-09 02:43:56,291 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 56 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-11-09 02:43:56,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 89 transitions, 647 flow [2024-11-09 02:43:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:43:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:43:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-11-09 02:43:56,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2024-11-09 02:43:56,292 INFO L175 Difference]: Start difference. First operand has 57 places, 68 transitions, 407 flow. Second operand 4 states and 77 transitions. [2024-11-09 02:43:56,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 89 transitions, 647 flow [2024-11-09 02:43:56,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 639 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-09 02:43:56,301 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 404 flow [2024-11-09 02:43:56,301 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=404, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2024-11-09 02:43:56,301 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2024-11-09 02:43:56,304 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 404 flow [2024-11-09 02:43:56,304 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-09 02:43:56,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:43:56,304 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:43:56,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:43:56,304 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:43:56,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:43:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash -916027428, now seen corresponding path program 5 times [2024-11-09 02:43:56,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:43:56,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743622438] [2024-11-09 02:43:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:56,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:43:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 02:43:56,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:43:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743622438] [2024-11-09 02:43:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743622438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:43:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398718369] [2024-11-09 02:43:56,665 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 02:43:56,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:43:56,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:43:56,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:43:56,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 02:43:56,736 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-09 02:43:56,737 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:43:56,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 02:43:56,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:43:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 02:43:56,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:43:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 02:43:56,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398718369] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 02:43:56,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 02:43:56,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 12 [2024-11-09 02:43:56,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516820728] [2024-11-09 02:43:56,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:43:56,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:43:56,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:43:56,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:43:57,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:43:57,009 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 30 [2024-11-09 02:43:57,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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-09 02:43:57,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:43:57,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 30 [2024-11-09 02:43:57,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:43:57,609 INFO L124 PetriNetUnfolderBase]: 2266/4448 cut-off events. [2024-11-09 02:43:57,609 INFO L125 PetriNetUnfolderBase]: For 17397/17794 co-relation queries the response was YES. [2024-11-09 02:43:57,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16556 conditions, 4448 events. 2266/4448 cut-off events. For 17397/17794 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 29586 event pairs, 437 based on Foata normal form. 127/4508 useless extension candidates. Maximal degree in co-relation 6776. Up to 1942 conditions per place. [2024-11-09 02:43:57,651 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 50 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2024-11-09 02:43:57,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 666 flow [2024-11-09 02:43:57,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:43:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:43:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-11-09 02:43:57,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 02:43:57,653 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 404 flow. Second operand 4 states and 80 transitions. [2024-11-09 02:43:57,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 666 flow [2024-11-09 02:43:57,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 638 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-09 02:43:57,667 INFO L231 Difference]: Finished difference. Result has 62 places, 69 transitions, 438 flow [2024-11-09 02:43:57,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=438, PETRI_PLACES=62, PETRI_TRANSITIONS=69} [2024-11-09 02:43:57,668 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2024-11-09 02:43:57,668 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 69 transitions, 438 flow [2024-11-09 02:43:57,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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-09 02:43:57,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:43:57,669 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:43:57,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 02:43:57,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:43:57,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:43:57,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:43:57,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1175447428, now seen corresponding path program 6 times [2024-11-09 02:43:57,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:43:57,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825187624] [2024-11-09 02:43:57,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:43:57,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:43:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:43:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 02:43:58,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:43:58,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825187624] [2024-11-09 02:43:58,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825187624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:43:58,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:43:58,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:43:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845961230] [2024-11-09 02:43:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:43:58,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:43:58,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:43:58,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:43:58,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:43:58,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-09 02:43:58,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 438 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:43:58,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:43:58,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-09 02:43:58,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:43:58,207 INFO L124 PetriNetUnfolderBase]: 426/974 cut-off events. [2024-11-09 02:43:58,207 INFO L125 PetriNetUnfolderBase]: For 4369/4474 co-relation queries the response was YES. [2024-11-09 02:43:58,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3809 conditions, 974 events. 426/974 cut-off events. For 4369/4474 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5433 event pairs, 132 based on Foata normal form. 83/1025 useless extension candidates. Maximal degree in co-relation 1567. Up to 380 conditions per place. [2024-11-09 02:43:58,210 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 0 selfloop transitions, 0 changer transitions 55/55 dead transitions. [2024-11-09 02:43:58,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 438 flow [2024-11-09 02:43:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:43:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:43:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2024-11-09 02:43:58,212 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-09 02:43:58,212 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 438 flow. Second operand 4 states and 75 transitions. [2024-11-09 02:43:58,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 438 flow [2024-11-09 02:43:58,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 418 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-09 02:43:58,216 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2024-11-09 02:43:58,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2024-11-09 02:43:58,218 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-11-09 02:43:58,218 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2024-11-09 02:43:58,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:43:58,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-09 02:43:58,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-09 02:43:58,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-09 02:43:58,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:43:58,223 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-11-09 02:43:58,226 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 02:43:58,226 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:43:58,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:43:58 BasicIcfg [2024-11-09 02:43:58,231 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:43:58,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:43:58,233 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:43:58,233 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:43:58,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:43:49" (3/4) ... [2024-11-09 02:43:58,235 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 02:43:58,239 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 02:43:58,240 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 02:43:58,244 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2024-11-09 02:43:58,244 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 02:43:58,245 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 02:43:58,245 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 02:43:58,330 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 02:43:58,330 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 02:43:58,330 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:43:58,331 INFO L158 Benchmark]: Toolchain (without parser) took 9298.01ms. Allocated memory was 153.1MB in the beginning and 633.3MB in the end (delta: 480.2MB). Free memory was 93.4MB in the beginning and 522.2MB in the end (delta: -428.8MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2024-11-09 02:43:58,331 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:43:58,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.82ms. Allocated memory is still 153.1MB. Free memory was 93.4MB in the beginning and 121.9MB in the end (delta: -28.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 02:43:58,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.55ms. Allocated memory is still 153.1MB. Free memory was 121.9MB in the beginning and 120.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:43:58,332 INFO L158 Benchmark]: Boogie Preprocessor took 38.19ms. Allocated memory is still 153.1MB. Free memory was 120.6MB in the beginning and 119.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:43:58,332 INFO L158 Benchmark]: RCFGBuilder took 530.36ms. Allocated memory is still 153.1MB. Free memory was 118.5MB in the beginning and 97.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 02:43:58,333 INFO L158 Benchmark]: TraceAbstraction took 8291.72ms. Allocated memory was 153.1MB in the beginning and 633.3MB in the end (delta: 480.2MB). Free memory was 96.8MB in the beginning and 527.4MB in the end (delta: -430.7MB). Peak memory consumption was 273.6MB. Max. memory is 16.1GB. [2024-11-09 02:43:58,333 INFO L158 Benchmark]: Witness Printer took 98.58ms. Allocated memory is still 633.3MB. Free memory was 527.4MB in the beginning and 522.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:43:58,334 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.82ms. Allocated memory is still 153.1MB. Free memory was 93.4MB in the beginning and 121.9MB in the end (delta: -28.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.55ms. Allocated memory is still 153.1MB. Free memory was 121.9MB in the beginning and 120.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.19ms. Allocated memory is still 153.1MB. Free memory was 120.6MB in the beginning and 119.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 530.36ms. Allocated memory is still 153.1MB. Free memory was 118.5MB in the beginning and 97.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8291.72ms. Allocated memory was 153.1MB in the beginning and 633.3MB in the end (delta: 480.2MB). Free memory was 96.8MB in the beginning and 527.4MB in the end (delta: -430.7MB). Peak memory consumption was 273.6MB. Max. memory is 16.1GB. * Witness Printer took 98.58ms. Allocated memory is still 633.3MB. Free memory was 527.4MB in the beginning and 522.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 45 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.2s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 736 IncrementalHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 10 mSDtfsCounter, 736 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=438occurred in iteration=11, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 461 NumberOfCodeBlocks, 449 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 540 ConstructedInterpolants, 0 QuantifiedInterpolants, 1728 SizeOfPredicates, 11 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 126/206 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 02:43:58,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE