/usr/bin/java -Xmx8000000000 -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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:31:29,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:31:29,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:31:29,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:31:29,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:31:29,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:31:29,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:31:29,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:31:29,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:31:29,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:31:29,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:31:29,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:31:29,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:31:29,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:31:29,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:31:29,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:31:29,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:31:29,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:31:29,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:31:29,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:31:29,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:31:29,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:31:29,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:31:29,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:31:29,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:31:29,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:31:29,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:31:29,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:31:29,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:31:29,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:31:29,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:31:29,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:31:29,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:31:29,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:31:29,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:31:29,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:31:29,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:31:29,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:31:29,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:31:29,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:31:29,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:31:29,750 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.epf [2022-09-20 22:31:29,788 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:31:29,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:31:29,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:31:29,790 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:31:29,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:31:29,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:31:29,791 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:31:29,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:31:29,791 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:31:29,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:31:29,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:31:29,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:31:29,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:31:29,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:31:29,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:31:29,793 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:31:29,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:31:29,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:31:29,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:31:29,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:31:29,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:31:29,793 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:31:29,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:31:29,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:31:29,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:31:29,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:31:29,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:31:29,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:31:29,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:31:29,795 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:31:29,795 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:31:29,795 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-09-20 22:31:30,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:31:30,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:31:30,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:31:30,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:31:30,091 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:31:30,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:31:30,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf947b8ca/b80f54a6ab344efdb43f34974784e536/FLAG30b5e119c [2022-09-20 22:31:30,681 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:31:30,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:31:30,703 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf947b8ca/b80f54a6ab344efdb43f34974784e536/FLAG30b5e119c [2022-09-20 22:31:30,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf947b8ca/b80f54a6ab344efdb43f34974784e536 [2022-09-20 22:31:30,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:31:30,970 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:31:30,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:31:30,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:31:30,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:31:30,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:31:30" (1/1) ... [2022-09-20 22:31:30,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d30846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:30, skipping insertion in model container [2022-09-20 22:31:30,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:31:30" (1/1) ... [2022-09-20 22:31:30,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:31:31,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:31:31,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-09-20 22:31:31,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:31:31,445 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:31:31,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-09-20 22:31:31,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:31:31,542 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:31:31,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:31 WrapperNode [2022-09-20 22:31:31,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:31:31,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:31:31,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:31:31,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:31:31,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:31" (1/1) ... [2022-09-20 22:31:31,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:31" (1/1) ... [2022-09-20 22:31:31,597 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-09-20 22:31:31,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:31:31,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:31:31,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:31:31,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:31:31,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:31" (1/1) ... [2022-09-20 22:31:31,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:31" (1/1) ... [2022-09-20 22:31:31,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:31" (1/1) ... [2022-09-20 22:31:31,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:31" (1/1) ... [2022-09-20 22:31:31,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:31" (1/1) ... [2022-09-20 22:31:31,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:31" (1/1) ... [2022-09-20 22:31:31,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:31" (1/1) ... [2022-09-20 22:31:31,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:31:31,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:31:31,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:31:31,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:31:31,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:31" (1/1) ... [2022-09-20 22:31:31,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:31:31,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:31:31,697 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-09-20 22:31:31,720 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-09-20 22:31:31,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:31:31,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 22:31:31,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:31:31,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:31:31,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:31:31,748 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 22:31:31,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 22:31:31,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 22:31:31,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 22:31:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 22:31:31,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 22:31:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:31:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 22:31:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:31:31,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:31:31,751 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 22:31:31,922 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:31:31,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:31:32,653 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:31:33,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:31:33,211 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 22:31:33,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:31:33 BoogieIcfgContainer [2022-09-20 22:31:33,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:31:33,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:31:33,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:31:33,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:31:33,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:31:30" (1/3) ... [2022-09-20 22:31:33,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca8bfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:31:33, skipping insertion in model container [2022-09-20 22:31:33,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:31:31" (2/3) ... [2022-09-20 22:31:33,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca8bfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:31:33, skipping insertion in model container [2022-09-20 22:31:33,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:31:33" (3/3) ... [2022-09-20 22:31:33,222 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:31:33,238 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:31:33,239 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 22:31:33,239 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:31:33,311 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 22:31:33,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-09-20 22:31:33,409 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-09-20 22:31:33,409 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:31:33,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-09-20 22:31:33,414 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-09-20 22:31:33,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-09-20 22:31:33,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:31:33,438 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@b03c3a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:31:33,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-09-20 22:31:33,451 INFO L130 PetriNetUnfolder]: 0/45 cut-off events. [2022-09-20 22:31:33,451 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:31:33,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:33,453 INFO L208 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] [2022-09-20 22:31:33,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1877201928, now seen corresponding path program 1 times [2022-09-20 22:31:33,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:33,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318830656] [2022-09-20 22:31:33,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:33,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:33,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:33,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318830656] [2022-09-20 22:31:33,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318830656] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:33,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:33,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:31:33,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051162002] [2022-09-20 22:31:33,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:33,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:31:33,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:33,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:31:33,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:31:33,775 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 114 [2022-09-20 22:31:33,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-09-20 22:31:33,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:33,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 114 [2022-09-20 22:31:33,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:34,052 INFO L130 PetriNetUnfolder]: 124/549 cut-off events. [2022-09-20 22:31:34,053 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-09-20 22:31:34,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 549 events. 124/549 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2998 event pairs, 24 based on Foata normal form. 23/541 useless extension candidates. Maximal degree in co-relation 729. Up to 155 conditions per place. [2022-09-20 22:31:34,060 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 18 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2022-09-20 22:31:34,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 285 flow [2022-09-20 22:31:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:31:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:31:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-09-20 22:31:34,078 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9327485380116959 [2022-09-20 22:31:34,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2022-09-20 22:31:34,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2022-09-20 22:31:34,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:34,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2022-09-20 22:31:34,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-09-20 22:31:34,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-09-20 22:31:34,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-09-20 22:31:34,101 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 319 transitions. [2022-09-20 22:31:34,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 285 flow [2022-09-20 22:31:34,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-20 22:31:34,111 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-09-20 22:31:34,113 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-09-20 22:31:34,117 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-09-20 22:31:34,118 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-09-20 22:31:34,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-09-20 22:31:34,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:34,118 INFO L208 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] [2022-09-20 22:31:34,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:31:34,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:34,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:34,120 INFO L85 PathProgramCache]: Analyzing trace with hash 185903545, now seen corresponding path program 1 times [2022-09-20 22:31:34,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:34,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607203589] [2022-09-20 22:31:34,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:34,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:34,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:34,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607203589] [2022-09-20 22:31:34,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607203589] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:34,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:34,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:31:34,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233930976] [2022-09-20 22:31:34,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:34,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:31:34,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:34,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:31:34,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:31:34,381 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-09-20 22:31:34,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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-09-20 22:31:34,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:34,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-09-20 22:31:34,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:34,967 INFO L130 PetriNetUnfolder]: 488/1440 cut-off events. [2022-09-20 22:31:34,968 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-09-20 22:31:34,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 1440 events. 488/1440 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10235 event pairs, 90 based on Foata normal form. 0/1396 useless extension candidates. Maximal degree in co-relation 2283. Up to 403 conditions per place. [2022-09-20 22:31:34,977 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 19 selfloop transitions, 2 changer transitions 48/147 dead transitions. [2022-09-20 22:31:34,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 147 transitions, 434 flow [2022-09-20 22:31:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:31:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:31:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions. [2022-09-20 22:31:34,981 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8654970760233918 [2022-09-20 22:31:34,981 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 888 transitions. [2022-09-20 22:31:34,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions. [2022-09-20 22:31:34,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:34,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions. [2022-09-20 22:31:34,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 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-09-20 22:31:34,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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-09-20 22:31:34,989 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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-09-20 22:31:34,989 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 888 transitions. [2022-09-20 22:31:34,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 147 transitions, 434 flow [2022-09-20 22:31:34,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 147 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:31:34,994 INFO L231 Difference]: Finished difference. Result has 129 places, 95 transitions, 216 flow [2022-09-20 22:31:34,994 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=95} [2022-09-20 22:31:34,995 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-09-20 22:31:34,995 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 95 transitions, 216 flow [2022-09-20 22:31:34,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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-09-20 22:31:34,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:34,996 INFO L208 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] [2022-09-20 22:31:34,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:31:34,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2103245336, now seen corresponding path program 1 times [2022-09-20 22:31:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:34,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726585975] [2022-09-20 22:31:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:34,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:35,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:35,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726585975] [2022-09-20 22:31:35,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726585975] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:35,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:35,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:31:35,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505378898] [2022-09-20 22:31:35,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:35,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:31:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:35,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:31:35,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:31:35,268 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-09-20 22:31:35,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 95 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 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-09-20 22:31:35,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:35,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-09-20 22:31:35,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:35,859 INFO L130 PetriNetUnfolder]: 746/1549 cut-off events. [2022-09-20 22:31:35,859 INFO L131 PetriNetUnfolder]: For 403/403 co-relation queries the response was YES. [2022-09-20 22:31:35,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3156 conditions, 1549 events. 746/1549 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9143 event pairs, 361 based on Foata normal form. 36/1523 useless extension candidates. Maximal degree in co-relation 3098. Up to 705 conditions per place. [2022-09-20 22:31:35,872 INFO L137 encePairwiseOnDemand]: 107/114 looper letters, 25 selfloop transitions, 3 changer transitions 43/147 dead transitions. [2022-09-20 22:31:35,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 147 transitions, 487 flow [2022-09-20 22:31:35,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:31:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:31:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 883 transitions. [2022-09-20 22:31:35,875 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8606237816764133 [2022-09-20 22:31:35,875 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 883 transitions. [2022-09-20 22:31:35,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 883 transitions. [2022-09-20 22:31:35,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:35,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 883 transitions. [2022-09-20 22:31:35,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.11111111111111) internal successors, (883), 9 states have internal predecessors, (883), 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-09-20 22:31:35,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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-09-20 22:31:35,883 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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-09-20 22:31:35,883 INFO L175 Difference]: Start difference. First operand has 129 places, 95 transitions, 216 flow. Second operand 9 states and 883 transitions. [2022-09-20 22:31:35,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 147 transitions, 487 flow [2022-09-20 22:31:35,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 147 transitions, 453 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-09-20 22:31:35,896 INFO L231 Difference]: Finished difference. Result has 118 places, 97 transitions, 243 flow [2022-09-20 22:31:35,896 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=243, PETRI_PLACES=118, PETRI_TRANSITIONS=97} [2022-09-20 22:31:35,898 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, -1 predicate places. [2022-09-20 22:31:35,899 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 97 transitions, 243 flow [2022-09-20 22:31:35,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 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-09-20 22:31:35,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:35,900 INFO L208 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] [2022-09-20 22:31:35,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:31:35,900 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:35,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash 51862913, now seen corresponding path program 1 times [2022-09-20 22:31:35,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:35,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114162228] [2022-09-20 22:31:35,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:35,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:36,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114162228] [2022-09-20 22:31:36,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114162228] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:36,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:36,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:31:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765462027] [2022-09-20 22:31:36,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:36,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:31:36,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:36,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:31:36,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:31:36,250 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-09-20 22:31:36,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 97 transitions, 243 flow. Second operand has 11 states, 11 states have (on average 87.54545454545455) internal successors, (963), 11 states have internal predecessors, (963), 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-09-20 22:31:36,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:36,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-09-20 22:31:36,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:37,135 INFO L130 PetriNetUnfolder]: 880/1783 cut-off events. [2022-09-20 22:31:37,135 INFO L131 PetriNetUnfolder]: For 1324/1330 co-relation queries the response was YES. [2022-09-20 22:31:37,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4152 conditions, 1783 events. 880/1783 cut-off events. For 1324/1330 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10352 event pairs, 301 based on Foata normal form. 48/1759 useless extension candidates. Maximal degree in co-relation 4088. Up to 738 conditions per place. [2022-09-20 22:31:37,149 INFO L137 encePairwiseOnDemand]: 99/114 looper letters, 28 selfloop transitions, 17 changer transitions 53/172 dead transitions. [2022-09-20 22:31:37,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 172 transitions, 631 flow [2022-09-20 22:31:37,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-20 22:31:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-09-20 22:31:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1649 transitions. [2022-09-20 22:31:37,154 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8036062378167641 [2022-09-20 22:31:37,154 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1649 transitions. [2022-09-20 22:31:37,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1649 transitions. [2022-09-20 22:31:37,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:37,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1649 transitions. [2022-09-20 22:31:37,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 91.61111111111111) internal successors, (1649), 18 states have internal predecessors, (1649), 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-09-20 22:31:37,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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-09-20 22:31:37,162 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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-09-20 22:31:37,162 INFO L175 Difference]: Start difference. First operand has 118 places, 97 transitions, 243 flow. Second operand 18 states and 1649 transitions. [2022-09-20 22:31:37,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 172 transitions, 631 flow [2022-09-20 22:31:37,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 172 transitions, 610 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-09-20 22:31:37,172 INFO L231 Difference]: Finished difference. Result has 136 places, 109 transitions, 348 flow [2022-09-20 22:31:37,173 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=348, PETRI_PLACES=136, PETRI_TRANSITIONS=109} [2022-09-20 22:31:37,173 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 17 predicate places. [2022-09-20 22:31:37,173 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 109 transitions, 348 flow [2022-09-20 22:31:37,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.54545454545455) internal successors, (963), 11 states have internal predecessors, (963), 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-09-20 22:31:37,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:37,174 INFO L208 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] [2022-09-20 22:31:37,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:31:37,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash -257602018, now seen corresponding path program 1 times [2022-09-20 22:31:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:37,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011259921] [2022-09-20 22:31:37,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:37,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:37,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:37,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011259921] [2022-09-20 22:31:37,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011259921] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:37,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:37,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:31:37,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919626592] [2022-09-20 22:31:37,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:37,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:31:37,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:37,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:31:37,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:31:37,304 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-09-20 22:31:37,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 109 transitions, 348 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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-09-20 22:31:37,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:37,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-09-20 22:31:37,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:37,771 INFO L130 PetriNetUnfolder]: 589/1310 cut-off events. [2022-09-20 22:31:37,771 INFO L131 PetriNetUnfolder]: For 3570/3603 co-relation queries the response was YES. [2022-09-20 22:31:37,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4447 conditions, 1310 events. 589/1310 cut-off events. For 3570/3603 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7650 event pairs, 125 based on Foata normal form. 36/1290 useless extension candidates. Maximal degree in co-relation 4375. Up to 387 conditions per place. [2022-09-20 22:31:37,785 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 39 selfloop transitions, 11 changer transitions 12/146 dead transitions. [2022-09-20 22:31:37,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 146 transitions, 669 flow [2022-09-20 22:31:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:31:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:31:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 882 transitions. [2022-09-20 22:31:37,788 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8596491228070176 [2022-09-20 22:31:37,788 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 882 transitions. [2022-09-20 22:31:37,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 882 transitions. [2022-09-20 22:31:37,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:37,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 882 transitions. [2022-09-20 22:31:37,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 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-09-20 22:31:37,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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-09-20 22:31:37,793 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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-09-20 22:31:37,793 INFO L175 Difference]: Start difference. First operand has 136 places, 109 transitions, 348 flow. Second operand 9 states and 882 transitions. [2022-09-20 22:31:37,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 146 transitions, 669 flow [2022-09-20 22:31:37,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 146 transitions, 627 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-09-20 22:31:37,804 INFO L231 Difference]: Finished difference. Result has 129 places, 117 transitions, 426 flow [2022-09-20 22:31:37,804 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=426, PETRI_PLACES=129, PETRI_TRANSITIONS=117} [2022-09-20 22:31:37,805 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-09-20 22:31:37,805 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 117 transitions, 426 flow [2022-09-20 22:31:37,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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-09-20 22:31:37,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:37,806 INFO L208 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] [2022-09-20 22:31:37,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 22:31:37,806 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:37,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:37,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1986191748, now seen corresponding path program 1 times [2022-09-20 22:31:37,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:37,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064161393] [2022-09-20 22:31:37,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:37,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:37,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064161393] [2022-09-20 22:31:37,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064161393] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:37,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:37,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:31:37,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101359696] [2022-09-20 22:31:37,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:37,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:31:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:37,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:31:37,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:31:37,936 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-09-20 22:31:37,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 117 transitions, 426 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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-09-20 22:31:37,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:37,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-09-20 22:31:37,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:38,698 INFO L130 PetriNetUnfolder]: 1322/2894 cut-off events. [2022-09-20 22:31:38,698 INFO L131 PetriNetUnfolder]: For 7238/7308 co-relation queries the response was YES. [2022-09-20 22:31:38,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9689 conditions, 2894 events. 1322/2894 cut-off events. For 7238/7308 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 20889 event pairs, 342 based on Foata normal form. 28/2805 useless extension candidates. Maximal degree in co-relation 9621. Up to 915 conditions per place. [2022-09-20 22:31:38,728 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 65 selfloop transitions, 11 changer transitions 28/184 dead transitions. [2022-09-20 22:31:38,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 184 transitions, 1116 flow [2022-09-20 22:31:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:31:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:31:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 878 transitions. [2022-09-20 22:31:38,732 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8557504873294347 [2022-09-20 22:31:38,732 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 878 transitions. [2022-09-20 22:31:38,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 878 transitions. [2022-09-20 22:31:38,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:38,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 878 transitions. [2022-09-20 22:31:38,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 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-09-20 22:31:38,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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-09-20 22:31:38,738 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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-09-20 22:31:38,738 INFO L175 Difference]: Start difference. First operand has 129 places, 117 transitions, 426 flow. Second operand 9 states and 878 transitions. [2022-09-20 22:31:38,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 184 transitions, 1116 flow [2022-09-20 22:31:38,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 184 transitions, 1012 flow, removed 52 selfloop flow, removed 0 redundant places. [2022-09-20 22:31:38,755 INFO L231 Difference]: Finished difference. Result has 144 places, 125 transitions, 542 flow [2022-09-20 22:31:38,755 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=542, PETRI_PLACES=144, PETRI_TRANSITIONS=125} [2022-09-20 22:31:38,757 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 25 predicate places. [2022-09-20 22:31:38,757 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 125 transitions, 542 flow [2022-09-20 22:31:38,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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-09-20 22:31:38,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:38,758 INFO L208 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] [2022-09-20 22:31:38,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:31:38,759 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:38,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1570877810, now seen corresponding path program 1 times [2022-09-20 22:31:38,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:38,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879439184] [2022-09-20 22:31:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:39,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:39,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879439184] [2022-09-20 22:31:39,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879439184] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:39,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:39,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:31:39,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427030668] [2022-09-20 22:31:39,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:39,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:31:39,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:39,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:31:39,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:31:39,080 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-09-20 22:31:39,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 125 transitions, 542 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 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-09-20 22:31:39,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:39,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-09-20 22:31:39,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:39,879 INFO L130 PetriNetUnfolder]: 1143/2372 cut-off events. [2022-09-20 22:31:39,879 INFO L131 PetriNetUnfolder]: For 9022/9129 co-relation queries the response was YES. [2022-09-20 22:31:39,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8572 conditions, 2372 events. 1143/2372 cut-off events. For 9022/9129 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 15847 event pairs, 499 based on Foata normal form. 19/2291 useless extension candidates. Maximal degree in co-relation 8493. Up to 1501 conditions per place. [2022-09-20 22:31:39,911 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 39 selfloop transitions, 12 changer transitions 64/191 dead transitions. [2022-09-20 22:31:39,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 191 transitions, 1227 flow [2022-09-20 22:31:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 22:31:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 22:31:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1314 transitions. [2022-09-20 22:31:39,915 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8233082706766918 [2022-09-20 22:31:39,915 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1314 transitions. [2022-09-20 22:31:39,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1314 transitions. [2022-09-20 22:31:39,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:39,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1314 transitions. [2022-09-20 22:31:39,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.85714285714286) internal successors, (1314), 14 states have internal predecessors, (1314), 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-09-20 22:31:39,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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-09-20 22:31:39,924 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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-09-20 22:31:39,924 INFO L175 Difference]: Start difference. First operand has 144 places, 125 transitions, 542 flow. Second operand 14 states and 1314 transitions. [2022-09-20 22:31:39,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 191 transitions, 1227 flow [2022-09-20 22:31:39,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 191 transitions, 1158 flow, removed 33 selfloop flow, removed 4 redundant places. [2022-09-20 22:31:39,967 INFO L231 Difference]: Finished difference. Result has 161 places, 116 transitions, 471 flow [2022-09-20 22:31:39,967 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=471, PETRI_PLACES=161, PETRI_TRANSITIONS=116} [2022-09-20 22:31:39,968 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 42 predicate places. [2022-09-20 22:31:39,968 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 116 transitions, 471 flow [2022-09-20 22:31:39,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 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-09-20 22:31:39,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:39,969 INFO L208 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] [2022-09-20 22:31:39,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 22:31:39,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:39,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:39,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1356525356, now seen corresponding path program 2 times [2022-09-20 22:31:39,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:39,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555329717] [2022-09-20 22:31:39,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:39,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:40,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:40,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555329717] [2022-09-20 22:31:40,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555329717] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:40,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:40,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 22:31:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621738952] [2022-09-20 22:31:40,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:40,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 22:31:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:40,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 22:31:40,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-09-20 22:31:40,200 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-09-20 22:31:40,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 116 transitions, 471 flow. Second operand has 10 states, 10 states have (on average 88.8) internal successors, (888), 10 states have internal predecessors, (888), 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-09-20 22:31:40,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:40,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-09-20 22:31:40,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:40,904 INFO L130 PetriNetUnfolder]: 596/1339 cut-off events. [2022-09-20 22:31:40,904 INFO L131 PetriNetUnfolder]: For 9579/10368 co-relation queries the response was YES. [2022-09-20 22:31:40,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6135 conditions, 1339 events. 596/1339 cut-off events. For 9579/10368 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7716 event pairs, 276 based on Foata normal form. 20/1252 useless extension candidates. Maximal degree in co-relation 6045. Up to 676 conditions per place. [2022-09-20 22:31:40,928 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 40 selfloop transitions, 17 changer transitions 37/169 dead transitions. [2022-09-20 22:31:40,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 169 transitions, 1247 flow [2022-09-20 22:31:40,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 22:31:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 22:31:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1385 transitions. [2022-09-20 22:31:40,932 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8099415204678363 [2022-09-20 22:31:40,932 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1385 transitions. [2022-09-20 22:31:40,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1385 transitions. [2022-09-20 22:31:40,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:40,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1385 transitions. [2022-09-20 22:31:40,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 92.33333333333333) internal successors, (1385), 15 states have internal predecessors, (1385), 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-09-20 22:31:40,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 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-09-20 22:31:40,941 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 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-09-20 22:31:40,941 INFO L175 Difference]: Start difference. First operand has 161 places, 116 transitions, 471 flow. Second operand 15 states and 1385 transitions. [2022-09-20 22:31:40,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 169 transitions, 1247 flow [2022-09-20 22:31:40,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 169 transitions, 1111 flow, removed 56 selfloop flow, removed 15 redundant places. [2022-09-20 22:31:40,961 INFO L231 Difference]: Finished difference. Result has 152 places, 121 transitions, 549 flow [2022-09-20 22:31:40,961 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=549, PETRI_PLACES=152, PETRI_TRANSITIONS=121} [2022-09-20 22:31:40,962 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 33 predicate places. [2022-09-20 22:31:40,962 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 121 transitions, 549 flow [2022-09-20 22:31:40,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.8) internal successors, (888), 10 states have internal predecessors, (888), 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-09-20 22:31:40,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:40,962 INFO L208 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] [2022-09-20 22:31:40,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 22:31:40,963 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:40,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:40,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1739985696, now seen corresponding path program 3 times [2022-09-20 22:31:40,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:40,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428254507] [2022-09-20 22:31:40,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:40,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:41,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:41,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428254507] [2022-09-20 22:31:41,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428254507] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:41,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:41,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:31:41,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758255610] [2022-09-20 22:31:41,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:41,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:31:41,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:41,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:31:41,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:31:41,159 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-09-20 22:31:41,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 121 transitions, 549 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 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-09-20 22:31:41,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:41,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-09-20 22:31:41,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:41,728 INFO L130 PetriNetUnfolder]: 796/1721 cut-off events. [2022-09-20 22:31:41,729 INFO L131 PetriNetUnfolder]: For 21740/23488 co-relation queries the response was YES. [2022-09-20 22:31:41,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9604 conditions, 1721 events. 796/1721 cut-off events. For 21740/23488 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10885 event pairs, 203 based on Foata normal form. 31/1648 useless extension candidates. Maximal degree in co-relation 9517. Up to 824 conditions per place. [2022-09-20 22:31:41,759 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 42 selfloop transitions, 15 changer transitions 31/165 dead transitions. [2022-09-20 22:31:41,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 165 transitions, 1271 flow [2022-09-20 22:31:41,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:31:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:31:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1044 transitions. [2022-09-20 22:31:41,763 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8325358851674641 [2022-09-20 22:31:41,763 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1044 transitions. [2022-09-20 22:31:41,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1044 transitions. [2022-09-20 22:31:41,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:41,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1044 transitions. [2022-09-20 22:31:41,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.9090909090909) internal successors, (1044), 11 states have internal predecessors, (1044), 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-09-20 22:31:41,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 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-09-20 22:31:41,770 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 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-09-20 22:31:41,771 INFO L175 Difference]: Start difference. First operand has 152 places, 121 transitions, 549 flow. Second operand 11 states and 1044 transitions. [2022-09-20 22:31:41,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 165 transitions, 1271 flow [2022-09-20 22:31:41,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 165 transitions, 1008 flow, removed 122 selfloop flow, removed 15 redundant places. [2022-09-20 22:31:41,799 INFO L231 Difference]: Finished difference. Result has 145 places, 127 transitions, 616 flow [2022-09-20 22:31:41,799 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=616, PETRI_PLACES=145, PETRI_TRANSITIONS=127} [2022-09-20 22:31:41,800 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 26 predicate places. [2022-09-20 22:31:41,804 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 127 transitions, 616 flow [2022-09-20 22:31:41,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 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-09-20 22:31:41,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:41,805 INFO L208 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] [2022-09-20 22:31:41,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 22:31:41,805 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:41,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:41,805 INFO L85 PathProgramCache]: Analyzing trace with hash 105452647, now seen corresponding path program 1 times [2022-09-20 22:31:41,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:41,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386391655] [2022-09-20 22:31:41,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:41,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:42,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:42,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386391655] [2022-09-20 22:31:42,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386391655] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:42,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:42,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 22:31:42,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964887166] [2022-09-20 22:31:42,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:42,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 22:31:42,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:42,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 22:31:42,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-09-20 22:31:42,020 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-09-20 22:31:42,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 127 transitions, 616 flow. Second operand has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 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-09-20 22:31:42,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:42,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-09-20 22:31:42,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:42,771 INFO L130 PetriNetUnfolder]: 822/1917 cut-off events. [2022-09-20 22:31:42,771 INFO L131 PetriNetUnfolder]: For 16554/19972 co-relation queries the response was YES. [2022-09-20 22:31:42,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10243 conditions, 1917 events. 822/1917 cut-off events. For 16554/19972 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13258 event pairs, 139 based on Foata normal form. 57/1857 useless extension candidates. Maximal degree in co-relation 10158. Up to 734 conditions per place. [2022-09-20 22:31:42,792 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 38 selfloop transitions, 11 changer transitions 74/197 dead transitions. [2022-09-20 22:31:42,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 197 transitions, 1679 flow [2022-09-20 22:31:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 22:31:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 22:31:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1277 transitions. [2022-09-20 22:31:42,796 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.800125313283208 [2022-09-20 22:31:42,796 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1277 transitions. [2022-09-20 22:31:42,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1277 transitions. [2022-09-20 22:31:42,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:42,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1277 transitions. [2022-09-20 22:31:42,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 91.21428571428571) internal successors, (1277), 14 states have internal predecessors, (1277), 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-09-20 22:31:42,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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-09-20 22:31:42,804 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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-09-20 22:31:42,804 INFO L175 Difference]: Start difference. First operand has 145 places, 127 transitions, 616 flow. Second operand 14 states and 1277 transitions. [2022-09-20 22:31:42,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 197 transitions, 1679 flow [2022-09-20 22:31:42,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 197 transitions, 1592 flow, removed 25 selfloop flow, removed 6 redundant places. [2022-09-20 22:31:42,831 INFO L231 Difference]: Finished difference. Result has 154 places, 114 transitions, 536 flow [2022-09-20 22:31:42,832 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=536, PETRI_PLACES=154, PETRI_TRANSITIONS=114} [2022-09-20 22:31:42,832 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 35 predicate places. [2022-09-20 22:31:42,832 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 114 transitions, 536 flow [2022-09-20 22:31:42,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 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-09-20 22:31:42,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:42,833 INFO L208 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] [2022-09-20 22:31:42,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 22:31:42,833 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:42,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1536026607, now seen corresponding path program 1 times [2022-09-20 22:31:42,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:42,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559170952] [2022-09-20 22:31:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:43,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:43,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559170952] [2022-09-20 22:31:43,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559170952] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:43,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:43,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-09-20 22:31:43,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624411440] [2022-09-20 22:31:43,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:43,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-09-20 22:31:43,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:43,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-09-20 22:31:43,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-09-20 22:31:43,411 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-09-20 22:31:43,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 114 transitions, 536 flow. Second operand has 16 states, 16 states have (on average 84.4375) internal successors, (1351), 16 states have internal predecessors, (1351), 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-09-20 22:31:43,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:43,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-09-20 22:31:43,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:44,076 INFO L130 PetriNetUnfolder]: 402/1021 cut-off events. [2022-09-20 22:31:44,076 INFO L131 PetriNetUnfolder]: For 11684/12320 co-relation queries the response was YES. [2022-09-20 22:31:44,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5892 conditions, 1021 events. 402/1021 cut-off events. For 11684/12320 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5781 event pairs, 178 based on Foata normal form. 13/950 useless extension candidates. Maximal degree in co-relation 5794. Up to 544 conditions per place. [2022-09-20 22:31:44,088 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 41 selfloop transitions, 13 changer transitions 25/150 dead transitions. [2022-09-20 22:31:44,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 150 transitions, 1220 flow [2022-09-20 22:31:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:31:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:31:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1392 transitions. [2022-09-20 22:31:44,091 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7631578947368421 [2022-09-20 22:31:44,092 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1392 transitions. [2022-09-20 22:31:44,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1392 transitions. [2022-09-20 22:31:44,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:44,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1392 transitions. [2022-09-20 22:31:44,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 87.0) internal successors, (1392), 16 states have internal predecessors, (1392), 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-09-20 22:31:44,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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-09-20 22:31:44,099 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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-09-20 22:31:44,099 INFO L175 Difference]: Start difference. First operand has 154 places, 114 transitions, 536 flow. Second operand 16 states and 1392 transitions. [2022-09-20 22:31:44,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 150 transitions, 1220 flow [2022-09-20 22:31:44,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 150 transitions, 1148 flow, removed 25 selfloop flow, removed 11 redundant places. [2022-09-20 22:31:44,118 INFO L231 Difference]: Finished difference. Result has 157 places, 115 transitions, 547 flow [2022-09-20 22:31:44,119 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=547, PETRI_PLACES=157, PETRI_TRANSITIONS=115} [2022-09-20 22:31:44,119 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 38 predicate places. [2022-09-20 22:31:44,119 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 115 transitions, 547 flow [2022-09-20 22:31:44,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 84.4375) internal successors, (1351), 16 states have internal predecessors, (1351), 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-09-20 22:31:44,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:44,120 INFO L208 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] [2022-09-20 22:31:44,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 22:31:44,120 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash -578467300, now seen corresponding path program 1 times [2022-09-20 22:31:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:44,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629170648] [2022-09-20 22:31:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:44,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629170648] [2022-09-20 22:31:44,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629170648] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:44,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:44,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 22:31:44,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203983683] [2022-09-20 22:31:44,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:44,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 22:31:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:44,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 22:31:44,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-09-20 22:31:44,378 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-09-20 22:31:44,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 115 transitions, 547 flow. Second operand has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 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-09-20 22:31:44,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:44,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-09-20 22:31:44,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:45,223 INFO L130 PetriNetUnfolder]: 547/1431 cut-off events. [2022-09-20 22:31:45,224 INFO L131 PetriNetUnfolder]: For 17617/19088 co-relation queries the response was YES. [2022-09-20 22:31:45,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8448 conditions, 1431 events. 547/1431 cut-off events. For 17617/19088 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9614 event pairs, 114 based on Foata normal form. 42/1357 useless extension candidates. Maximal degree in co-relation 8350. Up to 573 conditions per place. [2022-09-20 22:31:45,242 INFO L137 encePairwiseOnDemand]: 103/114 looper letters, 44 selfloop transitions, 17 changer transitions 49/184 dead transitions. [2022-09-20 22:31:45,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 184 transitions, 1810 flow [2022-09-20 22:31:45,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:31:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:31:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1463 transitions. [2022-09-20 22:31:45,247 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2022-09-20 22:31:45,247 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1463 transitions. [2022-09-20 22:31:45,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1463 transitions. [2022-09-20 22:31:45,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:45,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1463 transitions. [2022-09-20 22:31:45,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 91.4375) internal successors, (1463), 16 states have internal predecessors, (1463), 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-09-20 22:31:45,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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-09-20 22:31:45,269 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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-09-20 22:31:45,269 INFO L175 Difference]: Start difference. First operand has 157 places, 115 transitions, 547 flow. Second operand 16 states and 1463 transitions. [2022-09-20 22:31:45,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 184 transitions, 1810 flow [2022-09-20 22:31:45,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 184 transitions, 1724 flow, removed 34 selfloop flow, removed 13 redundant places. [2022-09-20 22:31:45,301 INFO L231 Difference]: Finished difference. Result has 165 places, 122 transitions, 727 flow [2022-09-20 22:31:45,301 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=727, PETRI_PLACES=165, PETRI_TRANSITIONS=122} [2022-09-20 22:31:45,302 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 46 predicate places. [2022-09-20 22:31:45,303 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 122 transitions, 727 flow [2022-09-20 22:31:45,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 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-09-20 22:31:45,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:45,304 INFO L208 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] [2022-09-20 22:31:45,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 22:31:45,304 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2125577294, now seen corresponding path program 2 times [2022-09-20 22:31:45,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:45,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440340237] [2022-09-20 22:31:45,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:45,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:45,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:45,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440340237] [2022-09-20 22:31:45,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440340237] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:45,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:45,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 22:31:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724833603] [2022-09-20 22:31:45,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:45,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 22:31:45,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:45,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 22:31:45,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-09-20 22:31:45,583 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-09-20 22:31:45,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 122 transitions, 727 flow. Second operand has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 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-09-20 22:31:45,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:45,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-09-20 22:31:45,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:46,372 INFO L130 PetriNetUnfolder]: 501/1396 cut-off events. [2022-09-20 22:31:46,372 INFO L131 PetriNetUnfolder]: For 27281/27855 co-relation queries the response was YES. [2022-09-20 22:31:46,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9294 conditions, 1396 events. 501/1396 cut-off events. For 27281/27855 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9264 event pairs, 65 based on Foata normal form. 45/1342 useless extension candidates. Maximal degree in co-relation 9194. Up to 576 conditions per place. [2022-09-20 22:31:46,391 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 48 selfloop transitions, 37 changer transitions 44/203 dead transitions. [2022-09-20 22:31:46,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 203 transitions, 2531 flow [2022-09-20 22:31:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-20 22:31:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-09-20 22:31:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1637 transitions. [2022-09-20 22:31:46,394 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7977582846003899 [2022-09-20 22:31:46,394 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1637 transitions. [2022-09-20 22:31:46,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1637 transitions. [2022-09-20 22:31:46,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:46,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1637 transitions. [2022-09-20 22:31:46,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 90.94444444444444) internal successors, (1637), 18 states have internal predecessors, (1637), 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-09-20 22:31:46,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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-09-20 22:31:46,400 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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-09-20 22:31:46,400 INFO L175 Difference]: Start difference. First operand has 165 places, 122 transitions, 727 flow. Second operand 18 states and 1637 transitions. [2022-09-20 22:31:46,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 203 transitions, 2531 flow [2022-09-20 22:31:46,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 203 transitions, 2106 flow, removed 206 selfloop flow, removed 13 redundant places. [2022-09-20 22:31:46,463 INFO L231 Difference]: Finished difference. Result has 174 places, 148 transitions, 1200 flow [2022-09-20 22:31:46,464 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1200, PETRI_PLACES=174, PETRI_TRANSITIONS=148} [2022-09-20 22:31:46,464 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 55 predicate places. [2022-09-20 22:31:46,464 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 148 transitions, 1200 flow [2022-09-20 22:31:46,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 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-09-20 22:31:46,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:46,465 INFO L208 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] [2022-09-20 22:31:46,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 22:31:46,465 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash -740042930, now seen corresponding path program 3 times [2022-09-20 22:31:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:46,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882130598] [2022-09-20 22:31:46,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:46,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:46,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:46,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882130598] [2022-09-20 22:31:46,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882130598] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:46,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:46,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 22:31:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011224636] [2022-09-20 22:31:46,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:46,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 22:31:46,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:46,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 22:31:46,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-09-20 22:31:46,737 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114 [2022-09-20 22:31:46,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 148 transitions, 1200 flow. Second operand has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 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-09-20 22:31:46,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:46,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114 [2022-09-20 22:31:46,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:47,317 INFO L130 PetriNetUnfolder]: 438/1325 cut-off events. [2022-09-20 22:31:47,317 INFO L131 PetriNetUnfolder]: For 24608/29193 co-relation queries the response was YES. [2022-09-20 22:31:47,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8720 conditions, 1325 events. 438/1325 cut-off events. For 24608/29193 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9674 event pairs, 100 based on Foata normal form. 42/1295 useless extension candidates. Maximal degree in co-relation 8615. Up to 616 conditions per place. [2022-09-20 22:31:47,334 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 64 selfloop transitions, 26 changer transitions 28/192 dead transitions. [2022-09-20 22:31:47,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 192 transitions, 2321 flow [2022-09-20 22:31:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 22:31:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 22:31:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1270 transitions. [2022-09-20 22:31:47,336 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7957393483709273 [2022-09-20 22:31:47,337 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1270 transitions. [2022-09-20 22:31:47,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1270 transitions. [2022-09-20 22:31:47,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:47,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1270 transitions. [2022-09-20 22:31:47,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.71428571428571) internal successors, (1270), 14 states have internal predecessors, (1270), 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-09-20 22:31:47,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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-09-20 22:31:47,342 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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-09-20 22:31:47,342 INFO L175 Difference]: Start difference. First operand has 174 places, 148 transitions, 1200 flow. Second operand 14 states and 1270 transitions. [2022-09-20 22:31:47,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 192 transitions, 2321 flow [2022-09-20 22:31:47,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 192 transitions, 1940 flow, removed 188 selfloop flow, removed 17 redundant places. [2022-09-20 22:31:47,406 INFO L231 Difference]: Finished difference. Result has 169 places, 155 transitions, 1320 flow [2022-09-20 22:31:47,406 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1320, PETRI_PLACES=169, PETRI_TRANSITIONS=155} [2022-09-20 22:31:47,407 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 50 predicate places. [2022-09-20 22:31:47,407 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 155 transitions, 1320 flow [2022-09-20 22:31:47,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 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-09-20 22:31:47,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:47,407 INFO L208 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] [2022-09-20 22:31:47,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-20 22:31:47,408 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:47,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:47,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2081659210, now seen corresponding path program 1 times [2022-09-20 22:31:47,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:47,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337098912] [2022-09-20 22:31:47,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:47,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:47,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:47,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337098912] [2022-09-20 22:31:47,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337098912] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:47,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:47,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-20 22:31:47,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442137098] [2022-09-20 22:31:47,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:47,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 22:31:47,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:47,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 22:31:47,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-09-20 22:31:47,740 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-09-20 22:31:47,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 155 transitions, 1320 flow. Second operand has 13 states, 13 states have (on average 85.76923076923077) internal successors, (1115), 13 states have internal predecessors, (1115), 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-09-20 22:31:47,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:47,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-09-20 22:31:47,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:48,472 INFO L130 PetriNetUnfolder]: 421/1515 cut-off events. [2022-09-20 22:31:48,472 INFO L131 PetriNetUnfolder]: For 18014/26474 co-relation queries the response was YES. [2022-09-20 22:31:48,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8518 conditions, 1515 events. 421/1515 cut-off events. For 18014/26474 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12240 event pairs, 100 based on Foata normal form. 36/1430 useless extension candidates. Maximal degree in co-relation 8415. Up to 529 conditions per place. [2022-09-20 22:31:48,485 INFO L137 encePairwiseOnDemand]: 103/114 looper letters, 61 selfloop transitions, 18 changer transitions 51/202 dead transitions. [2022-09-20 22:31:48,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 202 transitions, 2335 flow [2022-09-20 22:31:48,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-20 22:31:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-09-20 22:31:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1502 transitions. [2022-09-20 22:31:48,487 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7750257997936016 [2022-09-20 22:31:48,488 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1502 transitions. [2022-09-20 22:31:48,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1502 transitions. [2022-09-20 22:31:48,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:48,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1502 transitions. [2022-09-20 22:31:48,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 88.3529411764706) internal successors, (1502), 17 states have internal predecessors, (1502), 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-09-20 22:31:48,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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-09-20 22:31:48,493 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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-09-20 22:31:48,493 INFO L175 Difference]: Start difference. First operand has 169 places, 155 transitions, 1320 flow. Second operand 17 states and 1502 transitions. [2022-09-20 22:31:48,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 202 transitions, 2335 flow [2022-09-20 22:31:48,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 202 transitions, 2082 flow, removed 124 selfloop flow, removed 9 redundant places. [2022-09-20 22:31:48,546 INFO L231 Difference]: Finished difference. Result has 182 places, 141 transitions, 1127 flow [2022-09-20 22:31:48,547 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1127, PETRI_PLACES=182, PETRI_TRANSITIONS=141} [2022-09-20 22:31:48,548 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 63 predicate places. [2022-09-20 22:31:48,548 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 141 transitions, 1127 flow [2022-09-20 22:31:48,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 85.76923076923077) internal successors, (1115), 13 states have internal predecessors, (1115), 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-09-20 22:31:48,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:48,549 INFO L208 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] [2022-09-20 22:31:48,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-20 22:31:48,549 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:48,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash 218597624, now seen corresponding path program 2 times [2022-09-20 22:31:48,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:48,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945828589] [2022-09-20 22:31:48,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:48,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:48,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945828589] [2022-09-20 22:31:48,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945828589] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:48,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:48,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-09-20 22:31:48,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249540312] [2022-09-20 22:31:48,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:48,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-09-20 22:31:48,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:48,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-09-20 22:31:48,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-09-20 22:31:48,825 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-09-20 22:31:48,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 141 transitions, 1127 flow. Second operand has 15 states, 15 states have (on average 86.46666666666667) internal successors, (1297), 15 states have internal predecessors, (1297), 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-09-20 22:31:48,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:48,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-09-20 22:31:48,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:49,529 INFO L130 PetriNetUnfolder]: 245/869 cut-off events. [2022-09-20 22:31:49,529 INFO L131 PetriNetUnfolder]: For 14394/16498 co-relation queries the response was YES. [2022-09-20 22:31:49,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5151 conditions, 869 events. 245/869 cut-off events. For 14394/16498 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5804 event pairs, 54 based on Foata normal form. 46/878 useless extension candidates. Maximal degree in co-relation 5042. Up to 344 conditions per place. [2022-09-20 22:31:49,542 INFO L137 encePairwiseOnDemand]: 97/114 looper letters, 62 selfloop transitions, 35 changer transitions 35/205 dead transitions. [2022-09-20 22:31:49,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 205 transitions, 2453 flow [2022-09-20 22:31:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-09-20 22:31:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-09-20 22:31:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1871 transitions. [2022-09-20 22:31:49,545 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7815371762740184 [2022-09-20 22:31:49,545 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1871 transitions. [2022-09-20 22:31:49,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1871 transitions. [2022-09-20 22:31:49,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:49,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1871 transitions. [2022-09-20 22:31:49,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 89.0952380952381) internal successors, (1871), 21 states have internal predecessors, (1871), 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-09-20 22:31:49,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 114.0) internal successors, (2508), 22 states have internal predecessors, (2508), 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-09-20 22:31:49,552 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 114.0) internal successors, (2508), 22 states have internal predecessors, (2508), 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-09-20 22:31:49,552 INFO L175 Difference]: Start difference. First operand has 182 places, 141 transitions, 1127 flow. Second operand 21 states and 1871 transitions. [2022-09-20 22:31:49,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 205 transitions, 2453 flow [2022-09-20 22:31:49,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 205 transitions, 2161 flow, removed 136 selfloop flow, removed 15 redundant places. [2022-09-20 22:31:49,615 INFO L231 Difference]: Finished difference. Result has 191 places, 158 transitions, 1414 flow [2022-09-20 22:31:49,615 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1414, PETRI_PLACES=191, PETRI_TRANSITIONS=158} [2022-09-20 22:31:49,616 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 72 predicate places. [2022-09-20 22:31:49,618 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 158 transitions, 1414 flow [2022-09-20 22:31:49,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 86.46666666666667) internal successors, (1297), 15 states have internal predecessors, (1297), 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-09-20 22:31:49,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:49,619 INFO L208 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] [2022-09-20 22:31:49,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-09-20 22:31:49,619 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:49,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:49,620 INFO L85 PathProgramCache]: Analyzing trace with hash 162033160, now seen corresponding path program 3 times [2022-09-20 22:31:49,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:49,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950610579] [2022-09-20 22:31:49,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:49,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:49,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950610579] [2022-09-20 22:31:49,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950610579] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:49,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:49,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-09-20 22:31:49,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884003300] [2022-09-20 22:31:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:49,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-09-20 22:31:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:49,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-09-20 22:31:49,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-09-20 22:31:49,961 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-09-20 22:31:49,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 158 transitions, 1414 flow. Second operand has 15 states, 15 states have (on average 86.46666666666667) internal successors, (1297), 15 states have internal predecessors, (1297), 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-09-20 22:31:49,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:49,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-09-20 22:31:49,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:50,439 INFO L130 PetriNetUnfolder]: 203/801 cut-off events. [2022-09-20 22:31:50,440 INFO L131 PetriNetUnfolder]: For 12240/14791 co-relation queries the response was YES. [2022-09-20 22:31:50,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 801 events. 203/801 cut-off events. For 12240/14791 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5183 event pairs, 66 based on Foata normal form. 38/789 useless extension candidates. Maximal degree in co-relation 4515. Up to 288 conditions per place. [2022-09-20 22:31:50,451 INFO L137 encePairwiseOnDemand]: 100/114 looper letters, 65 selfloop transitions, 34 changer transitions 23/195 dead transitions. [2022-09-20 22:31:50,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 195 transitions, 2311 flow [2022-09-20 22:31:50,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 22:31:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 22:31:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1338 transitions. [2022-09-20 22:31:50,454 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7824561403508772 [2022-09-20 22:31:50,454 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1338 transitions. [2022-09-20 22:31:50,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1338 transitions. [2022-09-20 22:31:50,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:50,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1338 transitions. [2022-09-20 22:31:50,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 89.2) internal successors, (1338), 15 states have internal predecessors, (1338), 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-09-20 22:31:50,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 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-09-20 22:31:50,459 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 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-09-20 22:31:50,459 INFO L175 Difference]: Start difference. First operand has 191 places, 158 transitions, 1414 flow. Second operand 15 states and 1338 transitions. [2022-09-20 22:31:50,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 195 transitions, 2311 flow [2022-09-20 22:31:50,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 195 transitions, 2097 flow, removed 93 selfloop flow, removed 14 redundant places. [2022-09-20 22:31:50,503 INFO L231 Difference]: Finished difference. Result has 189 places, 162 transitions, 1483 flow [2022-09-20 22:31:50,503 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1483, PETRI_PLACES=189, PETRI_TRANSITIONS=162} [2022-09-20 22:31:50,503 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 70 predicate places. [2022-09-20 22:31:50,503 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 162 transitions, 1483 flow [2022-09-20 22:31:50,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 86.46666666666667) internal successors, (1297), 15 states have internal predecessors, (1297), 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-09-20 22:31:50,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:50,504 INFO L208 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] [2022-09-20 22:31:50,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-09-20 22:31:50,504 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash -201509573, now seen corresponding path program 1 times [2022-09-20 22:31:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:50,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903750042] [2022-09-20 22:31:50,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:50,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903750042] [2022-09-20 22:31:50,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903750042] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:50,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:50,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-09-20 22:31:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999233416] [2022-09-20 22:31:50,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:50,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-09-20 22:31:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:50,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-09-20 22:31:50,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-09-20 22:31:50,981 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114 [2022-09-20 22:31:50,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 162 transitions, 1483 flow. Second operand has 15 states, 15 states have (on average 85.53333333333333) internal successors, (1283), 15 states have internal predecessors, (1283), 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-09-20 22:31:50,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:50,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114 [2022-09-20 22:31:50,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:51,675 INFO L130 PetriNetUnfolder]: 182/744 cut-off events. [2022-09-20 22:31:51,675 INFO L131 PetriNetUnfolder]: For 10855/13398 co-relation queries the response was YES. [2022-09-20 22:31:51,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4361 conditions, 744 events. 182/744 cut-off events. For 10855/13398 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4752 event pairs, 62 based on Foata normal form. 34/729 useless extension candidates. Maximal degree in co-relation 4247. Up to 279 conditions per place. [2022-09-20 22:31:51,685 INFO L137 encePairwiseOnDemand]: 100/114 looper letters, 65 selfloop transitions, 34 changer transitions 29/200 dead transitions. [2022-09-20 22:31:51,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 200 transitions, 2459 flow [2022-09-20 22:31:51,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:31:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:31:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1410 transitions. [2022-09-20 22:31:51,690 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7730263157894737 [2022-09-20 22:31:51,690 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1410 transitions. [2022-09-20 22:31:51,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1410 transitions. [2022-09-20 22:31:51,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:51,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1410 transitions. [2022-09-20 22:31:51,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 88.125) internal successors, (1410), 16 states have internal predecessors, (1410), 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-09-20 22:31:51,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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-09-20 22:31:51,696 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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-09-20 22:31:51,696 INFO L175 Difference]: Start difference. First operand has 189 places, 162 transitions, 1483 flow. Second operand 16 states and 1410 transitions. [2022-09-20 22:31:51,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 200 transitions, 2459 flow [2022-09-20 22:31:51,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 200 transitions, 2284 flow, removed 67 selfloop flow, removed 13 redundant places. [2022-09-20 22:31:51,730 INFO L231 Difference]: Finished difference. Result has 192 places, 164 transitions, 1559 flow [2022-09-20 22:31:51,731 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1559, PETRI_PLACES=192, PETRI_TRANSITIONS=164} [2022-09-20 22:31:51,732 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 73 predicate places. [2022-09-20 22:31:51,732 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 164 transitions, 1559 flow [2022-09-20 22:31:51,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 85.53333333333333) internal successors, (1283), 15 states have internal predecessors, (1283), 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-09-20 22:31:51,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:51,733 INFO L208 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] [2022-09-20 22:31:51,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-09-20 22:31:51,733 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:51,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1486804359, now seen corresponding path program 1 times [2022-09-20 22:31:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:51,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449519608] [2022-09-20 22:31:51,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:51,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:51,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449519608] [2022-09-20 22:31:51,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449519608] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:51,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:51,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:31:51,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882811278] [2022-09-20 22:31:51,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:51,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:31:51,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:51,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:31:51,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:31:51,843 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-09-20 22:31:51,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 164 transitions, 1559 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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-09-20 22:31:51,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:51,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-09-20 22:31:51,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:52,782 INFO L130 PetriNetUnfolder]: 2042/4294 cut-off events. [2022-09-20 22:31:52,782 INFO L131 PetriNetUnfolder]: For 73323/73493 co-relation queries the response was YES. [2022-09-20 22:31:52,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21890 conditions, 4294 events. 2042/4294 cut-off events. For 73323/73493 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 32644 event pairs, 91 based on Foata normal form. 51/4253 useless extension candidates. Maximal degree in co-relation 21783. Up to 1209 conditions per place. [2022-09-20 22:31:52,814 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 100 selfloop transitions, 6 changer transitions 152/334 dead transitions. [2022-09-20 22:31:52,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 334 transitions, 4818 flow [2022-09-20 22:31:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:31:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:31:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 977 transitions. [2022-09-20 22:31:52,821 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8570175438596491 [2022-09-20 22:31:52,821 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 977 transitions. [2022-09-20 22:31:52,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 977 transitions. [2022-09-20 22:31:52,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:52,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 977 transitions. [2022-09-20 22:31:52,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.7) internal successors, (977), 10 states have internal predecessors, (977), 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-09-20 22:31:52,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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-09-20 22:31:52,825 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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-09-20 22:31:52,825 INFO L175 Difference]: Start difference. First operand has 192 places, 164 transitions, 1559 flow. Second operand 10 states and 977 transitions. [2022-09-20 22:31:52,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 334 transitions, 4818 flow [2022-09-20 22:31:52,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 334 transitions, 4482 flow, removed 113 selfloop flow, removed 14 redundant places. [2022-09-20 22:31:52,906 INFO L231 Difference]: Finished difference. Result has 184 places, 142 transitions, 1141 flow [2022-09-20 22:31:52,906 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1141, PETRI_PLACES=184, PETRI_TRANSITIONS=142} [2022-09-20 22:31:52,906 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 65 predicate places. [2022-09-20 22:31:52,906 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 142 transitions, 1141 flow [2022-09-20 22:31:52,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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-09-20 22:31:52,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:52,907 INFO L208 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] [2022-09-20 22:31:52,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-09-20 22:31:52,907 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2111368921, now seen corresponding path program 1 times [2022-09-20 22:31:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:52,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991524272] [2022-09-20 22:31:52,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:52,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:53,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:53,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991524272] [2022-09-20 22:31:53,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991524272] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:53,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:53,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:31:53,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373463691] [2022-09-20 22:31:53,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:53,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:31:53,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:53,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:31:53,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:31:53,021 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-09-20 22:31:53,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 142 transitions, 1141 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 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-09-20 22:31:53,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:53,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-09-20 22:31:53,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:53,568 INFO L130 PetriNetUnfolder]: 644/1722 cut-off events. [2022-09-20 22:31:53,568 INFO L131 PetriNetUnfolder]: For 22502/22505 co-relation queries the response was YES. [2022-09-20 22:31:53,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9165 conditions, 1722 events. 644/1722 cut-off events. For 22502/22505 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12064 event pairs, 36 based on Foata normal form. 77/1793 useless extension candidates. Maximal degree in co-relation 9062. Up to 416 conditions per place. [2022-09-20 22:31:53,591 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 71 selfloop transitions, 9 changer transitions 81/237 dead transitions. [2022-09-20 22:31:53,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 237 transitions, 3019 flow [2022-09-20 22:31:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:31:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:31:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 966 transitions. [2022-09-20 22:31:53,594 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8473684210526315 [2022-09-20 22:31:53,594 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 966 transitions. [2022-09-20 22:31:53,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 966 transitions. [2022-09-20 22:31:53,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:53,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 966 transitions. [2022-09-20 22:31:53,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.6) internal successors, (966), 10 states have internal predecessors, (966), 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-09-20 22:31:53,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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-09-20 22:31:53,597 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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-09-20 22:31:53,597 INFO L175 Difference]: Start difference. First operand has 184 places, 142 transitions, 1141 flow. Second operand 10 states and 966 transitions. [2022-09-20 22:31:53,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 237 transitions, 3019 flow [2022-09-20 22:31:53,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 237 transitions, 2666 flow, removed 60 selfloop flow, removed 18 redundant places. [2022-09-20 22:31:53,633 INFO L231 Difference]: Finished difference. Result has 175 places, 126 transitions, 830 flow [2022-09-20 22:31:53,634 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=830, PETRI_PLACES=175, PETRI_TRANSITIONS=126} [2022-09-20 22:31:53,634 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 56 predicate places. [2022-09-20 22:31:53,634 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 126 transitions, 830 flow [2022-09-20 22:31:53,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 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-09-20 22:31:53,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:53,635 INFO L208 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] [2022-09-20 22:31:53,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-09-20 22:31:53,635 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:53,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1536491874, now seen corresponding path program 1 times [2022-09-20 22:31:53,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:53,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73712391] [2022-09-20 22:31:53,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:53,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:54,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:54,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73712391] [2022-09-20 22:31:54,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73712391] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:54,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:54,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-09-20 22:31:54,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736779380] [2022-09-20 22:31:54,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:54,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-09-20 22:31:54,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:54,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-09-20 22:31:54,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-09-20 22:31:54,138 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-09-20 22:31:54,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 126 transitions, 830 flow. Second operand has 19 states, 19 states have (on average 83.36842105263158) internal successors, (1584), 19 states have internal predecessors, (1584), 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-09-20 22:31:54,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:54,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-09-20 22:31:54,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:54,650 INFO L130 PetriNetUnfolder]: 101/614 cut-off events. [2022-09-20 22:31:54,651 INFO L131 PetriNetUnfolder]: For 4321/4359 co-relation queries the response was YES. [2022-09-20 22:31:54,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2622 conditions, 614 events. 101/614 cut-off events. For 4321/4359 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3587 event pairs, 19 based on Foata normal form. 26/628 useless extension candidates. Maximal degree in co-relation 2514. Up to 119 conditions per place. [2022-09-20 22:31:54,657 INFO L137 encePairwiseOnDemand]: 99/114 looper letters, 35 selfloop transitions, 18 changer transitions 19/147 dead transitions. [2022-09-20 22:31:54,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 147 transitions, 1222 flow [2022-09-20 22:31:54,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-20 22:31:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-09-20 22:31:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1534 transitions. [2022-09-20 22:31:54,660 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7475633528265108 [2022-09-20 22:31:54,660 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1534 transitions. [2022-09-20 22:31:54,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1534 transitions. [2022-09-20 22:31:54,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:54,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1534 transitions. [2022-09-20 22:31:54,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.22222222222223) internal successors, (1534), 18 states have internal predecessors, (1534), 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-09-20 22:31:54,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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-09-20 22:31:54,665 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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-09-20 22:31:54,665 INFO L175 Difference]: Start difference. First operand has 175 places, 126 transitions, 830 flow. Second operand 18 states and 1534 transitions. [2022-09-20 22:31:54,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 147 transitions, 1222 flow [2022-09-20 22:31:54,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 147 transitions, 1149 flow, removed 25 selfloop flow, removed 10 redundant places. [2022-09-20 22:31:54,679 INFO L231 Difference]: Finished difference. Result has 186 places, 123 transitions, 799 flow [2022-09-20 22:31:54,680 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=799, PETRI_PLACES=186, PETRI_TRANSITIONS=123} [2022-09-20 22:31:54,680 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 67 predicate places. [2022-09-20 22:31:54,680 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 123 transitions, 799 flow [2022-09-20 22:31:54,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 83.36842105263158) internal successors, (1584), 19 states have internal predecessors, (1584), 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-09-20 22:31:54,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:54,681 INFO L208 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] [2022-09-20 22:31:54,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-09-20 22:31:54,681 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash 344439696, now seen corresponding path program 2 times [2022-09-20 22:31:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:54,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261947826] [2022-09-20 22:31:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:55,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:55,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261947826] [2022-09-20 22:31:55,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261947826] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:55,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:55,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-09-20 22:31:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937807337] [2022-09-20 22:31:55,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:55,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-20 22:31:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:55,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-20 22:31:55,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-09-20 22:31:55,182 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114 [2022-09-20 22:31:55,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 123 transitions, 799 flow. Second operand has 18 states, 18 states have (on average 83.44444444444444) internal successors, (1502), 18 states have internal predecessors, (1502), 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-09-20 22:31:55,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:55,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114 [2022-09-20 22:31:55,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:55,645 INFO L130 PetriNetUnfolder]: 87/542 cut-off events. [2022-09-20 22:31:55,645 INFO L131 PetriNetUnfolder]: For 3806/3840 co-relation queries the response was YES. [2022-09-20 22:31:55,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 542 events. 87/542 cut-off events. For 3806/3840 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3017 event pairs, 26 based on Foata normal form. 21/551 useless extension candidates. Maximal degree in co-relation 2058. Up to 131 conditions per place. [2022-09-20 22:31:55,651 INFO L137 encePairwiseOnDemand]: 99/114 looper letters, 30 selfloop transitions, 9 changer transitions 22/135 dead transitions. [2022-09-20 22:31:55,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 135 transitions, 1097 flow [2022-09-20 22:31:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-20 22:31:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-09-20 22:31:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1525 transitions. [2022-09-20 22:31:55,654 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.74317738791423 [2022-09-20 22:31:55,654 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1525 transitions. [2022-09-20 22:31:55,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1525 transitions. [2022-09-20 22:31:55,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:55,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1525 transitions. [2022-09-20 22:31:55,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 84.72222222222223) internal successors, (1525), 18 states have internal predecessors, (1525), 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-09-20 22:31:55,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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-09-20 22:31:55,659 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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-09-20 22:31:55,659 INFO L175 Difference]: Start difference. First operand has 186 places, 123 transitions, 799 flow. Second operand 18 states and 1525 transitions. [2022-09-20 22:31:55,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 135 transitions, 1097 flow [2022-09-20 22:31:55,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 135 transitions, 986 flow, removed 45 selfloop flow, removed 15 redundant places. [2022-09-20 22:31:55,674 INFO L231 Difference]: Finished difference. Result has 186 places, 111 transitions, 628 flow [2022-09-20 22:31:55,674 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=628, PETRI_PLACES=186, PETRI_TRANSITIONS=111} [2022-09-20 22:31:55,674 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 67 predicate places. [2022-09-20 22:31:55,675 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 111 transitions, 628 flow [2022-09-20 22:31:55,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 83.44444444444444) internal successors, (1502), 18 states have internal predecessors, (1502), 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-09-20 22:31:55,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:55,675 INFO L208 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] [2022-09-20 22:31:55,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-09-20 22:31:55,675 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:55,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:55,676 INFO L85 PathProgramCache]: Analyzing trace with hash 448104674, now seen corresponding path program 1 times [2022-09-20 22:31:55,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:55,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358977608] [2022-09-20 22:31:55,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:55,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:31:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:31:55,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:31:55,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358977608] [2022-09-20 22:31:55,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358977608] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:31:55,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:31:55,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:31:55,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108722574] [2022-09-20 22:31:55,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:31:55,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:31:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:31:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:31:55,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:31:55,803 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-09-20 22:31:55,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 111 transitions, 628 flow. Second operand has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 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-09-20 22:31:55,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:31:55,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-09-20 22:31:55,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:31:56,046 INFO L130 PetriNetUnfolder]: 85/382 cut-off events. [2022-09-20 22:31:56,046 INFO L131 PetriNetUnfolder]: For 2838/2842 co-relation queries the response was YES. [2022-09-20 22:31:56,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 382 events. 85/382 cut-off events. For 2838/2842 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1736 event pairs, 8 based on Foata normal form. 11/390 useless extension candidates. Maximal degree in co-relation 1604. Up to 84 conditions per place. [2022-09-20 22:31:56,050 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 34 selfloop transitions, 12 changer transitions 21/141 dead transitions. [2022-09-20 22:31:56,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 141 transitions, 1183 flow [2022-09-20 22:31:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:31:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:31:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1025 transitions. [2022-09-20 22:31:56,052 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.817384370015949 [2022-09-20 22:31:56,053 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1025 transitions. [2022-09-20 22:31:56,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1025 transitions. [2022-09-20 22:31:56,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:31:56,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1025 transitions. [2022-09-20 22:31:56,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.18181818181819) internal successors, (1025), 11 states have internal predecessors, (1025), 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-09-20 22:31:56,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 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-09-20 22:31:56,056 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 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-09-20 22:31:56,056 INFO L175 Difference]: Start difference. First operand has 186 places, 111 transitions, 628 flow. Second operand 11 states and 1025 transitions. [2022-09-20 22:31:56,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 141 transitions, 1183 flow [2022-09-20 22:31:56,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 141 transitions, 974 flow, removed 54 selfloop flow, removed 39 redundant places. [2022-09-20 22:31:56,064 INFO L231 Difference]: Finished difference. Result has 148 places, 107 transitions, 476 flow [2022-09-20 22:31:56,064 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=476, PETRI_PLACES=148, PETRI_TRANSITIONS=107} [2022-09-20 22:31:56,064 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 29 predicate places. [2022-09-20 22:31:56,064 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 107 transitions, 476 flow [2022-09-20 22:31:56,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 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-09-20 22:31:56,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:31:56,065 INFO L208 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] [2022-09-20 22:31:56,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-09-20 22:31:56,065 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 22:31:56,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:31:56,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1844556823, now seen corresponding path program 1 times [2022-09-20 22:31:56,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:31:56,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821762706] [2022-09-20 22:31:56,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:31:56,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:31:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:31:56,138 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 22:31:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:31:56,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 22:31:56,244 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 22:31:56,245 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-09-20 22:31:56,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-09-20 22:31:56,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-09-20 22:31:56,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-09-20 22:31:56,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-09-20 22:31:56,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-09-20 22:31:56,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-09-20 22:31:56,249 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:31:56,255 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 22:31:56,255 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 22:31:56,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 10:31:56 BasicIcfg [2022-09-20 22:31:56,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 22:31:56,399 INFO L158 Benchmark]: Toolchain (without parser) took 25428.62ms. Allocated memory was 189.8MB in the beginning and 691.0MB in the end (delta: 501.2MB). Free memory was 159.1MB in the beginning and 563.3MB in the end (delta: -404.2MB). Peak memory consumption was 96.2MB. Max. memory is 8.0GB. [2022-09-20 22:31:56,399 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 189.8MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 22:31:56,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.42ms. Allocated memory was 189.8MB in the beginning and 285.2MB in the end (delta: 95.4MB). Free memory was 158.8MB in the beginning and 238.4MB in the end (delta: -79.5MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. [2022-09-20 22:31:56,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.23ms. Allocated memory is still 285.2MB. Free memory was 238.0MB in the beginning and 235.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 22:31:56,400 INFO L158 Benchmark]: Boogie Preprocessor took 59.91ms. Allocated memory is still 285.2MB. Free memory was 234.8MB in the beginning and 232.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 22:31:56,400 INFO L158 Benchmark]: RCFGBuilder took 1555.62ms. Allocated memory is still 285.2MB. Free memory was 232.1MB in the beginning and 179.0MB in the end (delta: 53.1MB). Peak memory consumption was 86.1MB. Max. memory is 8.0GB. [2022-09-20 22:31:56,401 INFO L158 Benchmark]: TraceAbstraction took 23182.34ms. Allocated memory was 285.2MB in the beginning and 691.0MB in the end (delta: 405.8MB). Free memory was 178.4MB in the beginning and 563.3MB in the end (delta: -384.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-09-20 22:31:56,402 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 189.8MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 571.42ms. Allocated memory was 189.8MB in the beginning and 285.2MB in the end (delta: 95.4MB). Free memory was 158.8MB in the beginning and 238.4MB in the end (delta: -79.5MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.23ms. Allocated memory is still 285.2MB. Free memory was 238.0MB in the beginning and 235.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.91ms. Allocated memory is still 285.2MB. Free memory was 234.8MB in the beginning and 232.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1555.62ms. Allocated memory is still 285.2MB. Free memory was 232.1MB in the beginning and 179.0MB in the end (delta: 53.1MB). Peak memory consumption was 86.1MB. Max. memory is 8.0GB. * TraceAbstraction took 23182.34ms. Allocated memory was 285.2MB in the beginning and 691.0MB in the end (delta: 405.8MB). Free memory was 178.4MB in the beginning and 563.3MB in the end (delta: -384.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 0 pthread_t t1873; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873, ((void *)0), P0, ((void *)0))=-2, t1873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1874; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1874, ((void *)0), P1, ((void *)0))=-1, t1873={5:0}, t1874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1875; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1875, ((void *)0), P2, ((void *)0))=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L867] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L868] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L869] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L870] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L871] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L877] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1332 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1332 mSDsluCounter, 1289 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1956 mSDsCounter, 755 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3859 IncrementalHoareTripleChecker+Invalid, 4614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 755 mSolverCounterUnsat, 232 mSDtfsCounter, 3859 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1559occurred in iteration=18, InterpolantAutomatonStates: 311, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1905 NumberOfCodeBlocks, 1905 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1794 ConstructedInterpolants, 0 QuantifiedInterpolants, 13707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-09-20 22:31:56,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...