/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/thin002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:21:50,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:21:50,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:21:50,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:21:50,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:21:50,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:21:50,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:21:50,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:21:50,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:21:50,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:21:50,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:21:50,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:21:50,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:21:50,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:21:50,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:21:50,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:21:50,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:21:50,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:21:50,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:21:50,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:21:50,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:21:50,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:21:50,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:21:50,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:21:50,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:21:50,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:21:50,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:21:50,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:21:50,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:21:50,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:21:50,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:21:50,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:21:50,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:21:50,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:21:50,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:21:50,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:21:50,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:21:50,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:21:50,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:21:50,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:21:50,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:21:50,066 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:21:50,089 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:21:50,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:21:50,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:21:50,091 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:21:50,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:21:50,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:21:50,091 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:21:50,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:21:50,092 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:21:50,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:21:50,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:21:50,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:21:50,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:21:50,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:21:50,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:21:50,093 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:21:50,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:21:50,093 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:21:50,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:21:50,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:21:50,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:21:50,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:21:50,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:21:50,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:21:50,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:21:50,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:21:50,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:21:50,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:21:50,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:21:50,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:21:50,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:21:50,094 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:21:50,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:21:50,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:21:50,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:21:50,275 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:21:50,275 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:21:50,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-01-27 18:21:51,162 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:21:51,387 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:21:51,387 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-01-27 18:21:51,396 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c75359b4/d31cfcbf812d4bc3b133d0d68da152ee/FLAG92b387ad5 [2023-01-27 18:21:51,413 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c75359b4/d31cfcbf812d4bc3b133d0d68da152ee [2023-01-27 18:21:51,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:21:51,417 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:21:51,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:21:51,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:21:51,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:21:51,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:21:51" (1/1) ... [2023-01-27 18:21:51,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be1a609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:51, skipping insertion in model container [2023-01-27 18:21:51,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:21:51" (1/1) ... [2023-01-27 18:21:51,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:21:51,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:21:51,590 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/thin002_power.opt.i[951,964] [2023-01-27 18:21:51,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:21:51,761 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:21:51,772 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/thin002_power.opt.i[951,964] [2023-01-27 18:21:51,806 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:21:51,836 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:21:51,836 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:21:51,841 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:21:51,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:51 WrapperNode [2023-01-27 18:21:51,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:21:51,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:21:51,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:21:51,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:21:51,847 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:21:51" (1/1) ... [2023-01-27 18:21:51,873 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:21:51" (1/1) ... [2023-01-27 18:21:51,900 INFO L138 Inliner]: procedures = 177, calls = 84, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 200 [2023-01-27 18:21:51,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:21:51,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:21:51,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:21:51,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:21:51,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:51" (1/1) ... [2023-01-27 18:21:51,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:51" (1/1) ... [2023-01-27 18:21:51,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:51" (1/1) ... [2023-01-27 18:21:51,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:51" (1/1) ... [2023-01-27 18:21:51,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:51" (1/1) ... [2023-01-27 18:21:51,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:51" (1/1) ... [2023-01-27 18:21:51,933 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:51" (1/1) ... [2023-01-27 18:21:51,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:51" (1/1) ... [2023-01-27 18:21:51,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:21:51,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:21:51,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:21:51,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:21:51,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:51" (1/1) ... [2023-01-27 18:21:51,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:21:51,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:21:51,977 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:21:51,983 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:21:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 18:21:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:21:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:21:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:21:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:21:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:21:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:21:52,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:21:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:21:52,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:21:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:21:52,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:21:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:21:52,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:21:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:21:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:21:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:21:52,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:21:52,007 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:21:52,169 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:21:52,170 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:21:52,508 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:21:52,717 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:21:52,717 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:21:52,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:21:52 BoogieIcfgContainer [2023-01-27 18:21:52,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:21:52,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:21:52,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:21:52,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:21:52,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:21:51" (1/3) ... [2023-01-27 18:21:52,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2583e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:21:52, skipping insertion in model container [2023-01-27 18:21:52,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:51" (2/3) ... [2023-01-27 18:21:52,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2583e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:21:52, skipping insertion in model container [2023-01-27 18:21:52,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:21:52" (3/3) ... [2023-01-27 18:21:52,724 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2023-01-27 18:21:52,735 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:21:52,735 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:21:52,735 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:21:52,811 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:21:52,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2023-01-27 18:21:52,912 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2023-01-27 18:21:52,913 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:21:52,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-01-27 18:21:52,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 318 flow [2023-01-27 18:21:52,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 145 transitions, 302 flow [2023-01-27 18:21:52,924 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:21:52,939 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 145 transitions, 302 flow [2023-01-27 18:21:52,942 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 145 transitions, 302 flow [2023-01-27 18:21:52,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 302 flow [2023-01-27 18:21:52,974 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2023-01-27 18:21:52,975 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:21:52,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-01-27 18:21:52,978 INFO L119 LiptonReduction]: Number of co-enabled transitions 2750 [2023-01-27 18:21:59,187 INFO L134 LiptonReduction]: Checked pairs total: 8236 [2023-01-27 18:21:59,187 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-01-27 18:21:59,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:21:59,200 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;@54233502, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:21:59,200 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:21:59,203 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2023-01-27 18:21:59,203 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:21:59,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:59,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:59,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:21:59,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2036960237, now seen corresponding path program 1 times [2023-01-27 18:21:59,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:59,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818585516] [2023-01-27 18:21:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:59,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:59,558 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:21:59,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:59,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818585516] [2023-01-27 18:21:59,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818585516] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:59,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:59,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:21:59,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371727999] [2023-01-27 18:21:59,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:59,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:21:59,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:59,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:21:59,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:21:59,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2023-01-27 18:21:59,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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:21:59,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:59,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2023-01-27 18:21:59,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:00,252 INFO L130 PetriNetUnfolder]: 3674/5108 cut-off events. [2023-01-27 18:22:00,252 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2023-01-27 18:22:00,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10279 conditions, 5108 events. 3674/5108 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 26562 event pairs, 1325 based on Foata normal form. 180/4906 useless extension candidates. Maximal degree in co-relation 10267. Up to 3160 conditions per place. [2023-01-27 18:22:00,274 INFO L137 encePairwiseOnDemand]: 270/274 looper letters, 34 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2023-01-27 18:22:00,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 181 flow [2023-01-27 18:22:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:22:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:22:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-01-27 18:22:00,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5413625304136253 [2023-01-27 18:22:00,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-01-27 18:22:00,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-01-27 18:22:00,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:00,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-01-27 18:22:00,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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:22:00,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:22:00,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:22:00,295 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 445 transitions. [2023-01-27 18:22:00,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 181 flow [2023-01-27 18:22:00,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:22:00,299 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-01-27 18:22:00,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-01-27 18:22:00,302 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-01-27 18:22:00,302 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-01-27 18:22:00,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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:22:00,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:00,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:00,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:22:00,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:00,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1381930948, now seen corresponding path program 1 times [2023-01-27 18:22:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423123527] [2023-01-27 18:22:00,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:00,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:00,575 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:22:00,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:00,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423123527] [2023-01-27 18:22:00,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423123527] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:00,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:00,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:22:00,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980750710] [2023-01-27 18:22:00,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:00,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:22:00,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:00,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:22:00,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:22:00,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 274 [2023-01-27 18:22:00,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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:22:00,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:00,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 274 [2023-01-27 18:22:00,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:01,046 INFO L130 PetriNetUnfolder]: 2649/4021 cut-off events. [2023-01-27 18:22:01,047 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2023-01-27 18:22:01,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 4021 events. 2649/4021 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 23058 event pairs, 508 based on Foata normal form. 180/4185 useless extension candidates. Maximal degree in co-relation 8065. Up to 2539 conditions per place. [2023-01-27 18:22:01,063 INFO L137 encePairwiseOnDemand]: 270/274 looper letters, 38 selfloop transitions, 2 changer transitions 21/64 dead transitions. [2023-01-27 18:22:01,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 274 flow [2023-01-27 18:22:01,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:22:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:22:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2023-01-27 18:22:01,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5167883211678832 [2023-01-27 18:22:01,066 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2023-01-27 18:22:01,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2023-01-27 18:22:01,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:01,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2023-01-27 18:22:01,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 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:22:01,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:01,072 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:01,072 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 5 states and 708 transitions. [2023-01-27 18:22:01,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 274 flow [2023-01-27 18:22:01,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 64 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:22:01,074 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 72 flow [2023-01-27 18:22:01,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, 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=5, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-01-27 18:22:01,074 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-01-27 18:22:01,075 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 72 flow [2023-01-27 18:22:01,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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:22:01,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:01,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:01,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:22:01,075 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:01,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash 109773549, now seen corresponding path program 1 times [2023-01-27 18:22:01,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:01,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650660550] [2023-01-27 18:22:01,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:01,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:01,280 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:22:01,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:01,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650660550] [2023-01-27 18:22:01,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650660550] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:01,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:01,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:22:01,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490350649] [2023-01-27 18:22:01,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:01,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:22:01,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:01,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:22:01,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:22:01,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 274 [2023-01-27 18:22:01,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 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:22:01,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:01,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 274 [2023-01-27 18:22:01,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:01,796 INFO L130 PetriNetUnfolder]: 3486/5016 cut-off events. [2023-01-27 18:22:01,797 INFO L131 PetriNetUnfolder]: For 649/649 co-relation queries the response was YES. [2023-01-27 18:22:01,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10961 conditions, 5016 events. 3486/5016 cut-off events. For 649/649 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 26230 event pairs, 932 based on Foata normal form. 150/5162 useless extension candidates. Maximal degree in co-relation 10948. Up to 1681 conditions per place. [2023-01-27 18:22:01,812 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 39 selfloop transitions, 3 changer transitions 23/67 dead transitions. [2023-01-27 18:22:01,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 291 flow [2023-01-27 18:22:01,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:22:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:22:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 829 transitions. [2023-01-27 18:22:01,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504257907542579 [2023-01-27 18:22:01,814 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 829 transitions. [2023-01-27 18:22:01,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 829 transitions. [2023-01-27 18:22:01,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:01,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 829 transitions. [2023-01-27 18:22:01,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 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:22:01,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:01,819 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:01,819 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 72 flow. Second operand 6 states and 829 transitions. [2023-01-27 18:22:01,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 291 flow [2023-01-27 18:22:01,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 281 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:22:01,837 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 82 flow [2023-01-27 18:22:01,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2023-01-27 18:22:01,838 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-01-27 18:22:01,840 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 82 flow [2023-01-27 18:22:01,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 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:22:01,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:01,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:01,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:22:01,841 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:01,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:01,841 INFO L85 PathProgramCache]: Analyzing trace with hash -108819960, now seen corresponding path program 1 times [2023-01-27 18:22:01,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:01,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430547645] [2023-01-27 18:22:01,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:01,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:02,049 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:22:02,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:02,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430547645] [2023-01-27 18:22:02,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430547645] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:02,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:02,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:22:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497121381] [2023-01-27 18:22:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:02,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:22:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:02,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:22:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:22:02,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 274 [2023-01-27 18:22:02,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 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:22:02,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:02,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 274 [2023-01-27 18:22:02,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:02,308 INFO L130 PetriNetUnfolder]: 1617/2475 cut-off events. [2023-01-27 18:22:02,308 INFO L131 PetriNetUnfolder]: For 802/802 co-relation queries the response was YES. [2023-01-27 18:22:02,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5647 conditions, 2475 events. 1617/2475 cut-off events. For 802/802 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12467 event pairs, 714 based on Foata normal form. 90/2535 useless extension candidates. Maximal degree in co-relation 5632. Up to 1611 conditions per place. [2023-01-27 18:22:02,318 INFO L137 encePairwiseOnDemand]: 270/274 looper letters, 36 selfloop transitions, 2 changer transitions 17/58 dead transitions. [2023-01-27 18:22:02,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 270 flow [2023-01-27 18:22:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:22:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:22:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2023-01-27 18:22:02,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124087591240876 [2023-01-27 18:22:02,320 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2023-01-27 18:22:02,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2023-01-27 18:22:02,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:02,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2023-01-27 18:22:02,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 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:22:02,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:02,324 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:02,324 INFO L175 Difference]: Start difference. First operand has 45 places, 26 transitions, 82 flow. Second operand 5 states and 702 transitions. [2023-01-27 18:22:02,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 270 flow [2023-01-27 18:22:02,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 245 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-01-27 18:22:02,329 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 76 flow [2023-01-27 18:22:02,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=5, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-01-27 18:22:02,329 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-01-27 18:22:02,329 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 76 flow [2023-01-27 18:22:02,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 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:22:02,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:02,330 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:22:02,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:22:02,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:02,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:02,330 INFO L85 PathProgramCache]: Analyzing trace with hash 920614783, now seen corresponding path program 1 times [2023-01-27 18:22:02,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:02,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384193260] [2023-01-27 18:22:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:02,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:02,522 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:22:02,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:02,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384193260] [2023-01-27 18:22:02,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384193260] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:02,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:02,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:22:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899729931] [2023-01-27 18:22:02,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:02,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:22:02,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:02,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:22:02,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:22:02,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 274 [2023-01-27 18:22:02,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 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:22:02,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:02,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 274 [2023-01-27 18:22:02,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:02,911 INFO L130 PetriNetUnfolder]: 2439/3563 cut-off events. [2023-01-27 18:22:02,912 INFO L131 PetriNetUnfolder]: For 710/710 co-relation queries the response was YES. [2023-01-27 18:22:02,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8050 conditions, 3563 events. 2439/3563 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17159 event pairs, 826 based on Foata normal form. 90/3622 useless extension candidates. Maximal degree in co-relation 8037. Up to 1120 conditions per place. [2023-01-27 18:22:02,923 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 38 selfloop transitions, 3 changer transitions 21/64 dead transitions. [2023-01-27 18:22:02,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 287 flow [2023-01-27 18:22:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:22:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:22:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 826 transitions. [2023-01-27 18:22:02,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024330900243309 [2023-01-27 18:22:02,925 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 826 transitions. [2023-01-27 18:22:02,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 826 transitions. [2023-01-27 18:22:02,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:02,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 826 transitions. [2023-01-27 18:22:02,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.66666666666666) internal successors, (826), 6 states have internal predecessors, (826), 0 states have call successors, (0), 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:22:02,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:02,929 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:02,930 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 76 flow. Second operand 6 states and 826 transitions. [2023-01-27 18:22:02,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 287 flow [2023-01-27 18:22:02,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 64 transitions, 277 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:22:02,934 INFO L231 Difference]: Finished difference. Result has 46 places, 26 transitions, 86 flow [2023-01-27 18:22:02,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2023-01-27 18:22:02,935 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-01-27 18:22:02,935 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 86 flow [2023-01-27 18:22:02,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 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:22:02,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:02,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:02,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:22:02,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:02,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1903289830, now seen corresponding path program 1 times [2023-01-27 18:22:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:02,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542878990] [2023-01-27 18:22:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:02,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:03,148 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:22:03,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:03,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542878990] [2023-01-27 18:22:03,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542878990] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:03,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:03,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:22:03,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889947762] [2023-01-27 18:22:03,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:03,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:22:03,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:03,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:22:03,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:22:03,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 274 [2023-01-27 18:22:03,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 26 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 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:22:03,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:03,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 274 [2023-01-27 18:22:03,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:03,353 INFO L130 PetriNetUnfolder]: 1080/1602 cut-off events. [2023-01-27 18:22:03,354 INFO L131 PetriNetUnfolder]: For 863/863 co-relation queries the response was YES. [2023-01-27 18:22:03,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3871 conditions, 1602 events. 1080/1602 cut-off events. For 863/863 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7585 event pairs, 168 based on Foata normal form. 60/1648 useless extension candidates. Maximal degree in co-relation 3856. Up to 1253 conditions per place. [2023-01-27 18:22:03,359 INFO L137 encePairwiseOnDemand]: 270/274 looper letters, 32 selfloop transitions, 2 changer transitions 13/50 dead transitions. [2023-01-27 18:22:03,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 243 flow [2023-01-27 18:22:03,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:22:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:22:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-01-27 18:22:03,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5065693430656935 [2023-01-27 18:22:03,361 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-01-27 18:22:03,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-01-27 18:22:03,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:03,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-01-27 18:22:03,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 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:22:03,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:03,364 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:03,364 INFO L175 Difference]: Start difference. First operand has 46 places, 26 transitions, 86 flow. Second operand 5 states and 694 transitions. [2023-01-27 18:22:03,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 243 flow [2023-01-27 18:22:03,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 211 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-01-27 18:22:03,366 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 76 flow [2023-01-27 18:22:03,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=5, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-01-27 18:22:03,367 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-01-27 18:22:03,367 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 76 flow [2023-01-27 18:22:03,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 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:22:03,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:03,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:03,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:22:03,368 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:03,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash -628893214, now seen corresponding path program 1 times [2023-01-27 18:22:03,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:03,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518851037] [2023-01-27 18:22:03,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:03,574 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:22:03,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:03,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518851037] [2023-01-27 18:22:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518851037] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:03,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:22:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646077257] [2023-01-27 18:22:03,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:03,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:22:03,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:03,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:22:03,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:22:03,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 274 [2023-01-27 18:22:03,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 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:22:03,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:03,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 274 [2023-01-27 18:22:03,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:03,840 INFO L130 PetriNetUnfolder]: 1703/2481 cut-off events. [2023-01-27 18:22:03,840 INFO L131 PetriNetUnfolder]: For 525/525 co-relation queries the response was YES. [2023-01-27 18:22:03,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 2481 events. 1703/2481 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10353 event pairs, 583 based on Foata normal form. 72/2499 useless extension candidates. Maximal degree in co-relation 5569. Up to 809 conditions per place. [2023-01-27 18:22:03,849 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 32 selfloop transitions, 3 changer transitions 23/60 dead transitions. [2023-01-27 18:22:03,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 271 flow [2023-01-27 18:22:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:22:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:22:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 822 transitions. [2023-01-27 18:22:03,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-27 18:22:03,851 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 822 transitions. [2023-01-27 18:22:03,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 822 transitions. [2023-01-27 18:22:03,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:03,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 822 transitions. [2023-01-27 18:22:03,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 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:22:03,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:03,856 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:03,856 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 76 flow. Second operand 6 states and 822 transitions. [2023-01-27 18:22:03,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 271 flow [2023-01-27 18:22:03,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 261 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:22:03,859 INFO L231 Difference]: Finished difference. Result has 46 places, 26 transitions, 86 flow [2023-01-27 18:22:03,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2023-01-27 18:22:03,860 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-01-27 18:22:03,860 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 86 flow [2023-01-27 18:22:03,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 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:22:03,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:03,860 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:22:03,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:22:03,860 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:03,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:03,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1976934963, now seen corresponding path program 1 times [2023-01-27 18:22:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:03,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532291891] [2023-01-27 18:22:03,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:03,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:04,721 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:22:04,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:04,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532291891] [2023-01-27 18:22:04,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532291891] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:04,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:04,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:22:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590118910] [2023-01-27 18:22:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:04,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:22:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:22:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:22:04,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 274 [2023-01-27 18:22:04,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 26 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 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:22:04,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:04,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 274 [2023-01-27 18:22:04,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:04,959 INFO L130 PetriNetUnfolder]: 692/1049 cut-off events. [2023-01-27 18:22:04,959 INFO L131 PetriNetUnfolder]: For 662/662 co-relation queries the response was YES. [2023-01-27 18:22:04,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 1049 events. 692/1049 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3996 event pairs, 150 based on Foata normal form. 48/1097 useless extension candidates. Maximal degree in co-relation 2503. Up to 799 conditions per place. [2023-01-27 18:22:04,963 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 34 selfloop transitions, 6 changer transitions 17/60 dead transitions. [2023-01-27 18:22:04,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 289 flow [2023-01-27 18:22:04,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:22:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:22:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 900 transitions. [2023-01-27 18:22:04,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41058394160583944 [2023-01-27 18:22:04,965 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 900 transitions. [2023-01-27 18:22:04,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 900 transitions. [2023-01-27 18:22:04,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:04,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 900 transitions. [2023-01-27 18:22:04,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.5) internal successors, (900), 8 states have internal predecessors, (900), 0 states have call successors, (0), 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:22:04,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 0 states have call successors, (0), 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:22:04,969 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 0 states have call successors, (0), 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:22:04,969 INFO L175 Difference]: Start difference. First operand has 46 places, 26 transitions, 86 flow. Second operand 8 states and 900 transitions. [2023-01-27 18:22:04,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 289 flow [2023-01-27 18:22:04,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 251 flow, removed 11 selfloop flow, removed 8 redundant places. [2023-01-27 18:22:04,971 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 110 flow [2023-01-27 18:22:04,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2023-01-27 18:22:04,972 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-01-27 18:22:04,972 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 110 flow [2023-01-27 18:22:04,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 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:22:04,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:04,973 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] [2023-01-27 18:22:04,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:22:04,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:04,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:04,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1936490929, now seen corresponding path program 1 times [2023-01-27 18:22:04,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:04,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621085657] [2023-01-27 18:22:04,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:04,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:06,123 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:22:06,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:06,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621085657] [2023-01-27 18:22:06,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621085657] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:06,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:06,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:22:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116079151] [2023-01-27 18:22:06,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:06,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:22:06,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:06,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:22:06,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:22:06,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 274 [2023-01-27 18:22:06,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 110 flow. Second operand has 8 states, 8 states have (on average 104.125) internal successors, (833), 8 states have internal predecessors, (833), 0 states have call successors, (0), 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:22:06,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:06,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 274 [2023-01-27 18:22:06,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:06,379 INFO L130 PetriNetUnfolder]: 692/1051 cut-off events. [2023-01-27 18:22:06,379 INFO L131 PetriNetUnfolder]: For 633/633 co-relation queries the response was YES. [2023-01-27 18:22:06,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2798 conditions, 1051 events. 692/1051 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3867 event pairs, 146 based on Foata normal form. 32/1071 useless extension candidates. Maximal degree in co-relation 2783. Up to 561 conditions per place. [2023-01-27 18:22:06,383 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 34 selfloop transitions, 8 changer transitions 14/59 dead transitions. [2023-01-27 18:22:06,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 310 flow [2023-01-27 18:22:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:22:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:22:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 871 transitions. [2023-01-27 18:22:06,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39735401459854014 [2023-01-27 18:22:06,385 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 871 transitions. [2023-01-27 18:22:06,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 871 transitions. [2023-01-27 18:22:06,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:06,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 871 transitions. [2023-01-27 18:22:06,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.875) internal successors, (871), 8 states have internal predecessors, (871), 0 states have call successors, (0), 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:22:06,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 0 states have call successors, (0), 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:22:06,391 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 0 states have call successors, (0), 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:22:06,391 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 110 flow. Second operand 8 states and 871 transitions. [2023-01-27 18:22:06,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 310 flow [2023-01-27 18:22:06,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 302 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-27 18:22:06,394 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 167 flow [2023-01-27 18:22:06,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2023-01-27 18:22:06,395 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-01-27 18:22:06,395 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 167 flow [2023-01-27 18:22:06,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.125) internal successors, (833), 8 states have internal predecessors, (833), 0 states have call successors, (0), 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:22:06,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:06,396 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] [2023-01-27 18:22:06,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:22:06,396 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:06,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:06,396 INFO L85 PathProgramCache]: Analyzing trace with hash -98661278, now seen corresponding path program 1 times [2023-01-27 18:22:06,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:06,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887086766] [2023-01-27 18:22:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:06,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:06,636 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:22:06,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:06,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887086766] [2023-01-27 18:22:06,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887086766] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:06,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:06,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:22:06,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379653735] [2023-01-27 18:22:06,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:06,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:22:06,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:06,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:22:06,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:22:06,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 274 [2023-01-27 18:22:06,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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:22:06,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:06,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 274 [2023-01-27 18:22:06,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:06,737 INFO L130 PetriNetUnfolder]: 515/792 cut-off events. [2023-01-27 18:22:06,737 INFO L131 PetriNetUnfolder]: For 976/976 co-relation queries the response was YES. [2023-01-27 18:22:06,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 792 events. 515/792 cut-off events. For 976/976 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2814 event pairs, 230 based on Foata normal form. 14/802 useless extension candidates. Maximal degree in co-relation 2504. Up to 764 conditions per place. [2023-01-27 18:22:06,740 INFO L137 encePairwiseOnDemand]: 268/274 looper letters, 41 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-01-27 18:22:06,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 336 flow [2023-01-27 18:22:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:22:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:22:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-01-27 18:22:06,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121654501216545 [2023-01-27 18:22:06,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-01-27 18:22:06,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-01-27 18:22:06,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:06,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-01-27 18:22:06,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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:22:06,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:22:06,744 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:22:06,744 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 167 flow. Second operand 3 states and 421 transitions. [2023-01-27 18:22:06,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 336 flow [2023-01-27 18:22:06,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 303 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-01-27 18:22:06,748 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 176 flow [2023-01-27 18:22:06,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-01-27 18:22:06,749 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-01-27 18:22:06,749 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 176 flow [2023-01-27 18:22:06,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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:22:06,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:06,750 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:22:06,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:22:06,750 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:06,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash -568712109, now seen corresponding path program 1 times [2023-01-27 18:22:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:06,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261775464] [2023-01-27 18:22:06,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:06,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:08,099 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:22:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:08,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261775464] [2023-01-27 18:22:08,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261775464] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:08,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:08,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 18:22:08,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717948133] [2023-01-27 18:22:08,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:08,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-27 18:22:08,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:08,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-27 18:22:08,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-01-27 18:22:08,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 274 [2023-01-27 18:22:08,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 176 flow. Second operand has 9 states, 9 states have (on average 103.11111111111111) internal successors, (928), 9 states have internal predecessors, (928), 0 states have call successors, (0), 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:22:08,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:08,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 274 [2023-01-27 18:22:08,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:08,331 INFO L130 PetriNetUnfolder]: 551/856 cut-off events. [2023-01-27 18:22:08,331 INFO L131 PetriNetUnfolder]: For 794/797 co-relation queries the response was YES. [2023-01-27 18:22:08,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2965 conditions, 856 events. 551/856 cut-off events. For 794/797 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3230 event pairs, 88 based on Foata normal form. 21/872 useless extension candidates. Maximal degree in co-relation 2948. Up to 576 conditions per place. [2023-01-27 18:22:08,334 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 49 selfloop transitions, 11 changer transitions 9/72 dead transitions. [2023-01-27 18:22:08,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 482 flow [2023-01-27 18:22:08,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:22:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:22:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 758 transitions. [2023-01-27 18:22:08,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39520333680917624 [2023-01-27 18:22:08,336 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 758 transitions. [2023-01-27 18:22:08,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 758 transitions. [2023-01-27 18:22:08,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:08,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 758 transitions. [2023-01-27 18:22:08,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 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:22:08,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 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:22:08,340 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 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:22:08,340 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 176 flow. Second operand 7 states and 758 transitions. [2023-01-27 18:22:08,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 482 flow [2023-01-27 18:22:08,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:22:08,343 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 275 flow [2023-01-27 18:22:08,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-01-27 18:22:08,344 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-01-27 18:22:08,344 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 275 flow [2023-01-27 18:22:08,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 103.11111111111111) internal successors, (928), 9 states have internal predecessors, (928), 0 states have call successors, (0), 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:22:08,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:08,344 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:22:08,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:22:08,344 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:08,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1055818134, now seen corresponding path program 1 times [2023-01-27 18:22:08,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:08,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75153319] [2023-01-27 18:22:08,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:08,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:08,559 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:22:08,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75153319] [2023-01-27 18:22:08,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75153319] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:08,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:08,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:22:08,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397114157] [2023-01-27 18:22:08,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:08,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:22:08,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:08,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:22:08,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:22:08,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 274 [2023-01-27 18:22:08,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 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:22:08,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:08,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 274 [2023-01-27 18:22:08,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:08,647 INFO L130 PetriNetUnfolder]: 290/491 cut-off events. [2023-01-27 18:22:08,647 INFO L131 PetriNetUnfolder]: For 968/971 co-relation queries the response was YES. [2023-01-27 18:22:08,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 491 events. 290/491 cut-off events. For 968/971 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1800 event pairs, 39 based on Foata normal form. 31/518 useless extension candidates. Maximal degree in co-relation 1921. Up to 402 conditions per place. [2023-01-27 18:22:08,649 INFO L137 encePairwiseOnDemand]: 268/274 looper letters, 58 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-01-27 18:22:08,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 585 flow [2023-01-27 18:22:08,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:22:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:22:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-01-27 18:22:08,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510036496350365 [2023-01-27 18:22:08,651 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-01-27 18:22:08,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-01-27 18:22:08,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:08,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-01-27 18:22:08,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 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:22:08,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 0 states have call successors, (0), 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:22:08,653 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 0 states have call successors, (0), 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:22:08,653 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 275 flow. Second operand 4 states and 559 transitions. [2023-01-27 18:22:08,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 585 flow [2023-01-27 18:22:08,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 555 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-01-27 18:22:08,655 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 307 flow [2023-01-27 18:22:08,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-01-27 18:22:08,656 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-01-27 18:22:08,657 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 307 flow [2023-01-27 18:22:08,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 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:22:08,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:08,657 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] [2023-01-27 18:22:08,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:22:08,657 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:08,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1071585237, now seen corresponding path program 1 times [2023-01-27 18:22:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:08,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556163102] [2023-01-27 18:22:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:08,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:09,714 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:22:09,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:09,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556163102] [2023-01-27 18:22:09,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556163102] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:09,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:09,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-27 18:22:09,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918583627] [2023-01-27 18:22:09,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:09,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 18:22:09,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:09,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 18:22:09,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-01-27 18:22:09,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 274 [2023-01-27 18:22:09,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 307 flow. Second operand has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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:22:09,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:09,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 274 [2023-01-27 18:22:09,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:09,921 INFO L130 PetriNetUnfolder]: 292/507 cut-off events. [2023-01-27 18:22:09,921 INFO L131 PetriNetUnfolder]: For 1128/1132 co-relation queries the response was YES. [2023-01-27 18:22:09,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 507 events. 292/507 cut-off events. For 1128/1132 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1833 event pairs, 82 based on Foata normal form. 12/518 useless extension candidates. Maximal degree in co-relation 2177. Up to 409 conditions per place. [2023-01-27 18:22:09,926 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 61 selfloop transitions, 8 changer transitions 9/81 dead transitions. [2023-01-27 18:22:09,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 663 flow [2023-01-27 18:22:09,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:22:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:22:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 764 transitions. [2023-01-27 18:22:09,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983315954118874 [2023-01-27 18:22:09,928 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 764 transitions. [2023-01-27 18:22:09,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 764 transitions. [2023-01-27 18:22:09,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:09,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 764 transitions. [2023-01-27 18:22:09,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 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:22:09,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 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:22:09,932 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 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:22:09,932 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 307 flow. Second operand 7 states and 764 transitions. [2023-01-27 18:22:09,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 663 flow [2023-01-27 18:22:09,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 625 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-01-27 18:22:09,936 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 346 flow [2023-01-27 18:22:09,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-01-27 18:22:09,936 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2023-01-27 18:22:09,936 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 346 flow [2023-01-27 18:22:09,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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:22:09,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:09,937 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] [2023-01-27 18:22:09,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:22:09,937 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:09,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:09,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2104669253, now seen corresponding path program 1 times [2023-01-27 18:22:09,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:09,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305332694] [2023-01-27 18:22:09,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:09,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:10,107 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:22:10,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:10,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305332694] [2023-01-27 18:22:10,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305332694] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:10,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:10,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:22:10,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60944794] [2023-01-27 18:22:10,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:10,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:22:10,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:10,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:22:10,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:22:10,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 274 [2023-01-27 18:22:10,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 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:22:10,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:10,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 274 [2023-01-27 18:22:10,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:10,186 INFO L130 PetriNetUnfolder]: 138/261 cut-off events. [2023-01-27 18:22:10,186 INFO L131 PetriNetUnfolder]: For 668/686 co-relation queries the response was YES. [2023-01-27 18:22:10,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 261 events. 138/261 cut-off events. For 668/686 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 795 event pairs, 7 based on Foata normal form. 37/296 useless extension candidates. Maximal degree in co-relation 1104. Up to 108 conditions per place. [2023-01-27 18:22:10,187 INFO L137 encePairwiseOnDemand]: 268/274 looper letters, 58 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2023-01-27 18:22:10,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 649 flow [2023-01-27 18:22:10,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:22:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:22:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 696 transitions. [2023-01-27 18:22:10,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080291970802919 [2023-01-27 18:22:10,189 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 696 transitions. [2023-01-27 18:22:10,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 696 transitions. [2023-01-27 18:22:10,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:10,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 696 transitions. [2023-01-27 18:22:10,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 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:22:10,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:10,192 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:10,192 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 346 flow. Second operand 5 states and 696 transitions. [2023-01-27 18:22:10,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 649 flow [2023-01-27 18:22:10,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 569 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-01-27 18:22:10,198 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 296 flow [2023-01-27 18:22:10,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-01-27 18:22:10,198 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-01-27 18:22:10,198 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 296 flow [2023-01-27 18:22:10,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 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:22:10,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:10,199 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] [2023-01-27 18:22:10,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:22:10,199 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:10,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:10,199 INFO L85 PathProgramCache]: Analyzing trace with hash -117733095, now seen corresponding path program 1 times [2023-01-27 18:22:10,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:10,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938866795] [2023-01-27 18:22:10,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:10,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:22:10,384 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:22:10,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:22:10,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938866795] [2023-01-27 18:22:10,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938866795] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:22:10,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:22:10,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:22:10,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634248128] [2023-01-27 18:22:10,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:22:10,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:22:10,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:22:10,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:22:10,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:22:10,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 274 [2023-01-27 18:22:10,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 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:22:10,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:22:10,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 274 [2023-01-27 18:22:10,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:22:10,463 INFO L130 PetriNetUnfolder]: 110/202 cut-off events. [2023-01-27 18:22:10,463 INFO L131 PetriNetUnfolder]: For 580/586 co-relation queries the response was YES. [2023-01-27 18:22:10,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 202 events. 110/202 cut-off events. For 580/586 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 583 event pairs, 3 based on Foata normal form. 13/211 useless extension candidates. Maximal degree in co-relation 905. Up to 83 conditions per place. [2023-01-27 18:22:10,464 INFO L137 encePairwiseOnDemand]: 268/274 looper letters, 49 selfloop transitions, 17 changer transitions 0/69 dead transitions. [2023-01-27 18:22:10,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 579 flow [2023-01-27 18:22:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:22:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:22:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 825 transitions. [2023-01-27 18:22:10,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018248175182481 [2023-01-27 18:22:10,466 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 825 transitions. [2023-01-27 18:22:10,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 825 transitions. [2023-01-27 18:22:10,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:22:10,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 825 transitions. [2023-01-27 18:22:10,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 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:22:10,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:10,470 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:10,470 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 296 flow. Second operand 6 states and 825 transitions. [2023-01-27 18:22:10,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 579 flow [2023-01-27 18:22:10,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 450 flow, removed 19 selfloop flow, removed 10 redundant places. [2023-01-27 18:22:10,473 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 242 flow [2023-01-27 18:22:10,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-01-27 18:22:10,474 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-01-27 18:22:10,474 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 242 flow [2023-01-27 18:22:10,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 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:22:10,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:22:10,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:10,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:22:10,483 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:22:10,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:22:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash -549095343, now seen corresponding path program 1 times [2023-01-27 18:22:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:22:10,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372457990] [2023-01-27 18:22:10,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:22:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:22:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:22:10,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:22:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:22:10,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:22:10,629 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:22:10,630 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:22:10,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:22:10,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:22:10,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:22:10,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:22:10,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:22:10,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:22:10,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 18:22:10,632 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:22:10,636 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:22:10,636 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:22:10,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:22:10 BasicIcfg [2023-01-27 18:22:10,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:22:10,724 INFO L158 Benchmark]: Toolchain (without parser) took 19306.42ms. Allocated memory was 320.9MB in the beginning and 851.4MB in the end (delta: 530.6MB). Free memory was 288.3MB in the beginning and 328.7MB in the end (delta: -40.4MB). Peak memory consumption was 491.7MB. Max. memory is 16.0GB. [2023-01-27 18:22:10,724 INFO L158 Benchmark]: CDTParser took 0.11ms. 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:22:10,724 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.41ms. Allocated memory is still 320.9MB. Free memory was 288.3MB in the beginning and 263.7MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:22:10,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.61ms. Allocated memory is still 320.9MB. Free memory was 263.7MB in the beginning and 261.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-27 18:22:10,724 INFO L158 Benchmark]: Boogie Preprocessor took 50.36ms. Allocated memory is still 320.9MB. Free memory was 261.1MB in the beginning and 259.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:22:10,725 INFO L158 Benchmark]: RCFGBuilder took 766.79ms. Allocated memory is still 320.9MB. Free memory was 258.5MB in the beginning and 263.4MB in the end (delta: -5.0MB). Peak memory consumption was 55.8MB. Max. memory is 16.0GB. [2023-01-27 18:22:10,725 INFO L158 Benchmark]: TraceAbstraction took 18002.94ms. Allocated memory was 320.9MB in the beginning and 851.4MB in the end (delta: 530.6MB). Free memory was 263.4MB in the beginning and 328.7MB in the end (delta: -65.3MB). Peak memory consumption was 465.3MB. Max. memory is 16.0GB. [2023-01-27 18:22:10,726 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.11ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 423.41ms. Allocated memory is still 320.9MB. Free memory was 288.3MB in the beginning and 263.7MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.61ms. Allocated memory is still 320.9MB. Free memory was 263.7MB in the beginning and 261.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.36ms. Allocated memory is still 320.9MB. Free memory was 261.1MB in the beginning and 259.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 766.79ms. Allocated memory is still 320.9MB. Free memory was 258.5MB in the beginning and 263.4MB in the end (delta: -5.0MB). Peak memory consumption was 55.8MB. Max. memory is 16.0GB. * TraceAbstraction took 18002.94ms. Allocated memory was 320.9MB in the beginning and 851.4MB in the end (delta: 530.6MB). Free memory was 263.4MB in the beginning and 328.7MB in the end (delta: -65.3MB). Peak memory consumption was 465.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 156 PlacesBefore, 42 PlacesAfterwards, 145 TransitionsBefore, 30 TransitionsAfterwards, 2750 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 8236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3765, independent: 3506, independent conditional: 0, independent unconditional: 3506, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1471, independent: 1435, independent conditional: 0, independent unconditional: 1435, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3765, independent: 2071, independent conditional: 0, independent unconditional: 2071, dependent: 223, dependent conditional: 0, dependent unconditional: 223, unknown: 1471, unknown conditional: 0, unknown unconditional: 1471] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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; [L719] 0 _Bool __unbuffered_p3_EAX$flush_delayed; [L720] 0 int __unbuffered_p3_EAX$mem_tmp; [L721] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd0; [L722] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd1; [L723] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd2; [L724] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd3; [L725] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd4; [L726] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd0; [L727] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd1; [L728] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd2; [L729] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd3; [L730] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd4; [L731] 0 _Bool __unbuffered_p3_EAX$read_delayed; [L732] 0 int *__unbuffered_p3_EAX$read_delayed_var; [L733] 0 int __unbuffered_p3_EAX$w_buff0; [L734] 0 _Bool __unbuffered_p3_EAX$w_buff0_used; [L735] 0 int __unbuffered_p3_EAX$w_buff1; [L736] 0 _Bool __unbuffered_p3_EAX$w_buff1_used; [L738] 0 int a = 0; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice1; [L767] 0 _Bool weak$$choice2; [L875] 0 pthread_t t2709; [L876] FCALL, FORK 0 pthread_create(&t2709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2709, ((void *)0), P0, ((void *)0))=-3, t2709={7:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L877] 0 pthread_t t2710; [L878] FCALL, FORK 0 pthread_create(&t2710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2710, ((void *)0), P1, ((void *)0))=-2, t2709={7:0}, t2710={5:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L879] 0 pthread_t t2711; [L880] FCALL, FORK 0 pthread_create(&t2711, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2711, ((void *)0), P2, ((void *)0))=-1, t2709={7:0}, t2710={5:0}, t2711={6:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L881] 0 pthread_t t2712; [L882] FCALL, FORK 0 pthread_create(&t2712, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2712, ((void *)0), P3, ((void *)0))=0, t2709={7:0}, t2710={5:0}, t2711={6:0}, t2712={8:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 z$flush_delayed = weak$$choice2 [L834] EXPR 4 \read(z) [L834] 4 z$mem_tmp = z [L835] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] EXPR 4 \read(z) [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] 4 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L837] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)))) [L838] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)))) [L839] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : weak$$choice0)))) [L840] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L841] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L842] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$r_buff1_thd4 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L843] 4 __unbuffered_p3_EAX$read_delayed = (_Bool)1 [L844] 4 __unbuffered_p3_EAX$read_delayed_var = &z [L845] EXPR 4 \read(z) [L845] 4 __unbuffered_p3_EAX = z [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] 4 z = z$flush_delayed ? z$mem_tmp : z [L847] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L850] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L771] 1 __unbuffered_p0_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L774] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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=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={3:0}] [L786] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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=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={3:0}] [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 \read(z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] 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) [L854] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L855] 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 [L856] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L857] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, 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=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={3:0}] [L789] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=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={3:0}] [L860] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L862] 4 return 0; [L801] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=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={3:0}] [L804] 3 z$w_buff1 = z$w_buff0 [L805] 3 z$w_buff0 = 1 [L806] 3 z$w_buff1_used = z$w_buff0_used [L807] 3 z$w_buff0_used = (_Bool)1 [L808] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L808] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 3 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L884] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L886] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L886] RET 0 assume_abort_if_not(main$tmp_guard0) [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 \read(z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] 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) [L889] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L890] 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 [L891] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L892] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2709={7:0}, t2710={5:0}, t2711={6:0}, t2712={8:0}, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L895] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 \read(*__unbuffered_p3_EAX$read_delayed_var) [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] 0 __unbuffered_p3_EAX = __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L897] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L899] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=1, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 880]: 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: 878]: 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: 876]: 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: 882]: 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, 183 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: 17.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 461 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 461 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1414 IncrementalHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 6 mSDtfsCounter, 1414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=13, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 2679 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:22:10,745 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...