./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:09:53,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:09:53,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:09:53,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:09:53,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:09:53,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:09:53,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:09:53,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:09:53,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:09:53,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:09:53,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:09:53,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:09:53,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:09:53,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:09:53,693 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:09:53,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:09:53,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:09:53,694 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:09:53,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:09:53,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:09:53,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:09:53,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:09:53,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:09:53,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:09:53,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:09:53,696 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:09:53,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:09:53,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:09:53,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:09:53,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:09:53,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:09:53,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:09:53,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:09:53,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:09:53,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:09:53,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:09:53,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:09:53,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:09:53,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:09:53,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:09:53,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:09:53,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:09:53,703 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-clean/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-clean/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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2024-10-11 14:09:53,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:09:53,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:09:53,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:09:53,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:09:53,936 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:09:53,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-10-11 14:09:55,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:09:55,386 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:09:55,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-10-11 14:09:55,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/16ae1de46/9e4d5c435f0d427b9f97c07b3878c2f5/FLAG3d1d4cbbc [2024-10-11 14:09:55,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/16ae1de46/9e4d5c435f0d427b9f97c07b3878c2f5 [2024-10-11 14:09:55,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:09:55,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:09:55,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:09:55,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:09:55,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:09:55,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:09:55" (1/1) ... [2024-10-11 14:09:55,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71fec0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:55, skipping insertion in model container [2024-10-11 14:09:55,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:09:55" (1/1) ... [2024-10-11 14:09:55,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:09:56,119 WARN L248 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-2.i[30952,30965] [2024-10-11 14:09:56,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:09:56,129 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:09:56,175 WARN L248 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-2.i[30952,30965] [2024-10-11 14:09:56,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:09:56,206 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:09:56,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56 WrapperNode [2024-10-11 14:09:56,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:09:56,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:09:56,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:09:56,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:09:56,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (1/1) ... [2024-10-11 14:09:56,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (1/1) ... [2024-10-11 14:09:56,244 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-10-11 14:09:56,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:09:56,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:09:56,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:09:56,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:09:56,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (1/1) ... [2024-10-11 14:09:56,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (1/1) ... [2024-10-11 14:09:56,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (1/1) ... [2024-10-11 14:09:56,271 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-10-11 14:09:56,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (1/1) ... [2024-10-11 14:09:56,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (1/1) ... [2024-10-11 14:09:56,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (1/1) ... [2024-10-11 14:09:56,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (1/1) ... [2024-10-11 14:09:56,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (1/1) ... [2024-10-11 14:09:56,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (1/1) ... [2024-10-11 14:09:56,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:09:56,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:09:56,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:09:56,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:09:56,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (1/1) ... [2024-10-11 14:09:56,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:09:56,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:56,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:09:56,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:09:56,368 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-11 14:09:56,368 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-11 14:09:56,368 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-11 14:09:56,368 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-11 14:09:56,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:09:56,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:09:56,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:09:56,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:09:56,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:09:56,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:09:56,370 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:09:56,464 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:09:56,466 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:09:56,550 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:09:56,551 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:09:56,610 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:09:56,610 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 14:09:56,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:09:56 BoogieIcfgContainer [2024-10-11 14:09:56,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:09:56,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:09:56,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:09:56,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:09:56,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:09:55" (1/3) ... [2024-10-11 14:09:56,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4411c6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:09:56, skipping insertion in model container [2024-10-11 14:09:56,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:56" (2/3) ... [2024-10-11 14:09:56,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4411c6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:09:56, skipping insertion in model container [2024-10-11 14:09:56,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:09:56" (3/3) ... [2024-10-11 14:09:56,618 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-10-11 14:09:56,632 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:09:56,632 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:09:56,632 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:09:56,667 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:09:56,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2024-10-11 14:09:56,713 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-10-11 14:09:56,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:09:56,715 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-10-11 14:09:56,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2024-10-11 14:09:56,718 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2024-10-11 14:09:56,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:09:56,730 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;@60ed3e47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:09:56,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 14:09:56,737 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:09:56,737 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-10-11 14:09:56,737 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:09:56,737 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:56,738 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:56,738 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-10-11 14:09:56,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash 762204344, now seen corresponding path program 1 times [2024-10-11 14:09:56,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:56,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383508671] [2024-10-11 14:09:56,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:57,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383508671] [2024-10-11 14:09:57,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383508671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:57,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:57,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:09:57,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741216390] [2024-10-11 14:09:57,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:57,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:09:57,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:57,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:09:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:09:57,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:09:57,158 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-10-11 14:09:57,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:57,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:09:57,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:57,358 INFO L124 PetriNetUnfolderBase]: 321/543 cut-off events. [2024-10-11 14:09:57,360 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:09:57,364 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-10-11 14:09:57,368 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2024-10-11 14:09:57,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2024-10-11 14:09:57,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:09:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:09:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-10-11 14:09:57,384 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-10-11 14:09:57,386 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2024-10-11 14:09:57,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2024-10-11 14:09:57,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:09:57,393 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2024-10-11 14:09:57,394 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-10-11 14:09:57,398 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2024-10-11 14:09:57,400 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2024-10-11 14:09:57,400 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-10-11 14:09:57,400 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:57,401 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:57,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:09:57,402 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-10-11 14:09:57,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:57,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1754207660, now seen corresponding path program 1 times [2024-10-11 14:09:57,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:57,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112191105] [2024-10-11 14:09:57,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:57,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:57,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:57,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112191105] [2024-10-11 14:09:57,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112191105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:57,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:57,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:09:57,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770611671] [2024-10-11 14:09:57,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:57,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:09:57,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:57,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:09:57,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:09:57,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:09:57,618 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-10-11 14:09:57,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:57,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:09:57,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:57,825 INFO L124 PetriNetUnfolderBase]: 382/689 cut-off events. [2024-10-11 14:09:57,826 INFO L125 PetriNetUnfolderBase]: For 285/291 co-relation queries the response was YES. [2024-10-11 14:09:57,830 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-10-11 14:09:57,833 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2024-10-11 14:09:57,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2024-10-11 14:09:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:09:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:09:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-10-11 14:09:57,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-10-11 14:09:57,837 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2024-10-11 14:09:57,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2024-10-11 14:09:57,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-10-11 14:09:57,844 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2024-10-11 14:09:57,844 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-10-11 14:09:57,845 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2024-10-11 14:09:57,846 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2024-10-11 14:09:57,846 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-10-11 14:09:57,846 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:57,847 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:57,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:09:57,847 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-10-11 14:09:57,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:57,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2024183696, now seen corresponding path program 2 times [2024-10-11 14:09:57,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:57,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825422330] [2024-10-11 14:09:57,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:57,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:57,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:57,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825422330] [2024-10-11 14:09:57,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825422330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:57,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:57,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:09:57,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516672075] [2024-10-11 14:09:57,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:57,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:09:57,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:57,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:09:57,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:09:57,968 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:09:57,969 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-10-11 14:09:57,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:57,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:09:57,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:58,162 INFO L124 PetriNetUnfolderBase]: 328/605 cut-off events. [2024-10-11 14:09:58,162 INFO L125 PetriNetUnfolderBase]: For 1001/1013 co-relation queries the response was YES. [2024-10-11 14:09:58,164 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-10-11 14:09:58,166 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2024-10-11 14:09:58,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2024-10-11 14:09:58,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:09:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:09:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-10-11 14:09:58,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2024-10-11 14:09:58,168 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2024-10-11 14:09:58,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2024-10-11 14:09:58,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-11 14:09:58,172 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2024-10-11 14:09:58,172 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-10-11 14:09:58,173 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2024-10-11 14:09:58,173 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2024-10-11 14:09:58,173 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-10-11 14:09:58,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:58,173 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:58,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:09:58,174 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-10-11 14:09:58,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:58,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1063992253, now seen corresponding path program 1 times [2024-10-11 14:09:58,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:58,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780999720] [2024-10-11 14:09:58,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:58,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:58,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:58,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780999720] [2024-10-11 14:09:58,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780999720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:58,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:58,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:09:58,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706219675] [2024-10-11 14:09:58,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:58,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:09:58,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:58,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:09:58,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:09:58,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:09:58,309 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-10-11 14:09:58,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:58,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:09:58,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:58,481 INFO L124 PetriNetUnfolderBase]: 355/659 cut-off events. [2024-10-11 14:09:58,481 INFO L125 PetriNetUnfolderBase]: For 1815/1827 co-relation queries the response was YES. [2024-10-11 14:09:58,484 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-10-11 14:09:58,486 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 43 selfloop transitions, 16 changer transitions 21/83 dead transitions. [2024-10-11 14:09:58,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 83 transitions, 597 flow [2024-10-11 14:09:58,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:09:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:09:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-10-11 14:09:58,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2024-10-11 14:09:58,488 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 9 states and 113 transitions. [2024-10-11 14:09:58,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 83 transitions, 597 flow [2024-10-11 14:09:58,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 527 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-10-11 14:09:58,494 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 297 flow [2024-10-11 14:09:58,495 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-10-11 14:09:58,495 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2024-10-11 14:09:58,496 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 297 flow [2024-10-11 14:09:58,496 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-10-11 14:09:58,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:58,496 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:58,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:09:58,496 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-10-11 14:09:58,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1744668785, now seen corresponding path program 2 times [2024-10-11 14:09:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689880174] [2024-10-11 14:09:58,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:58,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:58,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:58,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689880174] [2024-10-11 14:09:58,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689880174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:58,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:58,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:09:58,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184461098] [2024-10-11 14:09:58,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:58,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:09:58,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:58,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:09:58,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:09:58,604 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:09:58,605 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-10-11 14:09:58,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:58,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:09:58,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:58,804 INFO L124 PetriNetUnfolderBase]: 526/971 cut-off events. [2024-10-11 14:09:58,805 INFO L125 PetriNetUnfolderBase]: For 3328/3340 co-relation queries the response was YES. [2024-10-11 14:09:58,806 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-10-11 14:09:58,809 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 57 selfloop transitions, 22 changer transitions 23/105 dead transitions. [2024-10-11 14:09:58,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 793 flow [2024-10-11 14:09:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:09:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 14:09:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-10-11 14:09:58,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2024-10-11 14:09:58,811 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 297 flow. Second operand 11 states and 141 transitions. [2024-10-11 14:09:58,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 105 transitions, 793 flow [2024-10-11 14:09:58,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 105 transitions, 733 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-10-11 14:09:58,816 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 407 flow [2024-10-11 14:09:58,817 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-10-11 14:09:58,817 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 38 predicate places. [2024-10-11 14:09:58,817 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 407 flow [2024-10-11 14:09:58,817 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-10-11 14:09:58,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:58,818 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:58,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:09:58,818 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-10-11 14:09:58,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:58,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1091700605, now seen corresponding path program 3 times [2024-10-11 14:09:58,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:58,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708136498] [2024-10-11 14:09:58,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:58,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:58,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:58,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708136498] [2024-10-11 14:09:58,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708136498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:58,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:58,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:09:58,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11178922] [2024-10-11 14:09:58,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:58,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:09:58,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:58,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:09:58,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:09:58,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:09:58,924 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-10-11 14:09:58,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:58,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:09:58,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:59,130 INFO L124 PetriNetUnfolderBase]: 499/926 cut-off events. [2024-10-11 14:09:59,131 INFO L125 PetriNetUnfolderBase]: For 5506/5518 co-relation queries the response was YES. [2024-10-11 14:09:59,132 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-10-11 14:09:59,135 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 45 selfloop transitions, 27 changer transitions 33/108 dead transitions. [2024-10-11 14:09:59,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 999 flow [2024-10-11 14:09:59,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:09:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 14:09:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-10-11 14:09:59,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2024-10-11 14:09:59,137 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 407 flow. Second operand 11 states and 138 transitions. [2024-10-11 14:09:59,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 999 flow [2024-10-11 14:09:59,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 108 transitions, 931 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-10-11 14:09:59,146 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 514 flow [2024-10-11 14:09:59,146 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-10-11 14:09:59,146 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 46 predicate places. [2024-10-11 14:09:59,147 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 514 flow [2024-10-11 14:09:59,147 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-10-11 14:09:59,147 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:59,147 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:59,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:09:59,147 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-10-11 14:09:59,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:59,148 INFO L85 PathProgramCache]: Analyzing trace with hash 391260105, now seen corresponding path program 1 times [2024-10-11 14:09:59,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:59,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84067363] [2024-10-11 14:09:59,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:59,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:59,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:59,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84067363] [2024-10-11 14:09:59,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84067363] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:09:59,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406718052] [2024-10-11 14:09:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:59,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:59,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:59,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:09:59,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:09:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:59,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 14:09:59,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:09:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:59,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:09:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:59,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406718052] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:09:59,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:09:59,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-11 14:09:59,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131182979] [2024-10-11 14:09:59,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:09:59,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:09:59,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:59,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:09:59,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:09:59,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:09:59,571 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-10-11 14:09:59,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:59,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:09:59,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:59,932 INFO L124 PetriNetUnfolderBase]: 607/1136 cut-off events. [2024-10-11 14:09:59,932 INFO L125 PetriNetUnfolderBase]: For 10981/10993 co-relation queries the response was YES. [2024-10-11 14:09:59,935 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-10-11 14:09:59,939 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 67 selfloop transitions, 19 changer transitions 67/156 dead transitions. [2024-10-11 14:09:59,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 156 transitions, 1590 flow [2024-10-11 14:09:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 14:09:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-11 14:09:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2024-10-11 14:09:59,941 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2024-10-11 14:09:59,941 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 514 flow. Second operand 19 states and 231 transitions. [2024-10-11 14:09:59,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 156 transitions, 1590 flow [2024-10-11 14:09:59,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 156 transitions, 1489 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-10-11 14:09:59,954 INFO L231 Difference]: Finished difference. Result has 92 places, 56 transitions, 646 flow [2024-10-11 14:09:59,954 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-10-11 14:09:59,955 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 66 predicate places. [2024-10-11 14:09:59,955 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 56 transitions, 646 flow [2024-10-11 14:09:59,955 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-10-11 14:09:59,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:59,955 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:59,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:10:00,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:00,156 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-10-11 14:10:00,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash -827216793, now seen corresponding path program 2 times [2024-10-11 14:10:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:00,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081575364] [2024-10-11 14:10:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:00,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:00,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081575364] [2024-10-11 14:10:00,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081575364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:00,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463824094] [2024-10-11 14:10:00,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:10:00,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:00,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:00,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:00,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:10:00,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:10:00,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:10:00,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 14:10:00,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:00,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:00,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463824094] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:00,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:00,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-11 14:10:00,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488097774] [2024-10-11 14:10:00,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:00,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:10:00,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:00,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:10:00,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:10:00,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:00,452 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-10-11 14:10:00,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:00,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:00,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:01,017 INFO L124 PetriNetUnfolderBase]: 895/1655 cut-off events. [2024-10-11 14:10:01,017 INFO L125 PetriNetUnfolderBase]: For 37310/37322 co-relation queries the response was YES. [2024-10-11 14:10:01,023 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-10-11 14:10:01,029 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 88 selfloop transitions, 49 changer transitions 80/220 dead transitions. [2024-10-11 14:10:01,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 220 transitions, 2852 flow [2024-10-11 14:10:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 14:10:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-10-11 14:10:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 334 transitions. [2024-10-11 14:10:01,032 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-10-11 14:10:01,032 INFO L175 Difference]: Start difference. First operand has 92 places, 56 transitions, 646 flow. Second operand 27 states and 334 transitions. [2024-10-11 14:10:01,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 220 transitions, 2852 flow [2024-10-11 14:10:01,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 220 transitions, 2305 flow, removed 261 selfloop flow, removed 12 redundant places. [2024-10-11 14:10:01,062 INFO L231 Difference]: Finished difference. Result has 118 places, 72 transitions, 1051 flow [2024-10-11 14:10:01,062 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-10-11 14:10:01,063 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 92 predicate places. [2024-10-11 14:10:01,063 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 72 transitions, 1051 flow [2024-10-11 14:10:01,063 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-10-11 14:10:01,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:01,063 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:01,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 14:10:01,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:01,264 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-10-11 14:10:01,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:01,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1859448120, now seen corresponding path program 1 times [2024-10-11 14:10:01,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:01,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559412743] [2024-10-11 14:10:01,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:01,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559412743] [2024-10-11 14:10:01,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559412743] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:01,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469214086] [2024-10-11 14:10:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:01,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:01,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:01,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:01,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:10:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:01,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 14:10:01,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:01,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:01,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469214086] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:01,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:01,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-11 14:10:01,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062520750] [2024-10-11 14:10:01,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:01,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 14:10:01,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:01,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 14:10:01,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:10:01,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:01,606 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-10-11 14:10:01,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:01,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:01,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:02,231 INFO L124 PetriNetUnfolderBase]: 1129/2124 cut-off events. [2024-10-11 14:10:02,232 INFO L125 PetriNetUnfolderBase]: For 87490/87496 co-relation queries the response was YES. [2024-10-11 14:10:02,241 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-10-11 14:10:02,256 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 99 selfloop transitions, 53 changer transitions 67/222 dead transitions. [2024-10-11 14:10:02,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 222 transitions, 3667 flow [2024-10-11 14:10:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 14:10:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-10-11 14:10:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 309 transitions. [2024-10-11 14:10:02,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.515 [2024-10-11 14:10:02,258 INFO L175 Difference]: Start difference. First operand has 118 places, 72 transitions, 1051 flow. Second operand 25 states and 309 transitions. [2024-10-11 14:10:02,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 222 transitions, 3667 flow [2024-10-11 14:10:02,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 222 transitions, 3084 flow, removed 275 selfloop flow, removed 13 redundant places. [2024-10-11 14:10:02,329 INFO L231 Difference]: Finished difference. Result has 136 places, 83 transitions, 1339 flow [2024-10-11 14:10:02,330 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-10-11 14:10:02,330 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 110 predicate places. [2024-10-11 14:10:02,331 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 83 transitions, 1339 flow [2024-10-11 14:10:02,331 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-10-11 14:10:02,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:02,331 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:02,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 14:10:02,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:02,535 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-10-11 14:10:02,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2089657410, now seen corresponding path program 2 times [2024-10-11 14:10:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:02,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594314647] [2024-10-11 14:10:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:02,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:02,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:02,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594314647] [2024-10-11 14:10:02,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594314647] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:02,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839973412] [2024-10-11 14:10:02,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:10:02,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:02,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:02,624 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:02,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 14:10:02,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:10:02,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:10:02,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 14:10:02,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:02,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:02,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839973412] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:02,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:02,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-11 14:10:02,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086489442] [2024-10-11 14:10:02,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:02,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 14:10:02,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:02,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 14:10:02,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:10:02,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:02,793 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-10-11 14:10:02,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:02,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:02,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:03,529 INFO L124 PetriNetUnfolderBase]: 1246/2377 cut-off events. [2024-10-11 14:10:03,530 INFO L125 PetriNetUnfolderBase]: For 139322/139328 co-relation queries the response was YES. [2024-10-11 14:10:03,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17840 conditions, 2377 events. 1246/2377 cut-off events. For 139322/139328 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12685 event pairs, 38 based on Foata normal form. 141/2517 useless extension candidates. Maximal degree in co-relation 17775. Up to 501 conditions per place. [2024-10-11 14:10:03,547 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 92 selfloop transitions, 80 changer transitions 102/277 dead transitions. [2024-10-11 14:10:03,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 277 transitions, 5245 flow [2024-10-11 14:10:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 14:10:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-10-11 14:10:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 369 transitions. [2024-10-11 14:10:03,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5125 [2024-10-11 14:10:03,551 INFO L175 Difference]: Start difference. First operand has 136 places, 83 transitions, 1339 flow. Second operand 30 states and 369 transitions. [2024-10-11 14:10:03,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 277 transitions, 5245 flow [2024-10-11 14:10:03,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 277 transitions, 4471 flow, removed 349 selfloop flow, removed 18 redundant places. [2024-10-11 14:10:03,649 INFO L231 Difference]: Finished difference. Result has 159 places, 104 transitions, 1972 flow [2024-10-11 14:10:03,650 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=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1972, PETRI_PLACES=159, PETRI_TRANSITIONS=104} [2024-10-11 14:10:03,650 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 133 predicate places. [2024-10-11 14:10:03,651 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 104 transitions, 1972 flow [2024-10-11 14:10:03,651 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-10-11 14:10:03,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:03,651 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:03,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 14:10:03,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 14:10:03,856 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-10-11 14:10:03,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash -876448546, now seen corresponding path program 3 times [2024-10-11 14:10:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:03,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137394832] [2024-10-11 14:10:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:04,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:04,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137394832] [2024-10-11 14:10:04,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137394832] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:04,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184576068] [2024-10-11 14:10:04,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 14:10:04,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:04,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:04,004 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:04,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 14:10:04,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-11 14:10:04,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:10:04,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 14:10:04,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:04,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:04,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184576068] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:10:04,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:10:04,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2024-10-11 14:10:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645731917] [2024-10-11 14:10:04,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:10:04,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 14:10:04,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:10:04,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 14:10:04,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2024-10-11 14:10:04,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-10-11 14:10:04,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 104 transitions, 1972 flow. Second operand has 20 states, 20 states have (on average 7.2) internal successors, (144), 20 states have internal predecessors, (144), 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-10-11 14:10:04,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:10:04,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-10-11 14:10:04,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:05,311 INFO L124 PetriNetUnfolderBase]: 1462/2730 cut-off events. [2024-10-11 14:10:05,311 INFO L125 PetriNetUnfolderBase]: For 204367/204373 co-relation queries the response was YES. [2024-10-11 14:10:05,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22507 conditions, 2730 events. 1462/2730 cut-off events. For 204367/204373 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 14166 event pairs, 42 based on Foata normal form. 60/2789 useless extension candidates. Maximal degree in co-relation 22432. Up to 573 conditions per place. [2024-10-11 14:10:05,337 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 114 selfloop transitions, 102 changer transitions 91/310 dead transitions. [2024-10-11 14:10:05,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 310 transitions, 6366 flow [2024-10-11 14:10:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 14:10:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-10-11 14:10:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 417 transitions. [2024-10-11 14:10:05,339 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5110294117647058 [2024-10-11 14:10:05,340 INFO L175 Difference]: Start difference. First operand has 159 places, 104 transitions, 1972 flow. Second operand 34 states and 417 transitions. [2024-10-11 14:10:05,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 310 transitions, 6366 flow [2024-10-11 14:10:05,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 310 transitions, 5275 flow, removed 514 selfloop flow, removed 20 redundant places. [2024-10-11 14:10:05,526 INFO L231 Difference]: Finished difference. Result has 180 places, 126 transitions, 2513 flow [2024-10-11 14:10:05,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1463, 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=34, PETRI_FLOW=2513, PETRI_PLACES=180, PETRI_TRANSITIONS=126} [2024-10-11 14:10:05,528 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 154 predicate places. [2024-10-11 14:10:05,528 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 126 transitions, 2513 flow [2024-10-11 14:10:05,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.2) internal successors, (144), 20 states have internal predecessors, (144), 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-10-11 14:10:05,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:05,528 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:10:05,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 14:10:05,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 14:10:05,733 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-10-11 14:10:05,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:05,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1708128831, now seen corresponding path program 4 times [2024-10-11 14:10:05,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:05,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239524963] [2024-10-11 14:10:05,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:05,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:10:05,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:10:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:10:05,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:10:05,819 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:10:05,824 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-11 14:10:05,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-10-11 14:10:05,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-11 14:10:05,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:10:05,826 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1] [2024-10-11 14:10:05,881 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:10:05,881 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:10:05,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:10:05 BasicIcfg [2024-10-11 14:10:05,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:10:05,885 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:10:05,885 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:10:05,885 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:10:05,886 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:09:56" (3/4) ... [2024-10-11 14:10:05,886 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 14:10:05,933 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:10:05,933 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:10:05,934 INFO L158 Benchmark]: Toolchain (without parser) took 10167.72ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 96.2MB in the beginning and 173.4MB in the end (delta: -77.2MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2024-10-11 14:10:05,934 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 165.7MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:10:05,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.42ms. Allocated memory is still 165.7MB. Free memory was 95.9MB in the beginning and 128.1MB in the end (delta: -32.3MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-10-11 14:10:05,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.96ms. Allocated memory is still 165.7MB. Free memory was 128.1MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:10:05,934 INFO L158 Benchmark]: Boogie Preprocessor took 38.61ms. Allocated memory is still 165.7MB. Free memory was 126.1MB in the beginning and 124.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:10:05,934 INFO L158 Benchmark]: RCFGBuilder took 325.38ms. Allocated memory is still 165.7MB. Free memory was 124.6MB in the beginning and 106.6MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 14:10:05,934 INFO L158 Benchmark]: TraceAbstraction took 9272.57ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 105.9MB in the beginning and 181.8MB in the end (delta: -75.9MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. [2024-10-11 14:10:05,935 INFO L158 Benchmark]: Witness Printer took 48.05ms. Allocated memory is still 287.3MB. Free memory was 181.8MB in the beginning and 173.4MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 14:10:05,936 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.11ms. Allocated memory is still 165.7MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.42ms. Allocated memory is still 165.7MB. Free memory was 95.9MB in the beginning and 128.1MB in the end (delta: -32.3MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.96ms. Allocated memory is still 165.7MB. Free memory was 128.1MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.61ms. Allocated memory is still 165.7MB. Free memory was 126.1MB in the beginning and 124.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 325.38ms. Allocated memory is still 165.7MB. Free memory was 124.6MB in the beginning and 106.6MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9272.57ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 105.9MB in the beginning and 181.8MB in the end (delta: -75.9MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. * Witness Printer took 48.05ms. Allocated memory is still 287.3MB. Free memory was 181.8MB in the beginning and 173.4MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. 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 < 5 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] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L716] 0 int condI = i >= (2*5 +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=7, id1=-2, id2=-1, j=6, k=0, k=1] [L704] COND TRUE 2 k < 5 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] [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 < 5 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 < 5 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 < 5 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] [L696] COND TRUE 1 k < 5 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] [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] [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] [L704] COND TRUE 2 k < 5 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 < 5 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] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [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=4] [L719] 0 int condJ = j >= (2*5 +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=15, id1=-2, id2=-1, j=16, k=4, k=4] [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=15, id1=-2, id2=-1, j=16, k=4, k=4] [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=15, id1=-2, id2=-1, j=16, k=4, k=4] - 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: 9.1s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1774 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1746 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2947 IncrementalHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 10 mSDtfsCounter, 2947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 190 SyntacticMatches, 4 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2513occurred in iteration=11, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 1557 SizeOfPredicates, 27 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 0/126 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-10-11 14:10:05,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE