/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:11:34,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:11:34,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:11:34,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:11:34,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:11:34,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:11:34,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:11:34,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:11:34,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:11:34,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:11:34,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:11:34,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:11:34,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:11:34,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:11:34,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:11:34,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:11:34,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:11:34,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:11:34,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:11:34,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:11:34,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:11:34,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:11:34,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:11:34,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:11:34,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:11:34,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:11:34,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:11:34,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:11:34,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:11:34,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:11:34,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:11:34,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:11:34,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:11:34,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:11:34,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:11:34,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:11:34,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:11:34,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:11:34,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:11:34,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:11:34,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:11:34,674 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-VariableLbe.epf [2023-01-27 18:11:34,704 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:11:34,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:11:34,705 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:11:34,705 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:11:34,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:11:34,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:11:34,706 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:11:34,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:11:34,706 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:11:34,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:11:34,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:11:34,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:11:34,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:11:34,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:11:34,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:11:34,707 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:11:34,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:11:34,707 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:11:34,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:11:34,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:11:34,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:11:34,708 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:11:34,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:11:34,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:11:34,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:11:34,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:11:34,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:11:34,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:11:34,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:11:34,708 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:11:34,708 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:11:34,709 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 18:11:34,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:11:34,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:11:34,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:11:34,913 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:11:34,913 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:11:34,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-01-27 18:11:35,913 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:11:36,088 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:11:36,089 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-01-27 18:11:36,097 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa1f4e75/62aba4bc2362412b8c5824b146843f3a/FLAG9440413ae [2023-01-27 18:11:36,107 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa1f4e75/62aba4bc2362412b8c5824b146843f3a [2023-01-27 18:11:36,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:11:36,110 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:11:36,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:11:36,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:11:36,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:11:36,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae3008d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36, skipping insertion in model container [2023-01-27 18:11:36,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:11:36,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:11:36,252 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i[956,969] [2023-01-27 18:11:36,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:11:36,402 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:11:36,412 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i[956,969] [2023-01-27 18:11:36,456 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:11:36,480 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:11:36,481 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:11:36,486 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:11:36,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36 WrapperNode [2023-01-27 18:11:36,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:11:36,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:11:36,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:11:36,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:11:36,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,548 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2023-01-27 18:11:36,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:11:36,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:11:36,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:11:36,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:11:36,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,584 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:11:36,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:11:36,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:11:36,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:11:36,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36" (1/1) ... [2023-01-27 18:11:36,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:11:36,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:11:36,627 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) [2023-01-27 18:11:36,649 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 [2023-01-27 18:11:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:11:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:11:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:11:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:11:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:11:36,656 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:11:36,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:11:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:11:36,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:11:36,657 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:11:36,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:11:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:11:36,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:11:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:11:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:11:36,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:11:36,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:11:36,659 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:11:36,813 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:11:36,814 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:11:37,049 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:11:37,151 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:11:37,151 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:11:37,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:11:37 BoogieIcfgContainer [2023-01-27 18:11:37,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:11:37,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:11:37,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:11:37,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:11:37,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:11:36" (1/3) ... [2023-01-27 18:11:37,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199a784f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:11:37, skipping insertion in model container [2023-01-27 18:11:37,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:36" (2/3) ... [2023-01-27 18:11:37,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199a784f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:11:37, skipping insertion in model container [2023-01-27 18:11:37,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:11:37" (3/3) ... [2023-01-27 18:11:37,162 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2023-01-27 18:11:37,174 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:11:37,175 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:11:37,175 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:11:37,239 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:11:37,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-01-27 18:11:37,328 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-01-27 18:11:37,328 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:11:37,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-01-27 18:11:37,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-01-27 18:11:37,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-01-27 18:11:37,345 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:11:37,355 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-01-27 18:11:37,357 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-01-27 18:11:37,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-01-27 18:11:37,385 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-01-27 18:11:37,385 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:11:37,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-01-27 18:11:37,391 INFO L119 LiptonReduction]: Number of co-enabled transitions 2816 [2023-01-27 18:11:40,830 INFO L134 LiptonReduction]: Checked pairs total: 6618 [2023-01-27 18:11:40,831 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-01-27 18:11:40,841 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:11:40,845 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;@436e2843, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:11:40,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:11:40,849 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-01-27 18:11:40,849 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:11:40,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:40,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:40,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:40,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:40,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1003899835, now seen corresponding path program 1 times [2023-01-27 18:11:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:40,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797402327] [2023-01-27 18:11:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:40,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:41,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:41,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797402327] [2023-01-27 18:11:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797402327] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:41,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:41,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:11:41,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181822985] [2023-01-27 18:11:41,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:41,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:11:41,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:41,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:11:41,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:11:41,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 243 [2023-01-27 18:11:41,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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) [2023-01-27 18:11:41,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:41,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 243 [2023-01-27 18:11:41,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:41,649 INFO L130 PetriNetUnfolder]: 2594/3778 cut-off events. [2023-01-27 18:11:41,650 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-01-27 18:11:41,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7473 conditions, 3778 events. 2594/3778 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19435 event pairs, 518 based on Foata normal form. 0/3594 useless extension candidates. Maximal degree in co-relation 7461. Up to 2797 conditions per place. [2023-01-27 18:11:41,670 INFO L137 encePairwiseOnDemand]: 239/243 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-01-27 18:11:41,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 154 flow [2023-01-27 18:11:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:11:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:11:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2023-01-27 18:11:41,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5363511659807956 [2023-01-27 18:11:41,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2023-01-27 18:11:41,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2023-01-27 18:11:41,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:41,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2023-01-27 18:11:41,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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) [2023-01-27 18:11:41,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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) [2023-01-27 18:11:41,698 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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) [2023-01-27 18:11:41,700 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 391 transitions. [2023-01-27 18:11:41,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 154 flow [2023-01-27 18:11:41,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:11:41,706 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-01-27 18:11:41,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-01-27 18:11:41,711 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-01-27 18:11:41,711 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-01-27 18:11:41,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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) [2023-01-27 18:11:41,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:41,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:41,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:11:41,712 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:41,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:41,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1619982989, now seen corresponding path program 1 times [2023-01-27 18:11:41,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:41,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827384312] [2023-01-27 18:11:41,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:41,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:41,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:41,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827384312] [2023-01-27 18:11:41,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827384312] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:42,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:42,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:11:42,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111313093] [2023-01-27 18:11:42,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:42,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:11:42,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:42,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:11:42,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:11:42,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-01-27 18:11:42,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2023-01-27 18:11:42,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:42,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-01-27 18:11:42,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:42,440 INFO L130 PetriNetUnfolder]: 4631/6320 cut-off events. [2023-01-27 18:11:42,440 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2023-01-27 18:11:42,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13062 conditions, 6320 events. 4631/6320 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 27184 event pairs, 1783 based on Foata normal form. 16/6336 useless extension candidates. Maximal degree in co-relation 13052. Up to 6129 conditions per place. [2023-01-27 18:11:42,473 INFO L137 encePairwiseOnDemand]: 237/243 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2023-01-27 18:11:42,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 184 flow [2023-01-27 18:11:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:11:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:11:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-01-27 18:11:42,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2023-01-27 18:11:42,474 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-01-27 18:11:42,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-01-27 18:11:42,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:42,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-01-27 18:11:42,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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) [2023-01-27 18:11:42,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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) [2023-01-27 18:11:42,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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) [2023-01-27 18:11:42,478 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 369 transitions. [2023-01-27 18:11:42,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 184 flow [2023-01-27 18:11:42,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:42,480 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 91 flow [2023-01-27 18:11:42,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-01-27 18:11:42,481 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-01-27 18:11:42,481 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 91 flow [2023-01-27 18:11:42,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2023-01-27 18:11:42,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:42,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:42,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:11:42,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:42,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:42,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1539406417, now seen corresponding path program 1 times [2023-01-27 18:11:42,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:42,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60227176] [2023-01-27 18:11:42,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:42,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:42,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:42,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60227176] [2023-01-27 18:11:42,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60227176] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:42,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:42,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:11:42,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258932092] [2023-01-27 18:11:42,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:42,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:11:42,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:42,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:11:42,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:11:42,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-01-27 18:11:42,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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) [2023-01-27 18:11:42,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:42,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-01-27 18:11:42,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:43,098 INFO L130 PetriNetUnfolder]: 4279/5856 cut-off events. [2023-01-27 18:11:43,098 INFO L131 PetriNetUnfolder]: For 1104/1104 co-relation queries the response was YES. [2023-01-27 18:11:43,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13635 conditions, 5856 events. 4279/5856 cut-off events. For 1104/1104 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 24435 event pairs, 1331 based on Foata normal form. 112/5968 useless extension candidates. Maximal degree in co-relation 13624. Up to 4033 conditions per place. [2023-01-27 18:11:43,124 INFO L137 encePairwiseOnDemand]: 240/243 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-01-27 18:11:43,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 199 flow [2023-01-27 18:11:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:11:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:11:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-01-27 18:11:43,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4993141289437586 [2023-01-27 18:11:43,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-01-27 18:11:43,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-01-27 18:11:43,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:43,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-01-27 18:11:43,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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) [2023-01-27 18:11:43,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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) [2023-01-27 18:11:43,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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) [2023-01-27 18:11:43,128 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 91 flow. Second operand 3 states and 364 transitions. [2023-01-27 18:11:43,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 199 flow [2023-01-27 18:11:43,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:11:43,130 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 97 flow [2023-01-27 18:11:43,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-01-27 18:11:43,131 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-01-27 18:11:43,133 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 97 flow [2023-01-27 18:11:43,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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) [2023-01-27 18:11:43,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:43,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:43,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:11:43,134 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:43,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:43,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2022970814, now seen corresponding path program 1 times [2023-01-27 18:11:43,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:43,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115852950] [2023-01-27 18:11:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:43,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:43,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:43,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115852950] [2023-01-27 18:11:43,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115852950] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:43,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:43,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:11:43,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900554167] [2023-01-27 18:11:43,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:43,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:11:43,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:43,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:11:43,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:11:43,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-01-27 18:11:43,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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) [2023-01-27 18:11:43,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:43,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-01-27 18:11:43,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:43,665 INFO L130 PetriNetUnfolder]: 2651/3959 cut-off events. [2023-01-27 18:11:43,665 INFO L131 PetriNetUnfolder]: For 1112/1112 co-relation queries the response was YES. [2023-01-27 18:11:43,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9297 conditions, 3959 events. 2651/3959 cut-off events. For 1112/1112 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20788 event pairs, 526 based on Foata normal form. 296/4148 useless extension candidates. Maximal degree in co-relation 9284. Up to 2616 conditions per place. [2023-01-27 18:11:43,687 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 55 selfloop transitions, 9 changer transitions 2/71 dead transitions. [2023-01-27 18:11:43,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 71 transitions, 347 flow [2023-01-27 18:11:43,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:11:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:11:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-01-27 18:11:43,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012345679012346 [2023-01-27 18:11:43,691 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-01-27 18:11:43,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-01-27 18:11:43,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:43,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-01-27 18:11:43,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 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) [2023-01-27 18:11:43,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 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) [2023-01-27 18:11:43,696 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 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) [2023-01-27 18:11:43,697 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 97 flow. Second operand 5 states and 609 transitions. [2023-01-27 18:11:43,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 71 transitions, 347 flow [2023-01-27 18:11:43,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 71 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:43,700 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 160 flow [2023-01-27 18:11:43,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-01-27 18:11:43,701 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-01-27 18:11:43,701 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 160 flow [2023-01-27 18:11:43,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 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) [2023-01-27 18:11:43,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:43,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:43,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:11:43,702 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:43,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:43,702 INFO L85 PathProgramCache]: Analyzing trace with hash 736850738, now seen corresponding path program 1 times [2023-01-27 18:11:43,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:43,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883198105] [2023-01-27 18:11:43,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:43,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:43,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:43,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883198105] [2023-01-27 18:11:43,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883198105] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:43,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:43,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:43,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834499972] [2023-01-27 18:11:43,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:43,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:43,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:43,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:43,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:43,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-01-27 18:11:43,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 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) [2023-01-27 18:11:43,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:43,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-01-27 18:11:43,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:44,212 INFO L130 PetriNetUnfolder]: 2020/3158 cut-off events. [2023-01-27 18:11:44,213 INFO L131 PetriNetUnfolder]: For 1908/1925 co-relation queries the response was YES. [2023-01-27 18:11:44,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9717 conditions, 3158 events. 2020/3158 cut-off events. For 1908/1925 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16957 event pairs, 237 based on Foata normal form. 221/3297 useless extension candidates. Maximal degree in co-relation 9701. Up to 1181 conditions per place. [2023-01-27 18:11:44,227 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 73 selfloop transitions, 17 changer transitions 2/97 dead transitions. [2023-01-27 18:11:44,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 97 transitions, 554 flow [2023-01-27 18:11:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:11:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:11:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2023-01-27 18:11:44,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014697236919459 [2023-01-27 18:11:44,229 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2023-01-27 18:11:44,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2023-01-27 18:11:44,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:44,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2023-01-27 18:11:44,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 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) [2023-01-27 18:11:44,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 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) [2023-01-27 18:11:44,234 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 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) [2023-01-27 18:11:44,234 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 160 flow. Second operand 7 states and 853 transitions. [2023-01-27 18:11:44,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 97 transitions, 554 flow [2023-01-27 18:11:44,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 97 transitions, 549 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:11:44,241 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 276 flow [2023-01-27 18:11:44,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-01-27 18:11:44,241 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2023-01-27 18:11:44,241 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 276 flow [2023-01-27 18:11:44,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 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) [2023-01-27 18:11:44,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:44,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:44,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:11:44,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:44,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:44,242 INFO L85 PathProgramCache]: Analyzing trace with hash -877860807, now seen corresponding path program 1 times [2023-01-27 18:11:44,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:44,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475201415] [2023-01-27 18:11:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:44,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:44,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:44,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475201415] [2023-01-27 18:11:44,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475201415] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:44,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:44,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:11:44,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160898379] [2023-01-27 18:11:44,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:44,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:11:44,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:44,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:11:44,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:11:44,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-01-27 18:11:44,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 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) [2023-01-27 18:11:44,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:44,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-01-27 18:11:44,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:44,702 INFO L130 PetriNetUnfolder]: 1713/2724 cut-off events. [2023-01-27 18:11:44,702 INFO L131 PetriNetUnfolder]: For 3988/4022 co-relation queries the response was YES. [2023-01-27 18:11:44,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9893 conditions, 2724 events. 1713/2724 cut-off events. For 3988/4022 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14660 event pairs, 186 based on Foata normal form. 109/2761 useless extension candidates. Maximal degree in co-relation 9873. Up to 1019 conditions per place. [2023-01-27 18:11:44,713 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 80 selfloop transitions, 25 changer transitions 11/121 dead transitions. [2023-01-27 18:11:44,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 121 transitions, 812 flow [2023-01-27 18:11:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:11:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:11:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1095 transitions. [2023-01-27 18:11:44,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006858710562414 [2023-01-27 18:11:44,715 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1095 transitions. [2023-01-27 18:11:44,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1095 transitions. [2023-01-27 18:11:44,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:44,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1095 transitions. [2023-01-27 18:11:44,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 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) [2023-01-27 18:11:44,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 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) [2023-01-27 18:11:44,720 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 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) [2023-01-27 18:11:44,720 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 276 flow. Second operand 9 states and 1095 transitions. [2023-01-27 18:11:44,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 121 transitions, 812 flow [2023-01-27 18:11:44,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 121 transitions, 767 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-01-27 18:11:44,772 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 392 flow [2023-01-27 18:11:44,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=392, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-01-27 18:11:44,774 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-01-27 18:11:44,774 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 392 flow [2023-01-27 18:11:44,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 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) [2023-01-27 18:11:44,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:44,774 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] [2023-01-27 18:11:44,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:11:44,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:44,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:44,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1357778138, now seen corresponding path program 1 times [2023-01-27 18:11:44,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:44,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665831909] [2023-01-27 18:11:44,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:44,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:44,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665831909] [2023-01-27 18:11:44,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665831909] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:44,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:44,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:11:44,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847036880] [2023-01-27 18:11:44,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:44,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:11:44,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:44,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:11:44,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:11:44,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 243 [2023-01-27 18:11:44,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 392 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 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) [2023-01-27 18:11:44,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:44,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 243 [2023-01-27 18:11:44,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:45,362 INFO L130 PetriNetUnfolder]: 3367/5082 cut-off events. [2023-01-27 18:11:45,363 INFO L131 PetriNetUnfolder]: For 11472/11472 co-relation queries the response was YES. [2023-01-27 18:11:45,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18383 conditions, 5082 events. 3367/5082 cut-off events. For 11472/11472 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 26874 event pairs, 159 based on Foata normal form. 10/5092 useless extension candidates. Maximal degree in co-relation 18360. Up to 3124 conditions per place. [2023-01-27 18:11:45,382 INFO L137 encePairwiseOnDemand]: 235/243 looper letters, 87 selfloop transitions, 14 changer transitions 37/138 dead transitions. [2023-01-27 18:11:45,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 138 transitions, 1286 flow [2023-01-27 18:11:45,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:11:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:11:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-01-27 18:11:45,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004115226337449 [2023-01-27 18:11:45,384 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-01-27 18:11:45,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-01-27 18:11:45,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:45,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-01-27 18:11:45,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:45,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 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) [2023-01-27 18:11:45,387 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 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) [2023-01-27 18:11:45,387 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 392 flow. Second operand 5 states and 608 transitions. [2023-01-27 18:11:45,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 138 transitions, 1286 flow [2023-01-27 18:11:45,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 138 transitions, 1050 flow, removed 82 selfloop flow, removed 4 redundant places. [2023-01-27 18:11:45,486 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 321 flow [2023-01-27 18:11:45,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2023-01-27 18:11:45,486 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 23 predicate places. [2023-01-27 18:11:45,486 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 321 flow [2023-01-27 18:11:45,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 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) [2023-01-27 18:11:45,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:45,487 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] [2023-01-27 18:11:45,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:11:45,487 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:45,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:45,487 INFO L85 PathProgramCache]: Analyzing trace with hash 908715518, now seen corresponding path program 2 times [2023-01-27 18:11:45,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:45,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294376415] [2023-01-27 18:11:45,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:45,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:45,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:45,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294376415] [2023-01-27 18:11:45,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294376415] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:45,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:45,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:11:45,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278423086] [2023-01-27 18:11:45,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:45,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:11:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:45,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:11:45,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:11:45,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 243 [2023-01-27 18:11:45,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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) [2023-01-27 18:11:45,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:45,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 243 [2023-01-27 18:11:45,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:45,926 INFO L130 PetriNetUnfolder]: 1698/2807 cut-off events. [2023-01-27 18:11:45,927 INFO L131 PetriNetUnfolder]: For 5585/5601 co-relation queries the response was YES. [2023-01-27 18:11:45,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10456 conditions, 2807 events. 1698/2807 cut-off events. For 5585/5601 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15190 event pairs, 277 based on Foata normal form. 10/2796 useless extension candidates. Maximal degree in co-relation 10429. Up to 1417 conditions per place. [2023-01-27 18:11:45,940 INFO L137 encePairwiseOnDemand]: 240/243 looper letters, 69 selfloop transitions, 2 changer transitions 31/108 dead transitions. [2023-01-27 18:11:45,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 108 transitions, 885 flow [2023-01-27 18:11:45,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:11:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:11:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-01-27 18:11:45,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267489711934157 [2023-01-27 18:11:45,942 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-01-27 18:11:45,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-01-27 18:11:45,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:45,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-01-27 18:11:45,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-01-27 18:11:45,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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) [2023-01-27 18:11:45,945 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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) [2023-01-27 18:11:45,945 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 321 flow. Second operand 4 states and 512 transitions. [2023-01-27 18:11:45,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 108 transitions, 885 flow [2023-01-27 18:11:45,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 108 transitions, 835 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-01-27 18:11:45,964 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 314 flow [2023-01-27 18:11:45,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2023-01-27 18:11:45,966 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2023-01-27 18:11:45,966 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 314 flow [2023-01-27 18:11:45,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 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) [2023-01-27 18:11:45,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:45,966 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] [2023-01-27 18:11:45,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:11:45,966 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:45,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:45,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1908270974, now seen corresponding path program 3 times [2023-01-27 18:11:45,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:45,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569367981] [2023-01-27 18:11:45,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:45,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:46,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:46,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569367981] [2023-01-27 18:11:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569367981] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:46,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:46,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:11:46,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918531669] [2023-01-27 18:11:46,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:46,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:11:46,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:46,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:11:46,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:11:46,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-01-27 18:11:46,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 314 flow. Second operand has 7 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 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) [2023-01-27 18:11:46,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:46,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-01-27 18:11:46,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:46,446 INFO L130 PetriNetUnfolder]: 1406/2285 cut-off events. [2023-01-27 18:11:46,447 INFO L131 PetriNetUnfolder]: For 3852/4108 co-relation queries the response was YES. [2023-01-27 18:11:46,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8258 conditions, 2285 events. 1406/2285 cut-off events. For 3852/4108 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12438 event pairs, 211 based on Foata normal form. 142/2342 useless extension candidates. Maximal degree in co-relation 8233. Up to 810 conditions per place. [2023-01-27 18:11:46,456 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 60 selfloop transitions, 18 changer transitions 18/103 dead transitions. [2023-01-27 18:11:46,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 768 flow [2023-01-27 18:11:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:11:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:11:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 953 transitions. [2023-01-27 18:11:46,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49022633744855965 [2023-01-27 18:11:46,459 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 953 transitions. [2023-01-27 18:11:46,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 953 transitions. [2023-01-27 18:11:46,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:46,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 953 transitions. [2023-01-27 18:11:46,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 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) [2023-01-27 18:11:46,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 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) [2023-01-27 18:11:46,464 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 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) [2023-01-27 18:11:46,464 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 314 flow. Second operand 8 states and 953 transitions. [2023-01-27 18:11:46,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 768 flow [2023-01-27 18:11:46,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 730 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:46,487 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 333 flow [2023-01-27 18:11:46,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=333, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-01-27 18:11:46,487 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2023-01-27 18:11:46,487 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 333 flow [2023-01-27 18:11:46,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 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) [2023-01-27 18:11:46,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:46,488 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] [2023-01-27 18:11:46,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:11:46,488 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:46,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:46,489 INFO L85 PathProgramCache]: Analyzing trace with hash 389092515, now seen corresponding path program 1 times [2023-01-27 18:11:46,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:46,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958699664] [2023-01-27 18:11:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:46,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:46,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:46,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958699664] [2023-01-27 18:11:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958699664] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:46,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:11:46,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312072488] [2023-01-27 18:11:46,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:46,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:11:46,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:46,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:11:46,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:11:46,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 243 [2023-01-27 18:11:46,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 333 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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) [2023-01-27 18:11:46,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:46,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 243 [2023-01-27 18:11:46,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:46,876 INFO L130 PetriNetUnfolder]: 1240/2070 cut-off events. [2023-01-27 18:11:46,876 INFO L131 PetriNetUnfolder]: For 5224/5271 co-relation queries the response was YES. [2023-01-27 18:11:46,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8228 conditions, 2070 events. 1240/2070 cut-off events. For 5224/5271 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10907 event pairs, 245 based on Foata normal form. 3/2060 useless extension candidates. Maximal degree in co-relation 8206. Up to 1195 conditions per place. [2023-01-27 18:11:46,884 INFO L137 encePairwiseOnDemand]: 240/243 looper letters, 40 selfloop transitions, 1 changer transitions 58/102 dead transitions. [2023-01-27 18:11:46,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 102 transitions, 904 flow [2023-01-27 18:11:46,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:11:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:11:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2023-01-27 18:11:46,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216049382716049 [2023-01-27 18:11:46,886 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2023-01-27 18:11:46,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2023-01-27 18:11:46,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:46,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2023-01-27 18:11:46,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 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) [2023-01-27 18:11:46,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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) [2023-01-27 18:11:46,888 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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) [2023-01-27 18:11:46,889 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 333 flow. Second operand 4 states and 507 transitions. [2023-01-27 18:11:46,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 102 transitions, 904 flow [2023-01-27 18:11:46,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 745 flow, removed 38 selfloop flow, removed 9 redundant places. [2023-01-27 18:11:46,904 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 217 flow [2023-01-27 18:11:46,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2023-01-27 18:11:46,906 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-01-27 18:11:46,906 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 217 flow [2023-01-27 18:11:46,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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) [2023-01-27 18:11:46,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:46,906 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] [2023-01-27 18:11:46,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:11:46,906 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:46,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:46,907 INFO L85 PathProgramCache]: Analyzing trace with hash 579551729, now seen corresponding path program 2 times [2023-01-27 18:11:46,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:46,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072552980] [2023-01-27 18:11:46,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:46,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:47,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:47,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072552980] [2023-01-27 18:11:47,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072552980] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:47,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:47,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:11:47,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230712896] [2023-01-27 18:11:47,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:47,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:11:47,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:47,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:11:47,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:11:47,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 243 [2023-01-27 18:11:47,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 217 flow. Second operand has 8 states, 8 states have (on average 106.125) internal successors, (849), 8 states have internal predecessors, (849), 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) [2023-01-27 18:11:47,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:47,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 243 [2023-01-27 18:11:47,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:47,452 INFO L130 PetriNetUnfolder]: 719/1223 cut-off events. [2023-01-27 18:11:47,452 INFO L131 PetriNetUnfolder]: For 2292/2292 co-relation queries the response was YES. [2023-01-27 18:11:47,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4435 conditions, 1223 events. 719/1223 cut-off events. For 2292/2292 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5664 event pairs, 78 based on Foata normal form. 1/1224 useless extension candidates. Maximal degree in co-relation 4416. Up to 535 conditions per place. [2023-01-27 18:11:47,456 INFO L137 encePairwiseOnDemand]: 235/243 looper letters, 43 selfloop transitions, 4 changer transitions 59/106 dead transitions. [2023-01-27 18:11:47,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 106 transitions, 773 flow [2023-01-27 18:11:47,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 18:11:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 18:11:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1208 transitions. [2023-01-27 18:11:47,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45192667414889637 [2023-01-27 18:11:47,459 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1208 transitions. [2023-01-27 18:11:47,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1208 transitions. [2023-01-27 18:11:47,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:47,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1208 transitions. [2023-01-27 18:11:47,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 109.81818181818181) internal successors, (1208), 11 states have internal predecessors, (1208), 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) [2023-01-27 18:11:47,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 243.0) internal successors, (2916), 12 states have internal predecessors, (2916), 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) [2023-01-27 18:11:47,465 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 243.0) internal successors, (2916), 12 states have internal predecessors, (2916), 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) [2023-01-27 18:11:47,465 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 217 flow. Second operand 11 states and 1208 transitions. [2023-01-27 18:11:47,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 106 transitions, 773 flow [2023-01-27 18:11:47,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 106 transitions, 753 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-01-27 18:11:47,474 INFO L231 Difference]: Finished difference. Result has 66 places, 37 transitions, 197 flow [2023-01-27 18:11:47,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=197, PETRI_PLACES=66, PETRI_TRANSITIONS=37} [2023-01-27 18:11:47,475 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2023-01-27 18:11:47,475 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 37 transitions, 197 flow [2023-01-27 18:11:47,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.125) internal successors, (849), 8 states have internal predecessors, (849), 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) [2023-01-27 18:11:47,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:47,475 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] [2023-01-27 18:11:47,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:11:47,476 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:47,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash -406113433, now seen corresponding path program 3 times [2023-01-27 18:11:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:47,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996461286] [2023-01-27 18:11:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:47,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:47,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996461286] [2023-01-27 18:11:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996461286] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:47,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:47,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:47,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451367077] [2023-01-27 18:11:47,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:47,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:11:47,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:47,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:11:47,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:11:47,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-01-27 18:11:47,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 37 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 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) [2023-01-27 18:11:47,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:47,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-01-27 18:11:47,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:48,072 INFO L130 PetriNetUnfolder]: 413/733 cut-off events. [2023-01-27 18:11:48,073 INFO L131 PetriNetUnfolder]: For 1529/1537 co-relation queries the response was YES. [2023-01-27 18:11:48,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2796 conditions, 733 events. 413/733 cut-off events. For 1529/1537 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3402 event pairs, 83 based on Foata normal form. 1/691 useless extension candidates. Maximal degree in co-relation 2776. Up to 299 conditions per place. [2023-01-27 18:11:48,075 INFO L137 encePairwiseOnDemand]: 237/243 looper letters, 39 selfloop transitions, 4 changer transitions 26/72 dead transitions. [2023-01-27 18:11:48,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 528 flow [2023-01-27 18:11:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:11:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:11:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 817 transitions. [2023-01-27 18:11:48,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48030570252792476 [2023-01-27 18:11:48,077 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 817 transitions. [2023-01-27 18:11:48,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 817 transitions. [2023-01-27 18:11:48,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:48,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 817 transitions. [2023-01-27 18:11:48,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 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) [2023-01-27 18:11:48,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 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) [2023-01-27 18:11:48,081 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 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) [2023-01-27 18:11:48,081 INFO L175 Difference]: Start difference. First operand has 66 places, 37 transitions, 197 flow. Second operand 7 states and 817 transitions. [2023-01-27 18:11:48,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 528 flow [2023-01-27 18:11:48,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 512 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-01-27 18:11:48,086 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 196 flow [2023-01-27 18:11:48,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=196, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2023-01-27 18:11:48,086 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2023-01-27 18:11:48,086 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 196 flow [2023-01-27 18:11:48,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 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) [2023-01-27 18:11:48,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:48,087 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] [2023-01-27 18:11:48,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:11:48,087 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:11:48,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1069484495, now seen corresponding path program 4 times [2023-01-27 18:11:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:48,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330719138] [2023-01-27 18:11:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:11:48,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:11:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:11:48,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:11:48,158 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:11:48,159 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:11:48,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:11:48,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:11:48,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:11:48,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:11:48,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:11:48,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:11:48,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:11:48,161 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:48,165 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:11:48,165 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:11:48,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:11:48 BasicIcfg [2023-01-27 18:11:48,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:11:48,240 INFO L158 Benchmark]: Toolchain (without parser) took 12130.18ms. Allocated memory was 369.1MB in the beginning and 645.9MB in the end (delta: 276.8MB). Free memory was 326.1MB in the beginning and 257.8MB in the end (delta: 68.3MB). Peak memory consumption was 345.5MB. Max. memory is 16.0GB. [2023-01-27 18:11:48,240 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:11:48,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.76ms. Allocated memory is still 369.1MB. Free memory was 325.7MB in the beginning and 302.9MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:11:48,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.03ms. Allocated memory is still 369.1MB. Free memory was 302.9MB in the beginning and 300.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:11:48,241 INFO L158 Benchmark]: Boogie Preprocessor took 39.40ms. Allocated memory is still 369.1MB. Free memory was 300.6MB in the beginning and 298.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:11:48,241 INFO L158 Benchmark]: RCFGBuilder took 564.56ms. Allocated memory is still 369.1MB. Free memory was 298.5MB in the beginning and 264.5MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-01-27 18:11:48,241 INFO L158 Benchmark]: TraceAbstraction took 11084.66ms. Allocated memory was 369.1MB in the beginning and 645.9MB in the end (delta: 276.8MB). Free memory was 264.1MB in the beginning and 257.8MB in the end (delta: 6.3MB). Peak memory consumption was 284.7MB. Max. memory is 16.0GB. [2023-01-27 18:11:48,242 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.12ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 375.76ms. Allocated memory is still 369.1MB. Free memory was 325.7MB in the beginning and 302.9MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.03ms. Allocated memory is still 369.1MB. Free memory was 302.9MB in the beginning and 300.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.40ms. Allocated memory is still 369.1MB. Free memory was 300.6MB in the beginning and 298.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 564.56ms. Allocated memory is still 369.1MB. Free memory was 298.5MB in the beginning and 264.5MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 11084.66ms. Allocated memory was 369.1MB in the beginning and 645.9MB in the end (delta: 276.8MB). Free memory was 264.1MB in the beginning and 257.8MB in the end (delta: 6.3MB). Peak memory consumption was 284.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 138 PlacesBefore, 40 PlacesAfterwards, 127 TransitionsBefore, 28 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 6618 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3745, independent: 3545, independent conditional: 0, independent unconditional: 3545, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1622, independent: 1588, independent conditional: 0, independent unconditional: 1588, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3745, independent: 1957, independent conditional: 0, independent unconditional: 1957, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 1622, unknown conditional: 0, unknown unconditional: 1622] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t949, ((void *)0), P0, ((void *)0))=-3, t949={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t950, ((void *)0), P1, ((void *)0))=-2, t949={5:0}, t950={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t951, ((void *)0), P2, ((void *)0))=-1, t949={5:0}, t950={6:0}, t951={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t952, ((void *)0), P3, ((void *)0))=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - 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: 863]: 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: 859]: 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: 861]: 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: 865]: 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 9 procedures, 166 locations, 7 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: 10.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 390 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 390 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1193 IncrementalHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 20 mSDtfsCounter, 1193 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=6, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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! [2023-01-27 18:11:48,259 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...