/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 07:30:27,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 07:30:27,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 07:30:27,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 07:30:27,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 07:30:27,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 07:30:27,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 07:30:27,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 07:30:27,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 07:30:27,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 07:30:27,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 07:30:27,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 07:30:27,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 07:30:27,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 07:30:27,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 07:30:27,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 07:30:27,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 07:30:27,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 07:30:27,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 07:30:27,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 07:30:27,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 07:30:27,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 07:30:27,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 07:30:27,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 07:30:27,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 07:30:27,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 07:30:27,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 07:30:27,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 07:30:27,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 07:30:27,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 07:30:27,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 07:30:27,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 07:30:27,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 07:30:27,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 07:30:27,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 07:30:27,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 07:30:27,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 07:30:27,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 07:30:27,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 07:30:27,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 07:30:27,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 07:30:27,404 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 07:30:27,428 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 07:30:27,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 07:30:27,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 07:30:27,430 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 07:30:27,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 07:30:27,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 07:30:27,430 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 07:30:27,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 07:30:27,431 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 07:30:27,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 07:30:27,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 07:30:27,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 07:30:27,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 07:30:27,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 07:30:27,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 07:30:27,432 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 07:30:27,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 07:30:27,432 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 07:30:27,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 07:30:27,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 07:30:27,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 07:30:27,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 07:30:27,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 07:30:27,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 07:30:27,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 07:30:27,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 07:30:27,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 07:30:27,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 07:30:27,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 07:30:27,434 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 07:30:27,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 07:30:27,434 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 07:30:27,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 07:30:27,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 07:30:27,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 07:30:27,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 07:30:27,677 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 07:30:27,677 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 07:30:27,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2022-01-19 07:30:27,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4555bf468/a16b15584fc24fd69ab0457fd867f98c/FLAGcf3f1a560 [2022-01-19 07:30:28,129 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 07:30:28,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2022-01-19 07:30:28,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4555bf468/a16b15584fc24fd69ab0457fd867f98c/FLAGcf3f1a560 [2022-01-19 07:30:28,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4555bf468/a16b15584fc24fd69ab0457fd867f98c [2022-01-19 07:30:28,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 07:30:28,149 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 07:30:28,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 07:30:28,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 07:30:28,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 07:30:28,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 07:30:28" (1/1) ... [2022-01-19 07:30:28,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77970cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28, skipping insertion in model container [2022-01-19 07:30:28,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 07:30:28" (1/1) ... [2022-01-19 07:30:28,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 07:30:28,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 07:30:28,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2022-01-19 07:30:28,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 07:30:28,362 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 07:30:28,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2022-01-19 07:30:28,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 07:30:28,396 INFO L208 MainTranslator]: Completed translation [2022-01-19 07:30:28,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28 WrapperNode [2022-01-19 07:30:28,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 07:30:28,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 07:30:28,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 07:30:28,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 07:30:28,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28" (1/1) ... [2022-01-19 07:30:28,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28" (1/1) ... [2022-01-19 07:30:28,442 INFO L137 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 279 [2022-01-19 07:30:28,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 07:30:28,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 07:30:28,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 07:30:28,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 07:30:28,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28" (1/1) ... [2022-01-19 07:30:28,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28" (1/1) ... [2022-01-19 07:30:28,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28" (1/1) ... [2022-01-19 07:30:28,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28" (1/1) ... [2022-01-19 07:30:28,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28" (1/1) ... [2022-01-19 07:30:28,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28" (1/1) ... [2022-01-19 07:30:28,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28" (1/1) ... [2022-01-19 07:30:28,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 07:30:28,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 07:30:28,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 07:30:28,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 07:30:28,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28" (1/1) ... [2022-01-19 07:30:28,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 07:30:28,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:30:28,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 07:30:28,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 07:30:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 07:30:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 07:30:28,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 07:30:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 07:30:28,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 07:30:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 07:30:28,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 07:30:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 07:30:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 07:30:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 07:30:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 07:30:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 07:30:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 07:30:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 07:30:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 07:30:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 07:30:28,572 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 07:30:28,648 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 07:30:28,649 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 07:30:28,962 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 07:30:29,077 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 07:30:29,077 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 07:30:29,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 07:30:29 BoogieIcfgContainer [2022-01-19 07:30:29,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 07:30:29,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 07:30:29,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 07:30:29,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 07:30:29,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 07:30:28" (1/3) ... [2022-01-19 07:30:29,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a632023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 07:30:29, skipping insertion in model container [2022-01-19 07:30:29,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:30:28" (2/3) ... [2022-01-19 07:30:29,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a632023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 07:30:29, skipping insertion in model container [2022-01-19 07:30:29,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 07:30:29" (3/3) ... [2022-01-19 07:30:29,088 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2022-01-19 07:30:29,092 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 07:30:29,092 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 07:30:29,092 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 07:30:29,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,149 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,149 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,150 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,150 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,150 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,150 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,151 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,151 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,151 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,151 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,152 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,152 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,152 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,152 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,152 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,153 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,153 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,153 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,154 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,154 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,154 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,155 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,158 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,158 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,159 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,159 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,164 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,165 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,165 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,167 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,168 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,173 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:30:29,183 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 07:30:29,244 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 07:30:29,250 INFO L339 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 07:30:29,250 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 07:30:29,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 160 places, 152 transitions, 328 flow [2022-01-19 07:30:29,345 INFO L129 PetriNetUnfolder]: 2/149 cut-off events. [2022-01-19 07:30:29,345 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 07:30:29,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 2/149 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-01-19 07:30:29,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 152 transitions, 328 flow [2022-01-19 07:30:29,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 138 transitions, 294 flow [2022-01-19 07:30:29,405 INFO L129 PetriNetUnfolder]: 2/137 cut-off events. [2022-01-19 07:30:29,405 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 07:30:29,405 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:30:29,406 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 07:30:29,406 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:30:29,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:30:29,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1657276246, now seen corresponding path program 1 times [2022-01-19 07:30:29,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:30:29,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026918139] [2022-01-19 07:30:29,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:30:29,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:30:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:30:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:30:29,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:30:29,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026918139] [2022-01-19 07:30:29,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026918139] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:30:29,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:30:29,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 07:30:29,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764452221] [2022-01-19 07:30:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:30:30,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 07:30:30,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:30:30,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 07:30:30,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-01-19 07:30:30,040 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 152 [2022-01-19 07:30:30,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 138 transitions, 294 flow. Second operand has 13 states, 13 states have (on average 101.76923076923077) internal successors, (1323), 13 states have internal predecessors, (1323), 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) [2022-01-19 07:30:30,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:30:30,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 152 [2022-01-19 07:30:30,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:30:31,504 INFO L129 PetriNetUnfolder]: 2149/5089 cut-off events. [2022-01-19 07:30:31,504 INFO L130 PetriNetUnfolder]: For 606/606 co-relation queries the response was YES. [2022-01-19 07:30:31,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9028 conditions, 5089 events. 2149/5089 cut-off events. For 606/606 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 40371 event pairs, 1260 based on Foata normal form. 7/5034 useless extension candidates. Maximal degree in co-relation 8679. Up to 1966 conditions per place. [2022-01-19 07:30:31,553 INFO L132 encePairwiseOnDemand]: 132/152 looper letters, 152 selfloop transitions, 21 changer transitions 23/281 dead transitions. [2022-01-19 07:30:31,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 281 transitions, 1026 flow [2022-01-19 07:30:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 07:30:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 07:30:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2262 transitions. [2022-01-19 07:30:31,573 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7086466165413534 [2022-01-19 07:30:31,574 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2262 transitions. [2022-01-19 07:30:31,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2262 transitions. [2022-01-19 07:30:31,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:30:31,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2262 transitions. [2022-01-19 07:30:31,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 107.71428571428571) internal successors, (2262), 21 states have internal predecessors, (2262), 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) [2022-01-19 07:30:31,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 152.0) internal successors, (3344), 22 states have internal predecessors, (3344), 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) [2022-01-19 07:30:31,602 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 152.0) internal successors, (3344), 22 states have internal predecessors, (3344), 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) [2022-01-19 07:30:31,604 INFO L186 Difference]: Start difference. First operand has 146 places, 138 transitions, 294 flow. Second operand 21 states and 2262 transitions. [2022-01-19 07:30:31,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 281 transitions, 1026 flow [2022-01-19 07:30:31,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 281 transitions, 978 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 07:30:31,620 INFO L242 Difference]: Finished difference. Result has 166 places, 150 transitions, 384 flow [2022-01-19 07:30:31,622 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=384, PETRI_PLACES=166, PETRI_TRANSITIONS=150} [2022-01-19 07:30:31,625 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 20 predicate places. [2022-01-19 07:30:31,625 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 150 transitions, 384 flow [2022-01-19 07:30:31,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 101.76923076923077) internal successors, (1323), 13 states have internal predecessors, (1323), 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) [2022-01-19 07:30:31,626 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:30:31,627 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 07:30:31,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 07:30:31,627 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:30:31,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:30:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1053824886, now seen corresponding path program 2 times [2022-01-19 07:30:31,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:30:31,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664422518] [2022-01-19 07:30:31,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:30:31,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:30:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:30:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:30:31,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:30:31,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664422518] [2022-01-19 07:30:31,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664422518] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:30:31,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:30:31,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 07:30:31,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523170264] [2022-01-19 07:30:31,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:30:31,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 07:30:31,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:30:31,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 07:30:31,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 07:30:31,836 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 152 [2022-01-19 07:30:31,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 150 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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) [2022-01-19 07:30:31,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:30:31,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 152 [2022-01-19 07:30:31,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:30:32,218 INFO L129 PetriNetUnfolder]: 1293/3268 cut-off events. [2022-01-19 07:30:32,219 INFO L130 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2022-01-19 07:30:32,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5962 conditions, 3268 events. 1293/3268 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 24843 event pairs, 840 based on Foata normal form. 68/3284 useless extension candidates. Maximal degree in co-relation 5933. Up to 1387 conditions per place. [2022-01-19 07:30:32,241 INFO L132 encePairwiseOnDemand]: 148/152 looper letters, 44 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-01-19 07:30:32,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 164 transitions, 506 flow [2022-01-19 07:30:32,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 07:30:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 07:30:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2022-01-19 07:30:32,243 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.875 [2022-01-19 07:30:32,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2022-01-19 07:30:32,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2022-01-19 07:30:32,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:30:32,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2022-01-19 07:30:32,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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) [2022-01-19 07:30:32,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 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) [2022-01-19 07:30:32,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 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) [2022-01-19 07:30:32,247 INFO L186 Difference]: Start difference. First operand has 166 places, 150 transitions, 384 flow. Second operand 3 states and 399 transitions. [2022-01-19 07:30:32,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 164 transitions, 506 flow [2022-01-19 07:30:32,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 164 transitions, 496 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-01-19 07:30:32,256 INFO L242 Difference]: Finished difference. Result has 152 places, 150 transitions, 384 flow [2022-01-19 07:30:32,256 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=152, PETRI_TRANSITIONS=150} [2022-01-19 07:30:32,257 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 6 predicate places. [2022-01-19 07:30:32,257 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 150 transitions, 384 flow [2022-01-19 07:30:32,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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) [2022-01-19 07:30:32,258 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:30:32,258 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 07:30:32,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 07:30:32,261 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:30:32,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:30:32,263 INFO L85 PathProgramCache]: Analyzing trace with hash 634887492, now seen corresponding path program 3 times [2022-01-19 07:30:32,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:30:32,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687300078] [2022-01-19 07:30:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:30:32,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:30:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:30:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:30:32,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:30:32,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687300078] [2022-01-19 07:30:32,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687300078] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:30:32,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:30:32,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 07:30:32,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671927403] [2022-01-19 07:30:32,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:30:32,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 07:30:32,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:30:32,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 07:30:32,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-01-19 07:30:32,540 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 152 [2022-01-19 07:30:32,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 150 transitions, 384 flow. Second operand has 13 states, 13 states have (on average 101.76923076923077) internal successors, (1323), 13 states have internal predecessors, (1323), 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) [2022-01-19 07:30:32,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:30:32,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 152 [2022-01-19 07:30:32,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:30:33,647 INFO L129 PetriNetUnfolder]: 2236/5812 cut-off events. [2022-01-19 07:30:33,647 INFO L130 PetriNetUnfolder]: For 843/843 co-relation queries the response was YES. [2022-01-19 07:30:33,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11275 conditions, 5812 events. 2236/5812 cut-off events. For 843/843 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 49756 event pairs, 1201 based on Foata normal form. 1/5765 useless extension candidates. Maximal degree in co-relation 8235. Up to 1905 conditions per place. [2022-01-19 07:30:33,693 INFO L132 encePairwiseOnDemand]: 136/152 looper letters, 168 selfloop transitions, 32 changer transitions 18/303 dead transitions. [2022-01-19 07:30:33,694 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 303 transitions, 1234 flow [2022-01-19 07:30:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 07:30:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 07:30:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1668 transitions. [2022-01-19 07:30:33,698 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7315789473684211 [2022-01-19 07:30:33,698 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1668 transitions. [2022-01-19 07:30:33,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1668 transitions. [2022-01-19 07:30:33,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:30:33,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1668 transitions. [2022-01-19 07:30:33,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 111.2) internal successors, (1668), 15 states have internal predecessors, (1668), 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) [2022-01-19 07:30:33,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 152.0) internal successors, (2432), 16 states have internal predecessors, (2432), 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) [2022-01-19 07:30:33,708 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 152.0) internal successors, (2432), 16 states have internal predecessors, (2432), 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) [2022-01-19 07:30:33,709 INFO L186 Difference]: Start difference. First operand has 152 places, 150 transitions, 384 flow. Second operand 15 states and 1668 transitions. [2022-01-19 07:30:33,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 303 transitions, 1234 flow [2022-01-19 07:30:33,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 303 transitions, 1230 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 07:30:33,722 INFO L242 Difference]: Finished difference. Result has 172 places, 171 transitions, 607 flow [2022-01-19 07:30:33,723 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=607, PETRI_PLACES=172, PETRI_TRANSITIONS=171} [2022-01-19 07:30:33,725 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 26 predicate places. [2022-01-19 07:30:33,725 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 171 transitions, 607 flow [2022-01-19 07:30:33,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 101.76923076923077) internal successors, (1323), 13 states have internal predecessors, (1323), 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) [2022-01-19 07:30:33,726 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:30:33,726 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 07:30:33,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 07:30:33,726 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:30:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:30:33,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1266518126, now seen corresponding path program 4 times [2022-01-19 07:30:33,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:30:33,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41363220] [2022-01-19 07:30:33,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:30:33,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:30:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:30:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:30:34,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:30:34,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41363220] [2022-01-19 07:30:34,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41363220] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:30:34,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:30:34,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-19 07:30:34,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665147753] [2022-01-19 07:30:34,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:30:34,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 07:30:34,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:30:34,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 07:30:34,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-01-19 07:30:34,065 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 152 [2022-01-19 07:30:34,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 171 transitions, 607 flow. Second operand has 14 states, 14 states have (on average 106.14285714285714) internal successors, (1486), 14 states have internal predecessors, (1486), 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) [2022-01-19 07:30:34,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:30:34,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 152 [2022-01-19 07:30:34,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:30:37,243 INFO L129 PetriNetUnfolder]: 10384/23605 cut-off events. [2022-01-19 07:30:37,243 INFO L130 PetriNetUnfolder]: For 5231/5382 co-relation queries the response was YES. [2022-01-19 07:30:37,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49692 conditions, 23605 events. 10384/23605 cut-off events. For 5231/5382 co-relation queries the response was YES. Maximal size of possible extension queue 1084. Compared 249678 event pairs, 1944 based on Foata normal form. 286/23094 useless extension candidates. Maximal degree in co-relation 49606. Up to 4344 conditions per place. [2022-01-19 07:30:37,537 INFO L132 encePairwiseOnDemand]: 131/152 looper letters, 286 selfloop transitions, 89 changer transitions 2/504 dead transitions. [2022-01-19 07:30:37,537 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 504 transitions, 2106 flow [2022-01-19 07:30:37,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 07:30:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 07:30:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2962 transitions. [2022-01-19 07:30:37,544 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7794736842105263 [2022-01-19 07:30:37,544 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2962 transitions. [2022-01-19 07:30:37,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2962 transitions. [2022-01-19 07:30:37,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:30:37,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2962 transitions. [2022-01-19 07:30:37,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 118.48) internal successors, (2962), 25 states have internal predecessors, (2962), 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) [2022-01-19 07:30:37,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 152.0) internal successors, (3952), 26 states have internal predecessors, (3952), 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) [2022-01-19 07:30:37,558 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 152.0) internal successors, (3952), 26 states have internal predecessors, (3952), 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) [2022-01-19 07:30:37,559 INFO L186 Difference]: Start difference. First operand has 172 places, 171 transitions, 607 flow. Second operand 25 states and 2962 transitions. [2022-01-19 07:30:37,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 504 transitions, 2106 flow [2022-01-19 07:30:37,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 504 transitions, 2092 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-01-19 07:30:37,691 INFO L242 Difference]: Finished difference. Result has 199 places, 270 transitions, 1147 flow [2022-01-19 07:30:37,691 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1147, PETRI_PLACES=199, PETRI_TRANSITIONS=270} [2022-01-19 07:30:37,693 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 53 predicate places. [2022-01-19 07:30:37,693 INFO L470 AbstractCegarLoop]: Abstraction has has 199 places, 270 transitions, 1147 flow [2022-01-19 07:30:37,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 106.14285714285714) internal successors, (1486), 14 states have internal predecessors, (1486), 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) [2022-01-19 07:30:37,694 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:30:37,694 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 07:30:37,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 07:30:37,694 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:30:37,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:30:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1800167218, now seen corresponding path program 5 times [2022-01-19 07:30:37,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:30:37,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765220348] [2022-01-19 07:30:37,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:30:37,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:30:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:30:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:30:37,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:30:37,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765220348] [2022-01-19 07:30:37,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765220348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:30:37,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:30:37,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 07:30:37,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986492785] [2022-01-19 07:30:37,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:30:37,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 07:30:37,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:30:37,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 07:30:37,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-19 07:30:37,965 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 152 [2022-01-19 07:30:37,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 270 transitions, 1147 flow. Second operand has 12 states, 12 states have (on average 115.08333333333333) internal successors, (1381), 12 states have internal predecessors, (1381), 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) [2022-01-19 07:30:37,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:30:37,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 152 [2022-01-19 07:30:37,966 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:30:42,768 INFO L129 PetriNetUnfolder]: 16415/40853 cut-off events. [2022-01-19 07:30:42,768 INFO L130 PetriNetUnfolder]: For 41824/42646 co-relation queries the response was YES. [2022-01-19 07:30:43,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110150 conditions, 40853 events. 16415/40853 cut-off events. For 41824/42646 co-relation queries the response was YES. Maximal size of possible extension queue 2185. Compared 498653 event pairs, 4115 based on Foata normal form. 315/40062 useless extension candidates. Maximal degree in co-relation 103631. Up to 9214 conditions per place. [2022-01-19 07:30:43,323 INFO L132 encePairwiseOnDemand]: 136/152 looper letters, 358 selfloop transitions, 123 changer transitions 41/656 dead transitions. [2022-01-19 07:30:43,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 656 transitions, 3957 flow [2022-01-19 07:30:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 07:30:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 07:30:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2063 transitions. [2022-01-19 07:30:43,328 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8482730263157895 [2022-01-19 07:30:43,329 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2063 transitions. [2022-01-19 07:30:43,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2063 transitions. [2022-01-19 07:30:43,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:30:43,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2063 transitions. [2022-01-19 07:30:43,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 128.9375) internal successors, (2063), 16 states have internal predecessors, (2063), 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) [2022-01-19 07:30:43,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 152.0) internal successors, (2584), 17 states have internal predecessors, (2584), 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) [2022-01-19 07:30:43,338 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 152.0) internal successors, (2584), 17 states have internal predecessors, (2584), 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) [2022-01-19 07:30:43,338 INFO L186 Difference]: Start difference. First operand has 199 places, 270 transitions, 1147 flow. Second operand 16 states and 2063 transitions. [2022-01-19 07:30:43,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 656 transitions, 3957 flow [2022-01-19 07:30:44,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 656 transitions, 3950 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 07:30:44,063 INFO L242 Difference]: Finished difference. Result has 224 places, 372 transitions, 2217 flow [2022-01-19 07:30:44,063 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2217, PETRI_PLACES=224, PETRI_TRANSITIONS=372} [2022-01-19 07:30:44,064 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 78 predicate places. [2022-01-19 07:30:44,064 INFO L470 AbstractCegarLoop]: Abstraction has has 224 places, 372 transitions, 2217 flow [2022-01-19 07:30:44,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 115.08333333333333) internal successors, (1381), 12 states have internal predecessors, (1381), 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) [2022-01-19 07:30:44,065 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:30:44,065 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 07:30:44,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 07:30:44,065 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:30:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:30:44,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2105957626, now seen corresponding path program 6 times [2022-01-19 07:30:44,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:30:44,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218086965] [2022-01-19 07:30:44,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:30:44,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:30:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:30:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:30:44,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:30:44,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218086965] [2022-01-19 07:30:44,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218086965] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:30:44,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:30:44,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 07:30:44,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433115221] [2022-01-19 07:30:44,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:30:44,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 07:30:44,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:30:44,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 07:30:44,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-19 07:30:44,251 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 152 [2022-01-19 07:30:44,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 372 transitions, 2217 flow. Second operand has 11 states, 11 states have (on average 115.36363636363636) internal successors, (1269), 11 states have internal predecessors, (1269), 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) [2022-01-19 07:30:44,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:30:44,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 152 [2022-01-19 07:30:44,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:30:54,280 INFO L129 PetriNetUnfolder]: 31070/73459 cut-off events. [2022-01-19 07:30:54,281 INFO L130 PetriNetUnfolder]: For 185591/188525 co-relation queries the response was YES. [2022-01-19 07:30:54,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 245232 conditions, 73459 events. 31070/73459 cut-off events. For 185591/188525 co-relation queries the response was YES. Maximal size of possible extension queue 4154. Compared 943865 event pairs, 9773 based on Foata normal form. 777/71882 useless extension candidates. Maximal degree in co-relation 230635. Up to 26591 conditions per place. [2022-01-19 07:30:55,367 INFO L132 encePairwiseOnDemand]: 136/152 looper letters, 465 selfloop transitions, 264 changer transitions 18/881 dead transitions. [2022-01-19 07:30:55,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 881 transitions, 7270 flow [2022-01-19 07:30:55,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 07:30:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 07:30:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2056 transitions. [2022-01-19 07:30:55,372 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8453947368421053 [2022-01-19 07:30:55,372 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2056 transitions. [2022-01-19 07:30:55,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2056 transitions. [2022-01-19 07:30:55,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:30:55,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2056 transitions. [2022-01-19 07:30:55,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 128.5) internal successors, (2056), 16 states have internal predecessors, (2056), 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) [2022-01-19 07:30:55,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 152.0) internal successors, (2584), 17 states have internal predecessors, (2584), 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) [2022-01-19 07:30:55,391 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 152.0) internal successors, (2584), 17 states have internal predecessors, (2584), 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) [2022-01-19 07:30:55,392 INFO L186 Difference]: Start difference. First operand has 224 places, 372 transitions, 2217 flow. Second operand 16 states and 2056 transitions. [2022-01-19 07:30:55,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 881 transitions, 7270 flow [2022-01-19 07:30:59,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 881 transitions, 7138 flow, removed 66 selfloop flow, removed 2 redundant places. [2022-01-19 07:30:59,592 INFO L242 Difference]: Finished difference. Result has 248 places, 620 transitions, 5225 flow [2022-01-19 07:30:59,593 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2179, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5225, PETRI_PLACES=248, PETRI_TRANSITIONS=620} [2022-01-19 07:30:59,594 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 102 predicate places. [2022-01-19 07:30:59,594 INFO L470 AbstractCegarLoop]: Abstraction has has 248 places, 620 transitions, 5225 flow [2022-01-19 07:30:59,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 115.36363636363636) internal successors, (1269), 11 states have internal predecessors, (1269), 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) [2022-01-19 07:30:59,595 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:30:59,595 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 07:30:59,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 07:30:59,595 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:30:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:30:59,596 INFO L85 PathProgramCache]: Analyzing trace with hash -238010836, now seen corresponding path program 7 times [2022-01-19 07:30:59,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:30:59,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745223395] [2022-01-19 07:30:59,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:30:59,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:30:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:30:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:30:59,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:30:59,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745223395] [2022-01-19 07:30:59,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745223395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:30:59,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:30:59,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 07:30:59,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456552426] [2022-01-19 07:30:59,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:30:59,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 07:30:59,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:30:59,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 07:30:59,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-01-19 07:30:59,838 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 152 [2022-01-19 07:30:59,839 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 620 transitions, 5225 flow. Second operand has 13 states, 13 states have (on average 101.76923076923077) internal successors, (1323), 13 states have internal predecessors, (1323), 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) [2022-01-19 07:30:59,839 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:30:59,839 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 152 [2022-01-19 07:30:59,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:31:19,742 INFO L129 PetriNetUnfolder]: 50874/106687 cut-off events. [2022-01-19 07:31:19,743 INFO L130 PetriNetUnfolder]: For 388048/389539 co-relation queries the response was YES. [2022-01-19 07:31:20,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 407075 conditions, 106687 events. 50874/106687 cut-off events. For 388048/389539 co-relation queries the response was YES. Maximal size of possible extension queue 4571. Compared 1304855 event pairs, 14594 based on Foata normal form. 540/106069 useless extension candidates. Maximal degree in co-relation 391052. Up to 24183 conditions per place. [2022-01-19 07:31:21,467 INFO L132 encePairwiseOnDemand]: 136/152 looper letters, 780 selfloop transitions, 37 changer transitions 66/1180 dead transitions. [2022-01-19 07:31:21,467 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 1180 transitions, 11935 flow [2022-01-19 07:31:21,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 07:31:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 07:31:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1666 transitions. [2022-01-19 07:31:21,472 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.730701754385965 [2022-01-19 07:31:21,472 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1666 transitions. [2022-01-19 07:31:21,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1666 transitions. [2022-01-19 07:31:21,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:31:21,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1666 transitions. [2022-01-19 07:31:21,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 111.06666666666666) internal successors, (1666), 15 states have internal predecessors, (1666), 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) [2022-01-19 07:31:21,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 152.0) internal successors, (2432), 16 states have internal predecessors, (2432), 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) [2022-01-19 07:31:21,482 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 152.0) internal successors, (2432), 16 states have internal predecessors, (2432), 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) [2022-01-19 07:31:21,482 INFO L186 Difference]: Start difference. First operand has 248 places, 620 transitions, 5225 flow. Second operand 15 states and 1666 transitions. [2022-01-19 07:31:21,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 1180 transitions, 11935 flow [2022-01-19 07:31:32,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 1180 transitions, 11747 flow, removed 94 selfloop flow, removed 0 redundant places. [2022-01-19 07:31:32,880 INFO L242 Difference]: Finished difference. Result has 268 places, 625 transitions, 5274 flow [2022-01-19 07:31:32,880 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=5141, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5274, PETRI_PLACES=268, PETRI_TRANSITIONS=625} [2022-01-19 07:31:32,881 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 122 predicate places. [2022-01-19 07:31:32,881 INFO L470 AbstractCegarLoop]: Abstraction has has 268 places, 625 transitions, 5274 flow [2022-01-19 07:31:32,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 101.76923076923077) internal successors, (1323), 13 states have internal predecessors, (1323), 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) [2022-01-19 07:31:32,882 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:31:32,882 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 07:31:32,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 07:31:32,882 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:31:32,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:31:32,883 INFO L85 PathProgramCache]: Analyzing trace with hash 527756660, now seen corresponding path program 8 times [2022-01-19 07:31:32,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:31:32,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253977642] [2022-01-19 07:31:32,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:31:32,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:31:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:31:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:31:32,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:31:32,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253977642] [2022-01-19 07:31:32,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253977642] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:31:32,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:31:32,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 07:31:32,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469705702] [2022-01-19 07:31:32,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:31:32,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 07:31:32,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:31:32,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 07:31:32,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 07:31:32,938 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 152 [2022-01-19 07:31:32,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 625 transitions, 5274 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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) [2022-01-19 07:31:32,939 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:31:32,939 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 152 [2022-01-19 07:31:32,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:31:40,996 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L152-->L155: Formula: (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| (ite (not (and (not (= v_~n2~0_89 0)) (or (< v_~n2~0_89 v_~n3~0_93) (= v_~n2~0_89 v_~n3~0_93)))) 1 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0))) InVars {~n2~0=v_~n2~0_89, ~n3~0=v_~n3~0_93} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_89, ~n3~0=v_~n3~0_93, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1][198], [Black: 361#(<= ~n2~0 ~n1~0), Black: 242#(and (<= ~i~0 2) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 362#(and (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 366#(and (<= ~n3~0 ~n2~0) (<= 1 ~n3~0)), Black: 238#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), Black: 246#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0)), Black: 373#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 363#(and (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 364#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 223#(and (<= ~i~0 0) (<= 0 ~i~0)), Black: 381#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 367#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0)), Black: 371#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 379#(and (<= 1 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 375#(and (<= 1 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 365#(<= 1 ~n3~0), 80#L79true, 53#L155true, 219#true, Black: 427#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 425#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3)), 40#L122true, Black: 421#(and (<= 1 ~i3~0) (<= ~i3~0 1) (<= 0 ~i1~0) (<= ~i1~0 0)), Black: 415#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), Black: 419#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= ~i1~0 0) (<= 2 ~i~0)), Black: 429#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 281#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 289#(and (<= (+ ~n1~0 1) ~n2~0) (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 299#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 291#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n1~0 ~n2~0)), Black: 269#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 274#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 275#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 267#(and (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 279#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 305#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n1~0)), 163#true, Black: 307#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 285#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), 42#L190-4true, Black: 184#(and (<= 1 ~i~0) (<= 0 ~i3~0) (<= ~i~0 1) (<= ~i3~0 0)), Black: 188#(and (<= ~i~0 2) (<= ~i1~0 1) (<= 0 ~i3~0) (<= 1 ~i1~0) (<= ~i3~0 0) (<= 2 ~i~0)), Black: 167#(and (<= ~i~0 0) (<= 0 ~i~0)), Black: 326#(and (<= 0 ~n3~0) (= ~n1~0 0)), Black: 216#(= (+ (- 1) ~e3~0) 0), Black: 338#(and (<= (+ ~n3~0 1) ~n2~0) (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 336#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0)), 327#(and (<= 0 ~n3~0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 323#(<= ~n3~0 ~n1~0), Black: 328#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 325#(<= 0 ~n3~0), Black: 344#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), 437#true, Black: 329#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 324#(<= (+ ~n3~0 1) ~n1~0), Black: 340#(and (<= ~n3~0 ~n2~0) (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), 266#(<= 0 ~n3~0), 396#true, Black: 369#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), Black: 224#(and (<= 0 ~i1~0) (<= ~i1~0 0))]) [2022-01-19 07:31:40,997 INFO L384 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2022-01-19 07:31:40,997 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-01-19 07:31:40,997 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-01-19 07:31:40,997 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,123 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L152-->L155: Formula: (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| (ite (not (and (not (= v_~n2~0_89 0)) (or (< v_~n2~0_89 v_~n3~0_93) (= v_~n2~0_89 v_~n3~0_93)))) 1 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0))) InVars {~n2~0=v_~n2~0_89, ~n3~0=v_~n3~0_93} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_89, ~n3~0=v_~n3~0_93, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1][198], [Black: 361#(<= ~n2~0 ~n1~0), Black: 242#(and (<= ~i~0 2) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 362#(and (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 238#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), Black: 366#(and (<= ~n3~0 ~n2~0) (<= 1 ~n3~0)), Black: 246#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0)), Black: 373#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 363#(and (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 364#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 223#(and (<= ~i~0 0) (<= 0 ~i~0)), 359#true, Black: 365#(<= 1 ~n3~0), Black: 381#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 367#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0)), Black: 371#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 379#(and (<= 1 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 375#(and (<= 1 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 80#L79true, 53#L155true, Black: 427#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 425#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3)), Black: 421#(and (<= 1 ~i3~0) (<= ~i3~0 1) (<= 0 ~i1~0) (<= ~i1~0 0)), 40#L122true, Black: 415#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), Black: 419#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= ~i1~0 0) (<= 2 ~i~0)), Black: 429#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 281#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 289#(and (<= (+ ~n1~0 1) ~n2~0) (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 299#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 291#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n1~0 ~n2~0)), Black: 269#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 274#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 275#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 267#(and (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 279#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), 163#true, Black: 305#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 307#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 285#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), 42#L190-4true, Black: 184#(and (<= 1 ~i~0) (<= 0 ~i3~0) (<= ~i~0 1) (<= ~i3~0 0)), Black: 188#(and (<= ~i~0 2) (<= ~i1~0 1) (<= 0 ~i3~0) (<= 1 ~i1~0) (<= ~i3~0 0) (<= 2 ~i~0)), Black: 167#(and (<= ~i~0 0) (<= 0 ~i~0)), Black: 216#(= (+ (- 1) ~e3~0) 0), Black: 326#(and (<= 0 ~n3~0) (= ~n1~0 0)), Black: 338#(and (<= (+ ~n3~0 1) ~n2~0) (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 336#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0)), 327#(and (<= 0 ~n3~0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 323#(<= ~n3~0 ~n1~0), Black: 328#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 325#(<= 0 ~n3~0), Black: 344#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), 437#true, Black: 329#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 324#(<= (+ ~n3~0 1) ~n1~0), Black: 340#(and (<= ~n3~0 ~n2~0) (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), 224#(and (<= 0 ~i1~0) (<= ~i1~0 0)), 266#(<= 0 ~n3~0), 401#(and (<= 0 ~i1~0) (<= ~i1~0 0)), Black: 369#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0))]) [2022-01-19 07:31:41,123 INFO L384 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,123 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,123 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,123 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,129 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L152-->L155: Formula: (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| (ite (not (and (not (= v_~n2~0_89 0)) (or (< v_~n2~0_89 v_~n3~0_93) (= v_~n2~0_89 v_~n3~0_93)))) 1 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0))) InVars {~n2~0=v_~n2~0_89, ~n3~0=v_~n3~0_93} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_89, ~n3~0=v_~n3~0_93, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1][198], [Black: 361#(<= ~n2~0 ~n1~0), Black: 242#(and (<= ~i~0 2) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 362#(and (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 366#(and (<= ~n3~0 ~n2~0) (<= 1 ~n3~0)), Black: 246#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0)), Black: 373#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 363#(and (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 364#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 223#(and (<= ~i~0 0) (<= 0 ~i~0)), 359#true, Black: 365#(<= 1 ~n3~0), Black: 381#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 367#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0)), Black: 371#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 379#(and (<= 1 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 375#(and (<= 1 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 415#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), 80#L79true, 53#L155true, Black: 427#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 425#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3)), Black: 421#(and (<= 1 ~i3~0) (<= ~i3~0 1) (<= 0 ~i1~0) (<= ~i1~0 0)), 40#L122true, Black: 419#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= ~i1~0 0) (<= 2 ~i~0)), Black: 429#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 281#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 289#(and (<= (+ ~n1~0 1) ~n2~0) (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 299#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 291#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n1~0 ~n2~0)), Black: 269#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 274#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 275#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), 238#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), Black: 267#(and (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 279#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 305#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n1~0)), 163#true, Black: 307#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 285#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), 42#L190-4true, Black: 184#(and (<= 1 ~i~0) (<= 0 ~i3~0) (<= ~i~0 1) (<= ~i3~0 0)), Black: 188#(and (<= ~i~0 2) (<= ~i1~0 1) (<= 0 ~i3~0) (<= 1 ~i1~0) (<= ~i3~0 0) (<= 2 ~i~0)), Black: 167#(and (<= ~i~0 0) (<= 0 ~i~0)), Black: 326#(and (<= 0 ~n3~0) (= ~n1~0 0)), Black: 216#(= (+ (- 1) ~e3~0) 0), Black: 338#(and (<= (+ ~n3~0 1) ~n2~0) (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 336#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0)), 327#(and (<= 0 ~n3~0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 323#(<= ~n3~0 ~n1~0), Black: 328#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 325#(<= 0 ~n3~0), 437#true, Black: 344#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 329#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 324#(<= (+ ~n3~0 1) ~n1~0), Black: 340#(and (<= ~n3~0 ~n2~0) (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), 266#(<= 0 ~n3~0), Black: 369#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), Black: 224#(and (<= 0 ~i1~0) (<= ~i1~0 0))]) [2022-01-19 07:31:41,129 INFO L384 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,129 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,129 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,129 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,134 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L152-->L155: Formula: (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| (ite (not (and (not (= v_~n2~0_89 0)) (or (< v_~n2~0_89 v_~n3~0_93) (= v_~n2~0_89 v_~n3~0_93)))) 1 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0))) InVars {~n2~0=v_~n2~0_89, ~n3~0=v_~n3~0_93} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_89, ~n3~0=v_~n3~0_93, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1][198], [Black: 361#(<= ~n2~0 ~n1~0), Black: 242#(and (<= ~i~0 2) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 362#(and (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 238#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), Black: 366#(and (<= ~n3~0 ~n2~0) (<= 1 ~n3~0)), Black: 246#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0)), Black: 373#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 363#(and (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 364#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 223#(and (<= ~i~0 0) (<= 0 ~i~0)), 359#true, Black: 365#(<= 1 ~n3~0), Black: 381#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 367#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0)), Black: 371#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 379#(and (<= 1 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 375#(and (<= 1 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 80#L79true, 53#L155true, 219#true, Black: 427#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 425#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3)), Black: 421#(and (<= 1 ~i3~0) (<= ~i3~0 1) (<= 0 ~i1~0) (<= ~i1~0 0)), 40#L122true, Black: 415#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), Black: 419#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= ~i1~0 0) (<= 2 ~i~0)), Black: 429#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 281#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 289#(and (<= (+ ~n1~0 1) ~n2~0) (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 299#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 291#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n1~0 ~n2~0)), Black: 269#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 274#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 275#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 267#(and (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 279#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 305#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n1~0)), 163#true, Black: 307#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 285#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), 42#L190-4true, Black: 184#(and (<= 1 ~i~0) (<= 0 ~i3~0) (<= ~i~0 1) (<= ~i3~0 0)), Black: 188#(and (<= ~i~0 2) (<= ~i1~0 1) (<= 0 ~i3~0) (<= 1 ~i1~0) (<= ~i3~0 0) (<= 2 ~i~0)), Black: 167#(and (<= ~i~0 0) (<= 0 ~i~0)), Black: 216#(= (+ (- 1) ~e3~0) 0), Black: 326#(and (<= 0 ~n3~0) (= ~n1~0 0)), Black: 338#(and (<= (+ ~n3~0 1) ~n2~0) (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 336#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0)), Black: 323#(<= ~n3~0 ~n1~0), 327#(and (<= 0 ~n3~0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 328#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 325#(<= 0 ~n3~0), Black: 344#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), 437#true, Black: 329#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 324#(<= (+ ~n3~0 1) ~n1~0), Black: 340#(and (<= ~n3~0 ~n2~0) (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), 266#(<= 0 ~n3~0), 396#true, Black: 369#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0)), Black: 224#(and (<= 0 ~i1~0) (<= ~i1~0 0))]) [2022-01-19 07:31:41,134 INFO L384 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,134 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,134 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,134 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-01-19 07:31:41,255 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L152-->L155: Formula: (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| (ite (not (and (not (= v_~n2~0_89 0)) (or (< v_~n2~0_89 v_~n3~0_93) (= v_~n2~0_89 v_~n3~0_93)))) 1 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0))) InVars {~n2~0=v_~n2~0_89, ~n3~0=v_~n3~0_93} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_89, ~n3~0=v_~n3~0_93, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1][198], [Black: 361#(<= ~n2~0 ~n1~0), Black: 242#(and (<= ~i~0 2) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 362#(and (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 238#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), Black: 366#(and (<= ~n3~0 ~n2~0) (<= 1 ~n3~0)), Black: 373#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 246#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0)), Black: 363#(and (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 223#(and (<= ~i~0 0) (<= 0 ~i~0)), Black: 364#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 381#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 367#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0)), Black: 371#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 379#(and (<= 1 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 375#(and (<= 1 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 365#(<= 1 ~n3~0), 80#L79true, 53#L155true, Black: 427#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 425#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3)), Black: 421#(and (<= 1 ~i3~0) (<= ~i3~0 1) (<= 0 ~i1~0) (<= ~i1~0 0)), 40#L122true, Black: 415#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), Black: 419#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= ~i1~0 0) (<= 2 ~i~0)), Black: 429#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 281#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 289#(and (<= (+ ~n1~0 1) ~n2~0) (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 299#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 291#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n1~0 ~n2~0)), Black: 269#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 274#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 275#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 267#(and (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 279#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), 163#true, Black: 305#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 307#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 285#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), 42#L190-4true, Black: 184#(and (<= 1 ~i~0) (<= 0 ~i3~0) (<= ~i~0 1) (<= ~i3~0 0)), Black: 188#(and (<= ~i~0 2) (<= ~i1~0 1) (<= 0 ~i3~0) (<= 1 ~i1~0) (<= ~i3~0 0) (<= 2 ~i~0)), Black: 167#(and (<= ~i~0 0) (<= 0 ~i~0)), Black: 216#(= (+ (- 1) ~e3~0) 0), Black: 326#(and (<= 0 ~n3~0) (= ~n1~0 0)), Black: 338#(and (<= (+ ~n3~0 1) ~n2~0) (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 336#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0)), 327#(and (<= 0 ~n3~0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 323#(<= ~n3~0 ~n1~0), Black: 328#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 325#(<= 0 ~n3~0), Black: 344#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), 437#true, Black: 329#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 324#(<= (+ ~n3~0 1) ~n1~0), Black: 340#(and (<= ~n3~0 ~n2~0) (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), 224#(and (<= 0 ~i1~0) (<= ~i1~0 0)), 266#(<= 0 ~n3~0), 401#(and (<= 0 ~i1~0) (<= ~i1~0 0)), Black: 369#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0))]) [2022-01-19 07:31:41,256 INFO L384 tUnfolder$Statistics]: this new event has 107 ancestors and is not cut-off event [2022-01-19 07:31:41,256 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is not cut-off event [2022-01-19 07:31:41,256 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is not cut-off event [2022-01-19 07:31:41,256 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is not cut-off event [2022-01-19 07:31:41,269 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L152-->L155: Formula: (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| (ite (not (and (not (= v_~n2~0_89 0)) (or (< v_~n2~0_89 v_~n3~0_93) (= v_~n2~0_89 v_~n3~0_93)))) 1 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0))) InVars {~n2~0=v_~n2~0_89, ~n3~0=v_~n3~0_93} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_89, ~n3~0=v_~n3~0_93, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1][198], [Black: 361#(<= ~n2~0 ~n1~0), Black: 242#(and (<= ~i~0 2) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 362#(and (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 366#(and (<= ~n3~0 ~n2~0) (<= 1 ~n3~0)), Black: 373#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 246#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0)), Black: 363#(and (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 223#(and (<= ~i~0 0) (<= 0 ~i~0)), Black: 364#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 381#(and (<= ~n3~0 ~n2~0) (<= 2 ~n2~0) (<= ~n2~0 ~n3~0)), Black: 367#(and (<= 1 ~n3~0) (<= (+ ~n3~0 1) ~n2~0)), Black: 371#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 379#(and (<= 1 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 375#(and (<= 1 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 365#(<= 1 ~n3~0), 415#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), 80#L79true, 53#L155true, Black: 427#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 425#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3)), 40#L122true, Black: 421#(and (<= 1 ~i3~0) (<= ~i3~0 1) (<= 0 ~i1~0) (<= ~i1~0 0)), Black: 419#(and (<= 1 ~i3~0) (<= ~i~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= ~i1~0 0) (<= 2 ~i~0)), Black: 429#(and (< 2 ~i~0) (<= 1 ~i3~0) (<= ~i2~0 2) (<= ~i3~0 1) (<= 0 ~i1~0) (<= 2 ~i2~0) (<= ~i1~0 0) (<= ~i~0 3) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 281#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n2~0 ~n1~0)), Black: 289#(and (<= (+ ~n1~0 1) ~n2~0) (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 299#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 291#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n1~0 ~n2~0)), Black: 269#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 274#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0)), 238#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), Black: 275#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 267#(and (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 279#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (<= ~n2~0 ~n1~0)), 163#true, Black: 305#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 307#(and (<= 1 ~n2~0) (<= ~n2~0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 285#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n1~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), 42#L190-4true, Black: 184#(and (<= 1 ~i~0) (<= 0 ~i3~0) (<= ~i~0 1) (<= ~i3~0 0)), Black: 188#(and (<= ~i~0 2) (<= ~i1~0 1) (<= 0 ~i3~0) (<= 1 ~i1~0) (<= ~i3~0 0) (<= 2 ~i~0)), Black: 167#(and (<= ~i~0 0) (<= 0 ~i~0)), Black: 216#(= (+ (- 1) ~e3~0) 0), Black: 326#(and (<= 0 ~n3~0) (= ~n1~0 0)), Black: 338#(and (<= (+ ~n3~0 1) ~n2~0) (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 336#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0)), 327#(and (<= 0 ~n3~0) (<= ~n1~0 ~n2~0) (= ~n1~0 0)), Black: 323#(<= ~n3~0 ~n1~0), Black: 328#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 325#(<= 0 ~n3~0), 437#true, Black: 344#(and (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 329#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 324#(<= (+ ~n3~0 1) ~n1~0), Black: 340#(and (<= ~n3~0 ~n2~0) (<= ~n3~0 ~n1~0) (<= 0 ~n3~0) (= ~n1~0 0)), 266#(<= 0 ~n3~0), Black: 224#(and (<= 0 ~i1~0) (<= ~i1~0 0)), Black: 369#(and (<= (+ ~n2~0 1) ~n3~0) (<= 2 ~n2~0))]) [2022-01-19 07:31:41,269 INFO L384 tUnfolder$Statistics]: this new event has 107 ancestors and is not cut-off event [2022-01-19 07:31:41,269 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is not cut-off event [2022-01-19 07:31:41,269 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is not cut-off event [2022-01-19 07:31:41,269 INFO L387 tUnfolder$Statistics]: existing Event has 107 ancestors and is not cut-off event [2022-01-19 07:31:43,362 INFO L129 PetriNetUnfolder]: 23285/62398 cut-off events. [2022-01-19 07:31:43,362 INFO L130 PetriNetUnfolder]: For 221438/223952 co-relation queries the response was YES. [2022-01-19 07:31:44,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 233562 conditions, 62398 events. 23285/62398 cut-off events. For 221438/223952 co-relation queries the response was YES. Maximal size of possible extension queue 3545. Compared 848549 event pairs, 11559 based on Foata normal form. 1161/61925 useless extension candidates. Maximal degree in co-relation 233184. Up to 25633 conditions per place. [2022-01-19 07:31:44,316 INFO L132 encePairwiseOnDemand]: 148/152 looper letters, 351 selfloop transitions, 2 changer transitions 2/708 dead transitions. [2022-01-19 07:31:44,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 708 transitions, 6755 flow [2022-01-19 07:31:44,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 07:31:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 07:31:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2022-01-19 07:31:44,318 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.875 [2022-01-19 07:31:44,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2022-01-19 07:31:44,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2022-01-19 07:31:44,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:31:44,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2022-01-19 07:31:44,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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) [2022-01-19 07:31:44,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 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) [2022-01-19 07:31:44,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 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) [2022-01-19 07:31:44,320 INFO L186 Difference]: Start difference. First operand has 268 places, 625 transitions, 5274 flow. Second operand 3 states and 399 transitions. [2022-01-19 07:31:44,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 708 transitions, 6755 flow [2022-01-19 07:31:49,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 708 transitions, 6698 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-01-19 07:31:49,871 INFO L242 Difference]: Finished difference. Result has 262 places, 620 transitions, 5181 flow [2022-01-19 07:31:49,872 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=5199, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5181, PETRI_PLACES=262, PETRI_TRANSITIONS=620} [2022-01-19 07:31:49,872 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 116 predicate places. [2022-01-19 07:31:49,872 INFO L470 AbstractCegarLoop]: Abstraction has has 262 places, 620 transitions, 5181 flow [2022-01-19 07:31:49,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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) [2022-01-19 07:31:49,873 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:31:49,873 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 07:31:49,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 07:31:49,873 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:31:49,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:31:49,873 INFO L85 PathProgramCache]: Analyzing trace with hash 633494030, now seen corresponding path program 9 times [2022-01-19 07:31:49,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:31:49,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682115094] [2022-01-19 07:31:49,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:31:49,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:31:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:31:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:31:49,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:31:49,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682115094] [2022-01-19 07:31:49,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682115094] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:31:49,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:31:49,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 07:31:49,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817141820] [2022-01-19 07:31:49,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:31:49,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 07:31:49,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:31:49,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 07:31:49,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-19 07:31:49,977 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 152 [2022-01-19 07:31:49,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 620 transitions, 5181 flow. Second operand has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 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) [2022-01-19 07:31:49,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:31:49,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 152 [2022-01-19 07:31:49,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:32:08,507 INFO L129 PetriNetUnfolder]: 45615/111226 cut-off events. [2022-01-19 07:32:08,507 INFO L130 PetriNetUnfolder]: For 447466/455576 co-relation queries the response was YES. [2022-01-19 07:32:09,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 436505 conditions, 111226 events. 45615/111226 cut-off events. For 447466/455576 co-relation queries the response was YES. Maximal size of possible extension queue 5939. Compared 1527477 event pairs, 14210 based on Foata normal form. 2037/110511 useless extension candidates. Maximal degree in co-relation 432880. Up to 42794 conditions per place. [2022-01-19 07:32:10,524 INFO L132 encePairwiseOnDemand]: 142/152 looper letters, 571 selfloop transitions, 302 changer transitions 16/1030 dead transitions. [2022-01-19 07:32:10,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1030 transitions, 10698 flow [2022-01-19 07:32:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 07:32:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 07:32:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1017 transitions. [2022-01-19 07:32:10,526 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8363486842105263 [2022-01-19 07:32:10,526 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1017 transitions. [2022-01-19 07:32:10,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1017 transitions. [2022-01-19 07:32:10,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:32:10,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1017 transitions. [2022-01-19 07:32:10,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 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) [2022-01-19 07:32:10,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 152.0) internal successors, (1368), 9 states have internal predecessors, (1368), 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) [2022-01-19 07:32:10,531 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 152.0) internal successors, (1368), 9 states have internal predecessors, (1368), 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) [2022-01-19 07:32:10,531 INFO L186 Difference]: Start difference. First operand has 262 places, 620 transitions, 5181 flow. Second operand 8 states and 1017 transitions. [2022-01-19 07:32:10,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1030 transitions, 10698 flow [2022-01-19 07:32:24,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 1030 transitions, 10694 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 07:32:24,221 INFO L242 Difference]: Finished difference. Result has 272 places, 813 transitions, 8396 flow [2022-01-19 07:32:24,222 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=5177, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8396, PETRI_PLACES=272, PETRI_TRANSITIONS=813} [2022-01-19 07:32:24,222 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 126 predicate places. [2022-01-19 07:32:24,222 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 813 transitions, 8396 flow [2022-01-19 07:32:24,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 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) [2022-01-19 07:32:24,223 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:32:24,224 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 07:32:24,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 07:32:24,224 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:32:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:32:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1321404692, now seen corresponding path program 10 times [2022-01-19 07:32:24,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:32:24,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909418001] [2022-01-19 07:32:24,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:32:24,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:32:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:32:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:32:24,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:32:24,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909418001] [2022-01-19 07:32:24,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909418001] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:32:24,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:32:24,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 07:32:24,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684834466] [2022-01-19 07:32:24,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:32:24,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 07:32:24,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:32:24,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 07:32:24,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-01-19 07:32:24,475 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 152 [2022-01-19 07:32:24,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 813 transitions, 8396 flow. Second operand has 13 states, 13 states have (on average 106.38461538461539) internal successors, (1383), 13 states have internal predecessors, (1383), 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) [2022-01-19 07:32:24,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:32:24,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 152 [2022-01-19 07:32:24,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:32:52,379 INFO L129 PetriNetUnfolder]: 53520/131061 cut-off events. [2022-01-19 07:32:52,380 INFO L130 PetriNetUnfolder]: For 693536/704256 co-relation queries the response was YES. [2022-01-19 07:32:54,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 557203 conditions, 131061 events. 53520/131061 cut-off events. For 693536/704256 co-relation queries the response was YES. Maximal size of possible extension queue 6905. Compared 1836952 event pairs, 21166 based on Foata normal form. 2203/129793 useless extension candidates. Maximal degree in co-relation 552017. Up to 54060 conditions per place. [2022-01-19 07:32:54,562 INFO L132 encePairwiseOnDemand]: 134/152 looper letters, 752 selfloop transitions, 248 changer transitions 14/1148 dead transitions. [2022-01-19 07:32:54,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 1148 transitions, 13645 flow [2022-01-19 07:32:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 07:32:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 07:32:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1515 transitions. [2022-01-19 07:32:54,565 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7667004048582996 [2022-01-19 07:32:54,565 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1515 transitions. [2022-01-19 07:32:54,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1515 transitions. [2022-01-19 07:32:54,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:32:54,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1515 transitions. [2022-01-19 07:32:54,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.53846153846153) internal successors, (1515), 13 states have internal predecessors, (1515), 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) [2022-01-19 07:32:54,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 152.0) internal successors, (2128), 14 states have internal predecessors, (2128), 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) [2022-01-19 07:32:54,570 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 152.0) internal successors, (2128), 14 states have internal predecessors, (2128), 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) [2022-01-19 07:32:54,570 INFO L186 Difference]: Start difference. First operand has 272 places, 813 transitions, 8396 flow. Second operand 13 states and 1515 transitions. [2022-01-19 07:32:54,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 1148 transitions, 13645 flow [2022-01-19 07:33:17,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 1148 transitions, 13539 flow, removed 53 selfloop flow, removed 0 redundant places. [2022-01-19 07:33:17,326 INFO L242 Difference]: Finished difference. Result has 292 places, 925 transitions, 10565 flow [2022-01-19 07:33:17,327 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=8314, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10565, PETRI_PLACES=292, PETRI_TRANSITIONS=925} [2022-01-19 07:33:17,328 INFO L334 CegarLoopForPetriNet]: 146 programPoint places, 146 predicate places. [2022-01-19 07:33:17,328 INFO L470 AbstractCegarLoop]: Abstraction has has 292 places, 925 transitions, 10565 flow [2022-01-19 07:33:17,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 106.38461538461539) internal successors, (1383), 13 states have internal predecessors, (1383), 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) [2022-01-19 07:33:17,328 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:33:17,329 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 07:33:17,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 07:33:17,329 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 07:33:17,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:33:17,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1099001934, now seen corresponding path program 11 times [2022-01-19 07:33:17,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:33:17,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160539812] [2022-01-19 07:33:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:33:17,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:33:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:33:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:33:17,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:33:17,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160539812] [2022-01-19 07:33:17,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160539812] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:33:17,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:33:17,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 07:33:17,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652048957] [2022-01-19 07:33:17,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:33:17,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 07:33:17,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:33:17,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 07:33:17,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-19 07:33:17,488 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 152 [2022-01-19 07:33:17,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 925 transitions, 10565 flow. Second operand has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 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) [2022-01-19 07:33:17,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:33:17,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 152 [2022-01-19 07:33:17,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand