./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-longest-2.i --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/pthread/triangular-longest-2.i -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 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:23:56,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:23:56,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:23:56,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:23:56,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:23:56,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:23:56,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:23:56,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:23:56,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:23:56,324 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:23:56,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:23:56,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:23:56,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:23:56,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:23:56,327 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:23:56,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:23:56,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:23:56,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:23:56,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:23:56,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:23:56,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:23:56,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:23:56,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:23:56,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:23:56,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:23:56,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:23:56,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:23:56,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:23:56,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:23:56,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:23:56,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:23:56,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:23:56,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:23:56,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:23:56,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:23:56,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:23:56,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:23:56,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:23:56,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:23:56,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:23:56,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:23:56,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:23:56,337 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 -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2024-11-09 02:23:56,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:23:56,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:23:56,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:23:56,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:23:56,591 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:23:56,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longest-2.i [2024-11-09 02:23:57,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:23:58,081 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:23:58,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i [2024-11-09 02:23:58,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b875ec8a0/da55af911270490b9dc03987bbd34980/FLAGde9398834 [2024-11-09 02:23:58,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b875ec8a0/da55af911270490b9dc03987bbd34980 [2024-11-09 02:23:58,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:23:58,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:23:58,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:23:58,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:23:58,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:23:58,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:23:58" (1/1) ... [2024-11-09 02:23:58,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bbd966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58, skipping insertion in model container [2024-11-09 02:23:58,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:23:58" (1/1) ... [2024-11-09 02:23:58,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:23:58,423 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/pthread/triangular-longest-2.i[30964,30977] [2024-11-09 02:23:58,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:23:58,433 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:23:58,495 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/pthread/triangular-longest-2.i[30964,30977] [2024-11-09 02:23:58,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:23:58,539 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:23:58,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58 WrapperNode [2024-11-09 02:23:58,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:23:58,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:23:58,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:23:58,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:23:58,546 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:23:58" (1/1) ... [2024-11-09 02:23:58,557 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:23:58" (1/1) ... [2024-11-09 02:23:58,577 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-11-09 02:23:58,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:23:58,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:23:58,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:23:58,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:23:58,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58" (1/1) ... [2024-11-09 02:23:58,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58" (1/1) ... [2024-11-09 02:23:58,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58" (1/1) ... [2024-11-09 02:23:58,604 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:23:58,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58" (1/1) ... [2024-11-09 02:23:58,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58" (1/1) ... [2024-11-09 02:23:58,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58" (1/1) ... [2024-11-09 02:23:58,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58" (1/1) ... [2024-11-09 02:23:58,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58" (1/1) ... [2024-11-09 02:23:58,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58" (1/1) ... [2024-11-09 02:23:58,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:23:58,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:23:58,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:23:58,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:23:58,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58" (1/1) ... [2024-11-09 02:23:58,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:23:58,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:23:58,661 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:23:58,664 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:23:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-09 02:23:58,710 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-09 02:23:58,710 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-09 02:23:58,710 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-09 02:23:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 02:23:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:23:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:23:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 02:23:58,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:23:58,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:23:58,712 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:23:58,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:23:58,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:23:58,918 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:23:58,918 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:23:59,004 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:23:59,005 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 02:23:59,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:23:59 BoogieIcfgContainer [2024-11-09 02:23:59,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:23:59,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:23:59,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:23:59,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:23:59,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:23:58" (1/3) ... [2024-11-09 02:23:59,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448f8a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:23:59, skipping insertion in model container [2024-11-09 02:23:59,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:58" (2/3) ... [2024-11-09 02:23:59,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448f8a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:23:59, skipping insertion in model container [2024-11-09 02:23:59,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:23:59" (3/3) ... [2024-11-09 02:23:59,014 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2024-11-09 02:23:59,030 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:23:59,031 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:23:59,031 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:23:59,078 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:23:59,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2024-11-09 02:23:59,143 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-11-09 02:23:59,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:23:59,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-11-09 02:23:59,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2024-11-09 02:23:59,150 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2024-11-09 02:23:59,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:23:59,167 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;@52b89024, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:23:59,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 02:23:59,174 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:23:59,174 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-11-09 02:23:59,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:23:59,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:23:59,175 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:23:59,175 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:23:59,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:23:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash 762204344, now seen corresponding path program 1 times [2024-11-09 02:23:59,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:23:59,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999044602] [2024-11-09 02:23:59,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:23:59,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:23:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:23:59,561 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:23:59,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:23:59,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999044602] [2024-11-09 02:23:59,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999044602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:23:59,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:23:59,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:23:59,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745236408] [2024-11-09 02:23:59,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:23:59,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:23:59,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:23:59,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:23:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:23:59,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:23:59,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:23:59,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:23:59,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:23:59,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:23:59,832 INFO L124 PetriNetUnfolderBase]: 321/543 cut-off events. [2024-11-09 02:23:59,833 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 02:23:59,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 543 events. 321/543 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2179 event pairs, 62 based on Foata normal form. 12/542 useless extension candidates. Maximal degree in co-relation 1045. Up to 221 conditions per place. [2024-11-09 02:23:59,838 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2024-11-09 02:23:59,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2024-11-09 02:23:59,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:23:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:23:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-11-09 02:23:59,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-09 02:23:59,851 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2024-11-09 02:23:59,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2024-11-09 02:23:59,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 02:23:59,855 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2024-11-09 02:23:59,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2024-11-09 02:23:59,860 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2024-11-09 02:23:59,861 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2024-11-09 02:23:59,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:23:59,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:23:59,862 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:23:59,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:23:59,862 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:23:59,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:23:59,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1754207660, now seen corresponding path program 1 times [2024-11-09 02:23:59,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:23:59,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983233331] [2024-11-09 02:23:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:23:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:23:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:00,003 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:24:00,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:00,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983233331] [2024-11-09 02:24:00,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983233331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:24:00,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:24:00,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:24:00,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526762058] [2024-11-09 02:24:00,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:24:00,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:24:00,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:00,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:24:00,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:24:00,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:00,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:24:00,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:00,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:00,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:00,242 INFO L124 PetriNetUnfolderBase]: 382/689 cut-off events. [2024-11-09 02:24:00,242 INFO L125 PetriNetUnfolderBase]: For 285/291 co-relation queries the response was YES. [2024-11-09 02:24:00,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 689 events. 382/689 cut-off events. For 285/291 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2915 event pairs, 65 based on Foata normal form. 33/721 useless extension candidates. Maximal degree in co-relation 1572. Up to 246 conditions per place. [2024-11-09 02:24:00,248 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2024-11-09 02:24:00,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2024-11-09 02:24:00,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:24:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 02:24:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-11-09 02:24:00,251 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-11-09 02:24:00,252 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2024-11-09 02:24:00,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2024-11-09 02:24:00,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-09 02:24:00,256 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2024-11-09 02:24:00,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-11-09 02:24:00,257 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2024-11-09 02:24:00,258 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2024-11-09 02:24:00,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:24:00,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:00,259 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:00,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:24:00,259 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:24:00,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:00,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2024183696, now seen corresponding path program 2 times [2024-11-09 02:24:00,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:00,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304445908] [2024-11-09 02:24:00,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:00,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:00,388 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:24:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304445908] [2024-11-09 02:24:00,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304445908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:24:00,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:24:00,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:24:00,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105215899] [2024-11-09 02:24:00,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:24:00,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:24:00,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:00,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:24:00,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:24:00,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:00,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:24:00,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:00,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:00,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:00,574 INFO L124 PetriNetUnfolderBase]: 328/605 cut-off events. [2024-11-09 02:24:00,574 INFO L125 PetriNetUnfolderBase]: For 1001/1013 co-relation queries the response was YES. [2024-11-09 02:24:00,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 605 events. 328/605 cut-off events. For 1001/1013 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2538 event pairs, 65 based on Foata normal form. 57/661 useless extension candidates. Maximal degree in co-relation 1713. Up to 234 conditions per place. [2024-11-09 02:24:00,578 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2024-11-09 02:24:00,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2024-11-09 02:24:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:24:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 02:24:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-11-09 02:24:00,581 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2024-11-09 02:24:00,581 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2024-11-09 02:24:00,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2024-11-09 02:24:00,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-09 02:24:00,586 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2024-11-09 02:24:00,587 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2024-11-09 02:24:00,589 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2024-11-09 02:24:00,589 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2024-11-09 02:24:00,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:24:00,589 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:00,590 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:00,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:24:00,590 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:24:00,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:00,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1063992253, now seen corresponding path program 1 times [2024-11-09 02:24:00,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:00,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521354543] [2024-11-09 02:24:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:00,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:00,708 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:24:00,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:00,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521354543] [2024-11-09 02:24:00,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521354543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:24:00,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:24:00,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:24:00,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570695416] [2024-11-09 02:24:00,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:24:00,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:24:00,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:00,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:24:00,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:24:00,722 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:00,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:24:00,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:00,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:00,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:00,870 INFO L124 PetriNetUnfolderBase]: 355/659 cut-off events. [2024-11-09 02:24:00,870 INFO L125 PetriNetUnfolderBase]: For 1815/1827 co-relation queries the response was YES. [2024-11-09 02:24:00,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 659 events. 355/659 cut-off events. For 1815/1827 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2860 event pairs, 80 based on Foata normal form. 21/679 useless extension candidates. Maximal degree in co-relation 2039. Up to 258 conditions per place. [2024-11-09 02:24:00,874 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 43 selfloop transitions, 16 changer transitions 21/83 dead transitions. [2024-11-09 02:24:00,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 83 transitions, 597 flow [2024-11-09 02:24:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:24:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 02:24:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-11-09 02:24:00,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2024-11-09 02:24:00,875 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 9 states and 113 transitions. [2024-11-09 02:24:00,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 83 transitions, 597 flow [2024-11-09 02:24:00,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 527 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-11-09 02:24:00,881 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 297 flow [2024-11-09 02:24:00,881 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=297, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-09 02:24:00,882 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2024-11-09 02:24:00,882 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 297 flow [2024-11-09 02:24:00,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:24:00,882 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:00,883 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:00,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:24:00,883 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:24:00,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:00,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1744668785, now seen corresponding path program 2 times [2024-11-09 02:24:00,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:00,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704952581] [2024-11-09 02:24:00,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:00,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:00,950 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:24:00,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:00,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704952581] [2024-11-09 02:24:00,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704952581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:24:00,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:24:00,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:24:00,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617142337] [2024-11-09 02:24:00,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:24:00,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:24:00,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:00,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:24:00,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:24:00,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:00,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:24:00,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:00,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:00,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:01,141 INFO L124 PetriNetUnfolderBase]: 526/971 cut-off events. [2024-11-09 02:24:01,141 INFO L125 PetriNetUnfolderBase]: For 3328/3340 co-relation queries the response was YES. [2024-11-09 02:24:01,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3187 conditions, 971 events. 526/971 cut-off events. For 3328/3340 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4538 event pairs, 53 based on Foata normal form. 39/1007 useless extension candidates. Maximal degree in co-relation 3160. Up to 256 conditions per place. [2024-11-09 02:24:01,146 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 57 selfloop transitions, 22 changer transitions 23/105 dead transitions. [2024-11-09 02:24:01,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 793 flow [2024-11-09 02:24:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:24:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 02:24:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-11-09 02:24:01,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2024-11-09 02:24:01,151 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 297 flow. Second operand 11 states and 141 transitions. [2024-11-09 02:24:01,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 105 transitions, 793 flow [2024-11-09 02:24:01,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 105 transitions, 733 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-11-09 02:24:01,159 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 407 flow [2024-11-09 02:24:01,159 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=407, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-11-09 02:24:01,159 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 38 predicate places. [2024-11-09 02:24:01,159 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 407 flow [2024-11-09 02:24:01,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:24:01,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:01,160 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:01,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:24:01,160 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:24:01,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1091700605, now seen corresponding path program 3 times [2024-11-09 02:24:01,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:01,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567877018] [2024-11-09 02:24:01,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:01,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:01,234 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:24:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:01,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567877018] [2024-11-09 02:24:01,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567877018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:24:01,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:24:01,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:24:01,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520585462] [2024-11-09 02:24:01,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:24:01,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:24:01,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:01,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:24:01,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:24:01,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:01,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 407 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:24:01,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:01,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:01,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:01,442 INFO L124 PetriNetUnfolderBase]: 499/926 cut-off events. [2024-11-09 02:24:01,443 INFO L125 PetriNetUnfolderBase]: For 5506/5518 co-relation queries the response was YES. [2024-11-09 02:24:01,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3520 conditions, 926 events. 499/926 cut-off events. For 5506/5518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4319 event pairs, 59 based on Foata normal form. 57/980 useless extension candidates. Maximal degree in co-relation 3487. Up to 157 conditions per place. [2024-11-09 02:24:01,448 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 45 selfloop transitions, 27 changer transitions 33/108 dead transitions. [2024-11-09 02:24:01,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 999 flow [2024-11-09 02:24:01,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:24:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 02:24:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-11-09 02:24:01,449 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2024-11-09 02:24:01,449 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 407 flow. Second operand 11 states and 138 transitions. [2024-11-09 02:24:01,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 999 flow [2024-11-09 02:24:01,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 108 transitions, 931 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-11-09 02:24:01,472 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 514 flow [2024-11-09 02:24:01,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=514, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2024-11-09 02:24:01,472 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 46 predicate places. [2024-11-09 02:24:01,473 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 514 flow [2024-11-09 02:24:01,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:24:01,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:01,473 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:01,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:24:01,473 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:24:01,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:01,474 INFO L85 PathProgramCache]: Analyzing trace with hash 391260105, now seen corresponding path program 1 times [2024-11-09 02:24:01,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:01,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204386416] [2024-11-09 02:24:01,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:01,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:01,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:01,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204386416] [2024-11-09 02:24:01,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204386416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:24:01,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654709308] [2024-11-09 02:24:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:01,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:01,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:24:01,563 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:24:01,564 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:24:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:01,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 02:24:01,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:24:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:01,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:24:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:01,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654709308] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:24:01,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:24:01,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 02:24:01,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948529827] [2024-11-09 02:24:01,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:24:01,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:24:01,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:01,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:24:01,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:24:01,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:01,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 514 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:24:01,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:01,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:01,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:02,290 INFO L124 PetriNetUnfolderBase]: 607/1136 cut-off events. [2024-11-09 02:24:02,290 INFO L125 PetriNetUnfolderBase]: For 10981/10993 co-relation queries the response was YES. [2024-11-09 02:24:02,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4889 conditions, 1136 events. 607/1136 cut-off events. For 10981/10993 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5008 event pairs, 149 based on Foata normal form. 75/1210 useless extension candidates. Maximal degree in co-relation 4852. Up to 522 conditions per place. [2024-11-09 02:24:02,297 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 67 selfloop transitions, 19 changer transitions 67/156 dead transitions. [2024-11-09 02:24:02,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 156 transitions, 1590 flow [2024-11-09 02:24:02,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 02:24:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-09 02:24:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2024-11-09 02:24:02,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2024-11-09 02:24:02,299 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 514 flow. Second operand 19 states and 231 transitions. [2024-11-09 02:24:02,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 156 transitions, 1590 flow [2024-11-09 02:24:02,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 156 transitions, 1489 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-11-09 02:24:02,316 INFO L231 Difference]: Finished difference. Result has 92 places, 56 transitions, 646 flow [2024-11-09 02:24:02,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=646, PETRI_PLACES=92, PETRI_TRANSITIONS=56} [2024-11-09 02:24:02,317 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 66 predicate places. [2024-11-09 02:24:02,317 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 56 transitions, 646 flow [2024-11-09 02:24:02,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:24:02,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:02,317 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:02,339 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:24:02,521 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:24:02,522 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:24:02,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:02,522 INFO L85 PathProgramCache]: Analyzing trace with hash -827216793, now seen corresponding path program 2 times [2024-11-09 02:24:02,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:02,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965987976] [2024-11-09 02:24:02,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:02,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:02,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:02,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965987976] [2024-11-09 02:24:02,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965987976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:24:02,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194934536] [2024-11-09 02:24:02,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 02:24:02,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:02,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:24:02,629 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:24:02,630 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:24:02,679 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 02:24:02,680 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:24:02,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 02:24:02,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:24:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:02,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:24:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:02,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194934536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:24:02,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:24:02,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 02:24:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094694204] [2024-11-09 02:24:02,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:24:02,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:24:02,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:02,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:24:02,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:24:02,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:02,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 56 transitions, 646 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:24:02,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:02,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:02,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:03,407 INFO L124 PetriNetUnfolderBase]: 895/1655 cut-off events. [2024-11-09 02:24:03,408 INFO L125 PetriNetUnfolderBase]: For 37310/37322 co-relation queries the response was YES. [2024-11-09 02:24:03,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9389 conditions, 1655 events. 895/1655 cut-off events. For 37310/37322 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8056 event pairs, 68 based on Foata normal form. 84/1738 useless extension candidates. Maximal degree in co-relation 9342. Up to 315 conditions per place. [2024-11-09 02:24:03,420 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 88 selfloop transitions, 49 changer transitions 80/220 dead transitions. [2024-11-09 02:24:03,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 220 transitions, 2852 flow [2024-11-09 02:24:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 02:24:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-09 02:24:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 334 transitions. [2024-11-09 02:24:03,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-11-09 02:24:03,423 INFO L175 Difference]: Start difference. First operand has 92 places, 56 transitions, 646 flow. Second operand 27 states and 334 transitions. [2024-11-09 02:24:03,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 220 transitions, 2852 flow [2024-11-09 02:24:03,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 220 transitions, 2305 flow, removed 261 selfloop flow, removed 12 redundant places. [2024-11-09 02:24:03,450 INFO L231 Difference]: Finished difference. Result has 118 places, 72 transitions, 1051 flow [2024-11-09 02:24:03,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1051, PETRI_PLACES=118, PETRI_TRANSITIONS=72} [2024-11-09 02:24:03,451 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 92 predicate places. [2024-11-09 02:24:03,451 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 72 transitions, 1051 flow [2024-11-09 02:24:03,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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:24:03,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:03,451 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:03,467 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:24:03,652 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:24:03,652 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:24:03,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:03,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1859448120, now seen corresponding path program 1 times [2024-11-09 02:24:03,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:03,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947229395] [2024-11-09 02:24:03,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:03,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:03,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:03,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947229395] [2024-11-09 02:24:03,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947229395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:24:03,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266607147] [2024-11-09 02:24:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:03,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:03,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:24:03,746 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:24:03,747 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:24:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:03,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 02:24:03,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:24:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:03,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:24:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266607147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:24:03,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:24:03,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-09 02:24:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411054941] [2024-11-09 02:24:03,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:24:03,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 02:24:03,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:03,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 02:24:03,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:24:03,965 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:03,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 72 transitions, 1051 flow. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 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:24:03,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:03,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:03,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:04,551 INFO L124 PetriNetUnfolderBase]: 1129/2124 cut-off events. [2024-11-09 02:24:04,551 INFO L125 PetriNetUnfolderBase]: For 87490/87496 co-relation queries the response was YES. [2024-11-09 02:24:04,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14779 conditions, 2124 events. 1129/2124 cut-off events. For 87490/87496 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 11104 event pairs, 153 based on Foata normal form. 69/2190 useless extension candidates. Maximal degree in co-relation 14720. Up to 490 conditions per place. [2024-11-09 02:24:04,566 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 99 selfloop transitions, 53 changer transitions 67/222 dead transitions. [2024-11-09 02:24:04,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 222 transitions, 3667 flow [2024-11-09 02:24:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 02:24:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-09 02:24:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 309 transitions. [2024-11-09 02:24:04,568 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.515 [2024-11-09 02:24:04,568 INFO L175 Difference]: Start difference. First operand has 118 places, 72 transitions, 1051 flow. Second operand 25 states and 309 transitions. [2024-11-09 02:24:04,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 222 transitions, 3667 flow [2024-11-09 02:24:04,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 222 transitions, 3084 flow, removed 275 selfloop flow, removed 13 redundant places. [2024-11-09 02:24:04,626 INFO L231 Difference]: Finished difference. Result has 136 places, 83 transitions, 1339 flow [2024-11-09 02:24:04,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1339, PETRI_PLACES=136, PETRI_TRANSITIONS=83} [2024-11-09 02:24:04,627 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 110 predicate places. [2024-11-09 02:24:04,627 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 83 transitions, 1339 flow [2024-11-09 02:24:04,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 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:24:04,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:04,628 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:04,643 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:24:04,831 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:24:04,832 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:24:04,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2089657410, now seen corresponding path program 2 times [2024-11-09 02:24:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719229322] [2024-11-09 02:24:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:04,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719229322] [2024-11-09 02:24:04,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719229322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:24:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778402409] [2024-11-09 02:24:04,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 02:24:04,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:24:04,921 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:24:04,922 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:24:04,966 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 02:24:04,966 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:24:04,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 02:24:04,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:24:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:05,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:24:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:05,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778402409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:24:05,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:24:05,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-09 02:24:05,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54218648] [2024-11-09 02:24:05,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:24:05,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 02:24:05,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:05,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 02:24:05,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:24:05,104 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:05,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 83 transitions, 1339 flow. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 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:24:05,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:05,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:05,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:05,795 INFO L124 PetriNetUnfolderBase]: 1246/2377 cut-off events. [2024-11-09 02:24:05,796 INFO L125 PetriNetUnfolderBase]: For 139342/139348 co-relation queries the response was YES. [2024-11-09 02:24:05,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17840 conditions, 2377 events. 1246/2377 cut-off events. For 139342/139348 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12694 event pairs, 65 based on Foata normal form. 141/2515 useless extension candidates. Maximal degree in co-relation 17775. Up to 501 conditions per place. [2024-11-09 02:24:05,814 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 89 selfloop transitions, 78 changer transitions 98/268 dead transitions. [2024-11-09 02:24:05,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 268 transitions, 5207 flow [2024-11-09 02:24:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 02:24:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-09 02:24:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 345 transitions. [2024-11-09 02:24:05,816 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5133928571428571 [2024-11-09 02:24:05,816 INFO L175 Difference]: Start difference. First operand has 136 places, 83 transitions, 1339 flow. Second operand 28 states and 345 transitions. [2024-11-09 02:24:05,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 268 transitions, 5207 flow [2024-11-09 02:24:05,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 268 transitions, 4433 flow, removed 349 selfloop flow, removed 18 redundant places. [2024-11-09 02:24:05,967 INFO L231 Difference]: Finished difference. Result has 157 places, 104 transitions, 1968 flow [2024-11-09 02:24:05,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1968, PETRI_PLACES=157, PETRI_TRANSITIONS=104} [2024-11-09 02:24:05,969 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 131 predicate places. [2024-11-09 02:24:05,969 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 104 transitions, 1968 flow [2024-11-09 02:24:05,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 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:24:05,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:05,970 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:05,983 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:24:06,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:06,171 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:24:06,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:06,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1288511194, now seen corresponding path program 3 times [2024-11-09 02:24:06,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:06,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981887992] [2024-11-09 02:24:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:06,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:06,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:06,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:06,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981887992] [2024-11-09 02:24:06,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981887992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:24:06,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634722710] [2024-11-09 02:24:06,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 02:24:06,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:06,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:24:06,346 INFO L229 MonitoredProcess]: Starting monitored process 6 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:24:06,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 02:24:06,392 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-09 02:24:06,393 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:24:06,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 02:24:06,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:24:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:06,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:24:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:06,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634722710] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:24:06,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:24:06,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2024-11-09 02:24:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313678426] [2024-11-09 02:24:06,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:24:06,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 02:24:06,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:06,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 02:24:06,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2024-11-09 02:24:06,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:06,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 104 transitions, 1968 flow. Second operand has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 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:24:06,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:06,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:06,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:07,979 INFO L124 PetriNetUnfolderBase]: 1714/3171 cut-off events. [2024-11-09 02:24:07,979 INFO L125 PetriNetUnfolderBase]: For 260934/260940 co-relation queries the response was YES. [2024-11-09 02:24:07,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27533 conditions, 3171 events. 1714/3171 cut-off events. For 260934/260940 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 15951 event pairs, 42 based on Foata normal form. 96/3266 useless extension candidates. Maximal degree in co-relation 27458. Up to 678 conditions per place. [2024-11-09 02:24:08,007 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 142 selfloop transitions, 114 changer transitions 135/394 dead transitions. [2024-11-09 02:24:08,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 394 transitions, 8418 flow [2024-11-09 02:24:08,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-09 02:24:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-11-09 02:24:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 565 transitions. [2024-11-09 02:24:08,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5117753623188406 [2024-11-09 02:24:08,011 INFO L175 Difference]: Start difference. First operand has 157 places, 104 transitions, 1968 flow. Second operand 46 states and 565 transitions. [2024-11-09 02:24:08,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 394 transitions, 8418 flow [2024-11-09 02:24:08,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 394 transitions, 7110 flow, removed 626 selfloop flow, removed 18 redundant places. [2024-11-09 02:24:08,186 INFO L231 Difference]: Finished difference. Result has 204 places, 138 transitions, 3070 flow [2024-11-09 02:24:08,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3070, PETRI_PLACES=204, PETRI_TRANSITIONS=138} [2024-11-09 02:24:08,187 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 178 predicate places. [2024-11-09 02:24:08,187 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 138 transitions, 3070 flow [2024-11-09 02:24:08,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 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:24:08,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:08,188 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:08,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 02:24:08,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 02:24:08,389 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:24:08,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:08,389 INFO L85 PathProgramCache]: Analyzing trace with hash -898827395, now seen corresponding path program 4 times [2024-11-09 02:24:08,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:08,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456771244] [2024-11-09 02:24:08,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:08,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:08,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:08,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456771244] [2024-11-09 02:24:08,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456771244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:24:08,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325361958] [2024-11-09 02:24:08,672 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 02:24:08,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:08,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:24:08,673 INFO L229 MonitoredProcess]: Starting monitored process 7 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:24:08,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 02:24:08,722 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 02:24:08,722 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:24:08,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 02:24:08,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:24:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:08,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:24:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:09,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325361958] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:24:09,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:24:09,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2024-11-09 02:24:09,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154352315] [2024-11-09 02:24:09,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:24:09,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 02:24:09,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:09,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 02:24:09,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 02:24:09,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:09,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 138 transitions, 3070 flow. Second operand has 35 states, 35 states have (on average 7.057142857142857) internal successors, (247), 35 states have internal predecessors, (247), 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:24:09,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:09,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:09,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:10,925 INFO L124 PetriNetUnfolderBase]: 2218/4260 cut-off events. [2024-11-09 02:24:10,925 INFO L125 PetriNetUnfolderBase]: For 591333/591339 co-relation queries the response was YES. [2024-11-09 02:24:10,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45836 conditions, 4260 events. 2218/4260 cut-off events. For 591333/591339 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 22181 event pairs, 421 based on Foata normal form. 159/4416 useless extension candidates. Maximal degree in co-relation 45743. Up to 1483 conditions per place. [2024-11-09 02:24:10,960 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 190 selfloop transitions, 101 changer transitions 189/483 dead transitions. [2024-11-09 02:24:10,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 483 transitions, 13825 flow [2024-11-09 02:24:10,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-09 02:24:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2024-11-09 02:24:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 653 transitions. [2024-11-09 02:24:10,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4946969696969697 [2024-11-09 02:24:10,962 INFO L175 Difference]: Start difference. First operand has 204 places, 138 transitions, 3070 flow. Second operand 55 states and 653 transitions. [2024-11-09 02:24:10,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 483 transitions, 13825 flow [2024-11-09 02:24:11,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 483 transitions, 10115 flow, removed 1813 selfloop flow, removed 29 redundant places. [2024-11-09 02:24:11,450 INFO L231 Difference]: Finished difference. Result has 252 places, 180 transitions, 3968 flow [2024-11-09 02:24:11,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=3968, PETRI_PLACES=252, PETRI_TRANSITIONS=180} [2024-11-09 02:24:11,451 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 226 predicate places. [2024-11-09 02:24:11,451 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 180 transitions, 3968 flow [2024-11-09 02:24:11,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.057142857142857) internal successors, (247), 35 states have internal predecessors, (247), 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:24:11,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:11,451 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:11,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 02:24:11,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:11,652 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:24:11,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:11,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1802871663, now seen corresponding path program 5 times [2024-11-09 02:24:11,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:11,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136037505] [2024-11-09 02:24:11,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:11,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:11,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136037505] [2024-11-09 02:24:11,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136037505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:24:11,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578198009] [2024-11-09 02:24:11,944 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 02:24:11,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:11,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:24:11,945 INFO L229 MonitoredProcess]: Starting monitored process 8 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:24:11,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 02:24:11,998 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-09 02:24:11,998 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:24:11,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 02:24:12,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:24:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:12,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:24:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:12,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578198009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:24:12,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:24:12,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2024-11-09 02:24:12,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796784232] [2024-11-09 02:24:12,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:24:12,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 02:24:12,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:12,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 02:24:12,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 02:24:12,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:12,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 180 transitions, 3968 flow. Second operand has 36 states, 36 states have (on average 7.083333333333333) internal successors, (255), 36 states have internal predecessors, (255), 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:24:12,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:12,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:12,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:14,699 INFO L124 PetriNetUnfolderBase]: 2767/5513 cut-off events. [2024-11-09 02:24:14,699 INFO L125 PetriNetUnfolderBase]: For 986804/986810 co-relation queries the response was YES. [2024-11-09 02:24:14,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61509 conditions, 5513 events. 2767/5513 cut-off events. For 986804/986810 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 31176 event pairs, 194 based on Foata normal form. 159/5671 useless extension candidates. Maximal degree in co-relation 61401. Up to 1380 conditions per place. [2024-11-09 02:24:14,749 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 180 selfloop transitions, 193 changer transitions 201/577 dead transitions. [2024-11-09 02:24:14,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 577 transitions, 16558 flow [2024-11-09 02:24:14,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-09 02:24:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2024-11-09 02:24:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 730 transitions. [2024-11-09 02:24:14,751 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49863387978142076 [2024-11-09 02:24:14,751 INFO L175 Difference]: Start difference. First operand has 252 places, 180 transitions, 3968 flow. Second operand 61 states and 730 transitions. [2024-11-09 02:24:14,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 577 transitions, 16558 flow [2024-11-09 02:24:16,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 577 transitions, 14028 flow, removed 1228 selfloop flow, removed 31 redundant places. [2024-11-09 02:24:16,023 INFO L231 Difference]: Finished difference. Result has 300 places, 241 transitions, 5993 flow [2024-11-09 02:24:16,023 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3066, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=5993, PETRI_PLACES=300, PETRI_TRANSITIONS=241} [2024-11-09 02:24:16,024 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 274 predicate places. [2024-11-09 02:24:16,024 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 241 transitions, 5993 flow [2024-11-09 02:24:16,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.083333333333333) internal successors, (255), 36 states have internal predecessors, (255), 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:24:16,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:16,024 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:16,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 02:24:16,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:16,227 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:24:16,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 55721545, now seen corresponding path program 6 times [2024-11-09 02:24:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:16,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817935051] [2024-11-09 02:24:16,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:16,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817935051] [2024-11-09 02:24:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817935051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:24:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229138465] [2024-11-09 02:24:16,475 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 02:24:16,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:16,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:24:16,477 INFO L229 MonitoredProcess]: Starting monitored process 9 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:24:16,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 02:24:16,535 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-09 02:24:16,536 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:24:16,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 02:24:16,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:24:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:16,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:24:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:16,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229138465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:24:16,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:24:16,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2024-11-09 02:24:16,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443959355] [2024-11-09 02:24:16,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:24:16,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 02:24:16,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:16,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 02:24:16,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 02:24:16,925 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:16,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 241 transitions, 5993 flow. Second operand has 35 states, 35 states have (on average 7.057142857142857) internal successors, (247), 35 states have internal predecessors, (247), 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:24:16,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:16,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:16,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:20,208 INFO L124 PetriNetUnfolderBase]: 3694/7306 cut-off events. [2024-11-09 02:24:20,208 INFO L125 PetriNetUnfolderBase]: For 1943350/1943356 co-relation queries the response was YES. [2024-11-09 02:24:20,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95685 conditions, 7306 events. 3694/7306 cut-off events. For 1943350/1943356 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 42688 event pairs, 83 based on Foata normal form. 159/7462 useless extension candidates. Maximal degree in co-relation 95559. Up to 1827 conditions per place. [2024-11-09 02:24:20,317 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 226 selfloop transitions, 274 changer transitions 205/708 dead transitions. [2024-11-09 02:24:20,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 708 transitions, 23649 flow [2024-11-09 02:24:20,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 02:24:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2024-11-09 02:24:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 868 transitions. [2024-11-09 02:24:20,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5093896713615024 [2024-11-09 02:24:20,320 INFO L175 Difference]: Start difference. First operand has 300 places, 241 transitions, 5993 flow. Second operand 71 states and 868 transitions. [2024-11-09 02:24:20,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 708 transitions, 23649 flow [2024-11-09 02:24:22,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 708 transitions, 19791 flow, removed 1881 selfloop flow, removed 31 redundant places. [2024-11-09 02:24:22,737 INFO L231 Difference]: Finished difference. Result has 364 places, 302 transitions, 8507 flow [2024-11-09 02:24:22,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4531, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=8507, PETRI_PLACES=364, PETRI_TRANSITIONS=302} [2024-11-09 02:24:22,738 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 338 predicate places. [2024-11-09 02:24:22,738 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 302 transitions, 8507 flow [2024-11-09 02:24:22,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.057142857142857) internal successors, (247), 35 states have internal predecessors, (247), 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:24:22,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:22,739 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:22,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 02:24:22,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 02:24:22,939 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:24:22,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash 904414027, now seen corresponding path program 7 times [2024-11-09 02:24:22,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:22,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550393759] [2024-11-09 02:24:22,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:22,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:23,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:23,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550393759] [2024-11-09 02:24:23,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550393759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:24:23,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317014881] [2024-11-09 02:24:23,234 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 02:24:23,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:23,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:24:23,236 INFO L229 MonitoredProcess]: Starting monitored process 10 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:24:23,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 02:24:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:23,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 02:24:23,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:24:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:23,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:24:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:23,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317014881] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:24:23,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:24:23,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2024-11-09 02:24:23,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377272196] [2024-11-09 02:24:23,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:24:23,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 02:24:23,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:23,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 02:24:23,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=1596, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 02:24:23,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:23,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 302 transitions, 8507 flow. Second operand has 46 states, 46 states have (on average 7.021739130434782) internal successors, (323), 46 states have internal predecessors, (323), 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:24:23,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:23,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:23,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:29,054 INFO L124 PetriNetUnfolderBase]: 5170/10176 cut-off events. [2024-11-09 02:24:29,054 INFO L125 PetriNetUnfolderBase]: For 4206680/4206686 co-relation queries the response was YES. [2024-11-09 02:24:29,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160013 conditions, 10176 events. 5170/10176 cut-off events. For 4206680/4206686 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 59567 event pairs, 52 based on Foata normal form. 330/10505 useless extension candidates. Maximal degree in co-relation 159862. Up to 2574 conditions per place. [2024-11-09 02:24:29,199 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 314 selfloop transitions, 388 changer transitions 335/1040 dead transitions. [2024-11-09 02:24:29,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1040 transitions, 42789 flow [2024-11-09 02:24:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-11-09 02:24:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2024-11-09 02:24:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 1297 transitions. [2024-11-09 02:24:29,202 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5098270440251572 [2024-11-09 02:24:29,202 INFO L175 Difference]: Start difference. First operand has 364 places, 302 transitions, 8507 flow. Second operand 106 states and 1297 transitions. [2024-11-09 02:24:29,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 1040 transitions, 42789 flow [2024-11-09 02:24:33,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 1040 transitions, 34190 flow, removed 4215 selfloop flow, removed 35 redundant places. [2024-11-09 02:24:33,324 INFO L231 Difference]: Finished difference. Result has 482 places, 416 transitions, 13694 flow [2024-11-09 02:24:33,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6124, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=13694, PETRI_PLACES=482, PETRI_TRANSITIONS=416} [2024-11-09 02:24:33,325 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 456 predicate places. [2024-11-09 02:24:33,325 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 416 transitions, 13694 flow [2024-11-09 02:24:33,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 7.021739130434782) internal successors, (323), 46 states have internal predecessors, (323), 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:24:33,325 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:33,325 INFO L204 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:33,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 02:24:33,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 02:24:33,526 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:24:33,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:33,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1028096519, now seen corresponding path program 8 times [2024-11-09 02:24:33,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:33,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353563616] [2024-11-09 02:24:33,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:33,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:34,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:34,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353563616] [2024-11-09 02:24:34,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353563616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:24:34,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794943072] [2024-11-09 02:24:34,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 02:24:34,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:34,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:24:34,210 INFO L229 MonitoredProcess]: Starting monitored process 11 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:24:34,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 02:24:34,265 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 02:24:34,265 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:24:34,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 02:24:34,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:24:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:34,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:24:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:34,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794943072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:24:34,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:24:34,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 46 [2024-11-09 02:24:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495379260] [2024-11-09 02:24:34,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:24:34,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 02:24:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:34,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 02:24:34,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 02:24:34,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-09 02:24:34,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 416 transitions, 13694 flow. Second operand has 47 states, 47 states have (on average 7.085106382978723) internal successors, (333), 47 states have internal predecessors, (333), 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:24:34,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:34,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-09 02:24:34,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:40,930 INFO L124 PetriNetUnfolderBase]: 5692/11178 cut-off events. [2024-11-09 02:24:40,931 INFO L125 PetriNetUnfolderBase]: For 6361445/6361451 co-relation queries the response was YES. [2024-11-09 02:24:41,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186456 conditions, 11178 events. 5692/11178 cut-off events. For 6361445/6361451 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 65224 event pairs, 38 based on Foata normal form. 42/11219 useless extension candidates. Maximal degree in co-relation 186258. Up to 2661 conditions per place. [2024-11-09 02:24:41,111 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 311 selfloop transitions, 456 changer transitions 185/955 dead transitions. [2024-11-09 02:24:41,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 955 transitions, 38315 flow [2024-11-09 02:24:41,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-11-09 02:24:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2024-11-09 02:24:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 1039 transitions. [2024-11-09 02:24:41,113 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5033914728682171 [2024-11-09 02:24:41,113 INFO L175 Difference]: Start difference. First operand has 482 places, 416 transitions, 13694 flow. Second operand 86 states and 1039 transitions. [2024-11-09 02:24:41,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 955 transitions, 38315 flow [2024-11-09 02:24:56,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 955 transitions, 27969 flow, removed 5029 selfloop flow, removed 53 redundant places. [2024-11-09 02:24:56,095 INFO L231 Difference]: Finished difference. Result has 503 places, 488 transitions, 11953 flow [2024-11-09 02:24:56,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=8773, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=385, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=11953, PETRI_PLACES=503, PETRI_TRANSITIONS=488} [2024-11-09 02:24:56,096 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 477 predicate places. [2024-11-09 02:24:56,096 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 488 transitions, 11953 flow [2024-11-09 02:24:56,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 7.085106382978723) internal successors, (333), 47 states have internal predecessors, (333), 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:24:56,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:56,096 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:56,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 02:24:56,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 02:24:56,297 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:24:56,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash -421834818, now seen corresponding path program 9 times [2024-11-09 02:24:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:56,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806741381] [2024-11-09 02:24:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:24:56,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:24:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:24:56,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:24:56,368 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:24:56,370 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-09 02:24:56,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-09 02:24:56,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-09 02:24:56,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 02:24:56,372 INFO L407 BasicCegarLoop]: Path program histogram: [9, 3, 2, 2, 1] [2024-11-09 02:24:56,480 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 02:24:56,480 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:24:56,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:24:56 BasicIcfg [2024-11-09 02:24:56,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:24:56,486 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:24:56,486 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:24:56,486 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:24:56,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:23:59" (3/4) ... [2024-11-09 02:24:56,487 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 02:24:56,564 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 02:24:56,564 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:24:56,564 INFO L158 Benchmark]: Toolchain (without parser) took 58458.28ms. Allocated memory was 146.8MB in the beginning and 7.4GB in the end (delta: 7.3GB). Free memory was 72.5MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-09 02:24:56,565 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:24:56,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.44ms. Allocated memory was 146.8MB in the beginning and 203.4MB in the end (delta: 56.6MB). Free memory was 72.3MB in the beginning and 169.3MB in the end (delta: -97.0MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-11-09 02:24:56,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.75ms. Allocated memory is still 203.4MB. Free memory was 169.3MB in the beginning and 167.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:24:56,565 INFO L158 Benchmark]: Boogie Preprocessor took 40.15ms. Allocated memory is still 203.4MB. Free memory was 167.3MB in the beginning and 165.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:24:56,565 INFO L158 Benchmark]: RCFGBuilder took 387.30ms. Allocated memory is still 203.4MB. Free memory was 165.2MB in the beginning and 147.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 02:24:56,566 INFO L158 Benchmark]: TraceAbstraction took 57477.36ms. Allocated memory was 203.4MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 146.3MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-09 02:24:56,566 INFO L158 Benchmark]: Witness Printer took 78.42ms. Allocated memory is still 7.4GB. Free memory was 6.2GB in the beginning and 6.2GB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 02:24:56,567 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.16ms. Allocated memory is still 146.8MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.44ms. Allocated memory was 146.8MB in the beginning and 203.4MB in the end (delta: 56.6MB). Free memory was 72.3MB in the beginning and 169.3MB in the end (delta: -97.0MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.75ms. Allocated memory is still 203.4MB. Free memory was 169.3MB in the beginning and 167.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.15ms. Allocated memory is still 203.4MB. Free memory was 167.3MB in the beginning and 165.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 387.30ms. Allocated memory is still 203.4MB. Free memory was 165.2MB in the beginning and 147.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 57477.36ms. Allocated memory was 203.4MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 146.3MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 78.42ms. Allocated memory is still 7.4GB. Free memory was 6.2GB in the beginning and 6.2GB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-2, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=3, id1=-2, id2=-1, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=43, id1=-2, id2=-1, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-2, id2=-1, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-2, id2=-1, j=46, k=19, k=19] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-2, id2=-1, j=46, k=19, k=19] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 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: 57.3s, OverallIterations: 17, TraceHistogramMax: 20, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 48.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8006 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7971 mSDsluCounter, 331 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 312 mSDsCounter, 415 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7846 IncrementalHoareTripleChecker+Invalid, 8261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 415 mSolverCounterUnsat, 19 mSDtfsCounter, 7846 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1567 GetRequests, 753 SyntacticMatches, 35 SemanticMatches, 779 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22358 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13694occurred in iteration=15, InterpolantAutomatonStates: 578, 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.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1107 NumberOfCodeBlocks, 1107 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1392 ConstructedInterpolants, 0 QuantifiedInterpolants, 5633 SizeOfPredicates, 130 NumberOfNonLiveVariables, 1340 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 0/4641 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-09 02:24:56,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE