/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/safe029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:21:01,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:21:01,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:21:01,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:21:01,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:21:01,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:21:01,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:21:01,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:21:01,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:21:01,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:21:01,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:21:01,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:21:01,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:21:01,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:21:01,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:21:01,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:21:01,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:21:01,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:21:01,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:21:01,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:21:01,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:21:01,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:21:01,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:21:01,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:21:01,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:21:01,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:21:01,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:21:01,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:21:01,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:21:01,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:21:01,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:21:01,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:21:01,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:21:01,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:21:01,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:21:01,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:21:01,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:21:01,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:21:01,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:21:01,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:21:01,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:21:01,919 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:01,936 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:21:01,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:21:01,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:21:01,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:21:01,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:21:01,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:21:01,937 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:21:01,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:21:01,938 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:21:01,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:21:01,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:21:01,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:21:01,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:21:01,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:21:01,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:21:01,939 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:21:01,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:21:01,939 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:21:01,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:21:01,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:21:01,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:21:01,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:21:01,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:21:01,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:21:01,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:21:01,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:21:01,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:21:01,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:21:01,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:21:01,940 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:21:01,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:21:01,941 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:02,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:21:02,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:21:02,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:21:02,149 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:21:02,151 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:21:02,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-01-27 18:21:03,370 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:21:03,583 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:21:03,584 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2023-01-27 18:21:03,597 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91fbc597c/128eb581a8aa42079b04cdc49f6227f8/FLAG9855870a4 [2023-01-27 18:21:03,610 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91fbc597c/128eb581a8aa42079b04cdc49f6227f8 [2023-01-27 18:21:03,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:21:03,613 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:21:03,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:21:03,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:21:03,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:21:03,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:21:03" (1/1) ... [2023-01-27 18:21:03,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510b5c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:03, skipping insertion in model container [2023-01-27 18:21:03,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:21:03" (1/1) ... [2023-01-27 18:21:03,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:21:03,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:21:03,785 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-01-27 18:21:04,004 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:21:04,015 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:21:04,024 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2023-01-27 18:21:04,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:21:04,110 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:21:04,110 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:21:04,116 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:21:04,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:04 WrapperNode [2023-01-27 18:21:04,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:21:04,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:21:04,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:21:04,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:21:04,124 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:04" (1/1) ... [2023-01-27 18:21:04,157 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:04" (1/1) ... [2023-01-27 18:21:04,187 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-01-27 18:21:04,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:21:04,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:21:04,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:21:04,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:21:04,196 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:04" (1/1) ... [2023-01-27 18:21:04,196 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:04" (1/1) ... [2023-01-27 18:21:04,213 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:04" (1/1) ... [2023-01-27 18:21:04,213 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:04" (1/1) ... [2023-01-27 18:21:04,218 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:04" (1/1) ... [2023-01-27 18:21:04,220 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:04" (1/1) ... [2023-01-27 18:21:04,222 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:04" (1/1) ... [2023-01-27 18:21:04,223 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:04" (1/1) ... [2023-01-27 18:21:04,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:21:04,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:21:04,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:21:04,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:21:04,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:04" (1/1) ... [2023-01-27 18:21:04,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:21:04,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:21:04,268 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:04,287 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:04,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:21:04,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:21:04,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:21:04,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:21:04,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:21:04,302 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:21:04,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:21:04,303 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:21:04,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:21:04,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:21:04,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:21:04,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:21:04,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:21:04,305 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:04,486 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:21:04,488 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:21:04,718 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:21:04,856 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:21:04,856 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:21:04,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:21:04 BoogieIcfgContainer [2023-01-27 18:21:04,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:21:04,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:21:04,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:21:04,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:21:04,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:21:03" (1/3) ... [2023-01-27 18:21:04,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b40fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:21:04, skipping insertion in model container [2023-01-27 18:21:04,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:04" (2/3) ... [2023-01-27 18:21:04,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b40fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:21:04, skipping insertion in model container [2023-01-27 18:21:04,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:21:04" (3/3) ... [2023-01-27 18:21:04,884 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2023-01-27 18:21:04,899 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:21:04,899 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:21:04,899 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:21:04,961 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:21:05,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2023-01-27 18:21:05,039 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2023-01-27 18:21:05,039 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:21:05,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-01-27 18:21:05,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2023-01-27 18:21:05,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2023-01-27 18:21:05,057 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:21:05,073 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2023-01-27 18:21:05,076 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2023-01-27 18:21:05,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2023-01-27 18:21:05,115 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2023-01-27 18:21:05,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:21:05,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-01-27 18:21:05,117 INFO L119 LiptonReduction]: Number of co-enabled transitions 1020 [2023-01-27 18:21:07,919 INFO L134 LiptonReduction]: Checked pairs total: 2783 [2023-01-27 18:21:07,920 INFO L136 LiptonReduction]: Total number of compositions: 76 [2023-01-27 18:21:07,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:21:07,946 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;@54ee83c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:21:07,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-27 18:21:07,949 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-01-27 18:21:07,949 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:21:07,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:07,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:21:07,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:07,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:07,958 INFO L85 PathProgramCache]: Analyzing trace with hash 378490532, now seen corresponding path program 1 times [2023-01-27 18:21:07,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:07,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178028806] [2023-01-27 18:21:07,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:07,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:08,318 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:08,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:08,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178028806] [2023-01-27 18:21:08,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178028806] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:08,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:08,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:21:08,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239753815] [2023-01-27 18:21:08,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:08,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:21:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:08,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:21:08,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:21:08,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 162 [2023-01-27 18:21:08,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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:08,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:08,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 162 [2023-01-27 18:21:08,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:08,505 INFO L130 PetriNetUnfolder]: 159/309 cut-off events. [2023-01-27 18:21:08,506 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-01-27 18:21:08,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 309 events. 159/309 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1322 event pairs, 24 based on Foata normal form. 16/292 useless extension candidates. Maximal degree in co-relation 593. Up to 220 conditions per place. [2023-01-27 18:21:08,509 INFO L137 encePairwiseOnDemand]: 158/162 looper letters, 19 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2023-01-27 18:21:08,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 27 transitions, 110 flow [2023-01-27 18:21:08,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:21:08,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:21:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2023-01-27 18:21:08,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51440329218107 [2023-01-27 18:21:08,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 250 transitions. [2023-01-27 18:21:08,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 250 transitions. [2023-01-27 18:21:08,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:08,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 250 transitions. [2023-01-27 18:21:08,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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:08,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 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:21:08,531 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 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:21:08,533 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 250 transitions. [2023-01-27 18:21:08,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 27 transitions, 110 flow [2023-01-27 18:21:08,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:21:08,536 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-01-27 18:21:08,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-01-27 18:21:08,541 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-01-27 18:21:08,541 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-01-27 18:21:08,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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:08,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:08,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:08,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:21:08,542 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:08,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:08,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1324016816, now seen corresponding path program 1 times [2023-01-27 18:21:08,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:08,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645770429] [2023-01-27 18:21:08,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:08,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:08,905 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:08,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:08,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645770429] [2023-01-27 18:21:08,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645770429] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:08,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:08,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:21:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164166023] [2023-01-27 18:21:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:08,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:21:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:21:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:21:08,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 162 [2023-01-27 18:21:08,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 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:08,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:08,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 162 [2023-01-27 18:21:08,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:09,035 INFO L130 PetriNetUnfolder]: 147/282 cut-off events. [2023-01-27 18:21:09,036 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-01-27 18:21:09,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 282 events. 147/282 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1104 event pairs, 68 based on Foata normal form. 20/302 useless extension candidates. Maximal degree in co-relation 580. Up to 229 conditions per place. [2023-01-27 18:21:09,041 INFO L137 encePairwiseOnDemand]: 157/162 looper letters, 19 selfloop transitions, 3 changer transitions 11/34 dead transitions. [2023-01-27 18:21:09,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 150 flow [2023-01-27 18:21:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:21:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:21:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2023-01-27 18:21:09,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2023-01-27 18:21:09,048 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 385 transitions. [2023-01-27 18:21:09,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 385 transitions. [2023-01-27 18:21:09,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:09,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 385 transitions. [2023-01-27 18:21:09,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 0 states have call successors, (0), 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:09,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:09,055 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:09,055 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 5 states and 385 transitions. [2023-01-27 18:21:09,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 150 flow [2023-01-27 18:21:09,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:21:09,056 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 63 flow [2023-01-27 18:21:09,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-01-27 18:21:09,058 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-01-27 18:21:09,058 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 63 flow [2023-01-27 18:21:09,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 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:09,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:09,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:09,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:21:09,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:09,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1905131837, now seen corresponding path program 1 times [2023-01-27 18:21:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:09,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429599530] [2023-01-27 18:21:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:09,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:09,840 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:09,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:09,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429599530] [2023-01-27 18:21:09,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429599530] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:09,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:09,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:21:09,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815754366] [2023-01-27 18:21:09,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:09,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:21:09,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:09,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:21:09,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:21:09,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 162 [2023-01-27 18:21:09,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 63 flow. Second operand has 7 states, 7 states have (on average 59.285714285714285) internal successors, (415), 7 states have internal predecessors, (415), 0 states have call successors, (0), 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:09,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:09,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 162 [2023-01-27 18:21:09,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:10,132 INFO L130 PetriNetUnfolder]: 204/370 cut-off events. [2023-01-27 18:21:10,132 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2023-01-27 18:21:10,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 370 events. 204/370 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1414 event pairs, 48 based on Foata normal form. 27/397 useless extension candidates. Maximal degree in co-relation 921. Up to 248 conditions per place. [2023-01-27 18:21:10,135 INFO L137 encePairwiseOnDemand]: 151/162 looper letters, 25 selfloop transitions, 10 changer transitions 17/52 dead transitions. [2023-01-27 18:21:10,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 52 transitions, 264 flow [2023-01-27 18:21:10,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:21:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:21:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 518 transitions. [2023-01-27 18:21:10,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39969135802469136 [2023-01-27 18:21:10,137 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 518 transitions. [2023-01-27 18:21:10,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 518 transitions. [2023-01-27 18:21:10,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:10,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 518 transitions. [2023-01-27 18:21:10,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 64.75) internal successors, (518), 8 states have internal predecessors, (518), 0 states have call successors, (0), 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:10,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 162.0) internal successors, (1458), 9 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:10,142 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 162.0) internal successors, (1458), 9 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:10,142 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 63 flow. Second operand 8 states and 518 transitions. [2023-01-27 18:21:10,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 52 transitions, 264 flow [2023-01-27 18:21:10,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 52 transitions, 256 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 18:21:10,145 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 133 flow [2023-01-27 18:21:10,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=133, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-01-27 18:21:10,145 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-01-27 18:21:10,146 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 133 flow [2023-01-27 18:21:10,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.285714285714285) internal successors, (415), 7 states have internal predecessors, (415), 0 states have call successors, (0), 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:10,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:10,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:10,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:21:10,147 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:10,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:10,147 INFO L85 PathProgramCache]: Analyzing trace with hash 302192038, now seen corresponding path program 1 times [2023-01-27 18:21:10,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:10,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601861921] [2023-01-27 18:21:10,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:10,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:10,655 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:10,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:10,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601861921] [2023-01-27 18:21:10,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601861921] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:10,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:10,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:21:10,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753367977] [2023-01-27 18:21:10,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:10,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:21:10,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:10,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:21:10,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:21:10,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 162 [2023-01-27 18:21:10,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 0 states have call successors, (0), 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:10,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:10,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 162 [2023-01-27 18:21:10,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:10,793 INFO L130 PetriNetUnfolder]: 169/321 cut-off events. [2023-01-27 18:21:10,793 INFO L131 PetriNetUnfolder]: For 722/726 co-relation queries the response was YES. [2023-01-27 18:21:10,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 321 events. 169/321 cut-off events. For 722/726 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1228 event pairs, 87 based on Foata normal form. 23/341 useless extension candidates. Maximal degree in co-relation 1165. Up to 242 conditions per place. [2023-01-27 18:21:10,796 INFO L137 encePairwiseOnDemand]: 156/162 looper letters, 26 selfloop transitions, 6 changer transitions 13/47 dead transitions. [2023-01-27 18:21:10,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 344 flow [2023-01-27 18:21:10,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:21:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:21:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2023-01-27 18:21:10,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45164609053497945 [2023-01-27 18:21:10,798 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 439 transitions. [2023-01-27 18:21:10,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 439 transitions. [2023-01-27 18:21:10,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:10,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 439 transitions. [2023-01-27 18:21:10,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 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:10,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 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:10,809 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 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:10,810 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 133 flow. Second operand 6 states and 439 transitions. [2023-01-27 18:21:10,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 344 flow [2023-01-27 18:21:10,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 324 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-27 18:21:10,817 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 166 flow [2023-01-27 18:21:10,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-27 18:21:10,819 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2023-01-27 18:21:10,819 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 166 flow [2023-01-27 18:21:10,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 0 states have call successors, (0), 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:10,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:10,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:10,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:21:10,821 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:10,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:10,821 INFO L85 PathProgramCache]: Analyzing trace with hash -196002357, now seen corresponding path program 1 times [2023-01-27 18:21:10,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:10,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711684487] [2023-01-27 18:21:10,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:10,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:11,307 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:11,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:11,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711684487] [2023-01-27 18:21:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711684487] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:11,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:21:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445250676] [2023-01-27 18:21:11,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:11,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:21:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:11,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:21:11,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:21:11,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 162 [2023-01-27 18:21:11,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 166 flow. Second operand has 7 states, 7 states have (on average 68.57142857142857) internal successors, (480), 7 states have internal predecessors, (480), 0 states have call successors, (0), 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:11,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:11,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 162 [2023-01-27 18:21:11,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:11,476 INFO L130 PetriNetUnfolder]: 173/321 cut-off events. [2023-01-27 18:21:11,476 INFO L131 PetriNetUnfolder]: For 876/884 co-relation queries the response was YES. [2023-01-27 18:21:11,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 321 events. 173/321 cut-off events. For 876/884 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1239 event pairs, 49 based on Foata normal form. 19/337 useless extension candidates. Maximal degree in co-relation 1260. Up to 243 conditions per place. [2023-01-27 18:21:11,479 INFO L137 encePairwiseOnDemand]: 154/162 looper letters, 32 selfloop transitions, 11 changer transitions 10/55 dead transitions. [2023-01-27 18:21:11,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 422 flow [2023-01-27 18:21:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:21:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:21:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 509 transitions. [2023-01-27 18:21:11,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4488536155202822 [2023-01-27 18:21:11,481 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 509 transitions. [2023-01-27 18:21:11,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 509 transitions. [2023-01-27 18:21:11,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:11,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 509 transitions. [2023-01-27 18:21:11,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 72.71428571428571) internal successors, (509), 7 states have internal predecessors, (509), 0 states have call successors, (0), 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:11,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 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:11,485 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 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:11,485 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 166 flow. Second operand 7 states and 509 transitions. [2023-01-27 18:21:11,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 422 flow [2023-01-27 18:21:11,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 412 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-01-27 18:21:11,488 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 255 flow [2023-01-27 18:21:11,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-01-27 18:21:11,490 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2023-01-27 18:21:11,490 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 255 flow [2023-01-27 18:21:11,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.57142857142857) internal successors, (480), 7 states have internal predecessors, (480), 0 states have call successors, (0), 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:11,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:11,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:11,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:21:11,493 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:11,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:11,493 INFO L85 PathProgramCache]: Analyzing trace with hash -195368097, now seen corresponding path program 2 times [2023-01-27 18:21:11,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:11,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999234266] [2023-01-27 18:21:11,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:11,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:11,952 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:11,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:11,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999234266] [2023-01-27 18:21:11,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999234266] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:11,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:11,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:21:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890003542] [2023-01-27 18:21:11,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:11,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:21:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:11,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:21:11,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:21:11,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 162 [2023-01-27 18:21:11,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 67.57142857142857) internal successors, (473), 7 states have internal predecessors, (473), 0 states have call successors, (0), 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:11,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:11,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 162 [2023-01-27 18:21:11,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:12,110 INFO L130 PetriNetUnfolder]: 173/322 cut-off events. [2023-01-27 18:21:12,110 INFO L131 PetriNetUnfolder]: For 1612/1620 co-relation queries the response was YES. [2023-01-27 18:21:12,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 322 events. 173/322 cut-off events. For 1612/1620 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1245 event pairs, 52 based on Foata normal form. 18/337 useless extension candidates. Maximal degree in co-relation 1508. Up to 247 conditions per place. [2023-01-27 18:21:12,113 INFO L137 encePairwiseOnDemand]: 154/162 looper letters, 34 selfloop transitions, 16 changer transitions 7/59 dead transitions. [2023-01-27 18:21:12,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 548 flow [2023-01-27 18:21:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:21:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:21:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 432 transitions. [2023-01-27 18:21:12,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-01-27 18:21:12,115 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 432 transitions. [2023-01-27 18:21:12,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 432 transitions. [2023-01-27 18:21:12,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:12,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 432 transitions. [2023-01-27 18:21:12,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 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:12,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 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:12,118 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 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:12,118 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 255 flow. Second operand 6 states and 432 transitions. [2023-01-27 18:21:12,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 548 flow [2023-01-27 18:21:12,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 511 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-01-27 18:21:12,123 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 367 flow [2023-01-27 18:21:12,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-01-27 18:21:12,123 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2023-01-27 18:21:12,124 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 367 flow [2023-01-27 18:21:12,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.57142857142857) internal successors, (473), 7 states have internal predecessors, (473), 0 states have call successors, (0), 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:12,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:12,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:12,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:21:12,124 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:12,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash 776375883, now seen corresponding path program 3 times [2023-01-27 18:21:12,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:12,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926191213] [2023-01-27 18:21:12,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:12,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:12,470 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:12,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:12,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926191213] [2023-01-27 18:21:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926191213] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:12,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:21:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918954602] [2023-01-27 18:21:12,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:12,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:21:12,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:12,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:21:12,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:21:12,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 162 [2023-01-27 18:21:12,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 367 flow. Second operand has 7 states, 7 states have (on average 67.57142857142857) internal successors, (473), 7 states have internal predecessors, (473), 0 states have call successors, (0), 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:12,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:12,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 162 [2023-01-27 18:21:12,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:12,677 INFO L130 PetriNetUnfolder]: 194/367 cut-off events. [2023-01-27 18:21:12,677 INFO L131 PetriNetUnfolder]: For 2424/2435 co-relation queries the response was YES. [2023-01-27 18:21:12,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 367 events. 194/367 cut-off events. For 2424/2435 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1507 event pairs, 39 based on Foata normal form. 29/391 useless extension candidates. Maximal degree in co-relation 1842. Up to 203 conditions per place. [2023-01-27 18:21:12,681 INFO L137 encePairwiseOnDemand]: 155/162 looper letters, 34 selfloop transitions, 22 changer transitions 12/70 dead transitions. [2023-01-27 18:21:12,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 723 flow [2023-01-27 18:21:12,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:21:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:21:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 503 transitions. [2023-01-27 18:21:12,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435626102292769 [2023-01-27 18:21:12,683 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 503 transitions. [2023-01-27 18:21:12,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 503 transitions. [2023-01-27 18:21:12,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:12,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 503 transitions. [2023-01-27 18:21:12,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 71.85714285714286) internal successors, (503), 7 states have internal predecessors, (503), 0 states have call successors, (0), 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:12,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 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:12,687 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 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:12,687 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 367 flow. Second operand 7 states and 503 transitions. [2023-01-27 18:21:12,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 723 flow [2023-01-27 18:21:12,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 695 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-01-27 18:21:12,694 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 466 flow [2023-01-27 18:21:12,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=466, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-01-27 18:21:12,695 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2023-01-27 18:21:12,695 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 466 flow [2023-01-27 18:21:12,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.57142857142857) internal successors, (473), 7 states have internal predecessors, (473), 0 states have call successors, (0), 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:12,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:12,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:12,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:21:12,696 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:12,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1640860964, now seen corresponding path program 1 times [2023-01-27 18:21:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:12,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702268958] [2023-01-27 18:21:12,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:13,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:21:13,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:13,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702268958] [2023-01-27 18:21:13,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702268958] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:13,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:13,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:21:13,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295262005] [2023-01-27 18:21:13,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:13,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:21:13,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:13,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:21:13,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:21:13,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 162 [2023-01-27 18:21:13,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 64.2) internal successors, (321), 5 states have internal predecessors, (321), 0 states have call successors, (0), 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:13,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:13,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 162 [2023-01-27 18:21:13,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:13,258 INFO L130 PetriNetUnfolder]: 250/474 cut-off events. [2023-01-27 18:21:13,258 INFO L131 PetriNetUnfolder]: For 3500/3500 co-relation queries the response was YES. [2023-01-27 18:21:13,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 474 events. 250/474 cut-off events. For 3500/3500 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2034 event pairs, 80 based on Foata normal form. 22/496 useless extension candidates. Maximal degree in co-relation 2568. Up to 235 conditions per place. [2023-01-27 18:21:13,262 INFO L137 encePairwiseOnDemand]: 156/162 looper letters, 37 selfloop transitions, 7 changer transitions 32/76 dead transitions. [2023-01-27 18:21:13,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 905 flow [2023-01-27 18:21:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:21:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:21:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2023-01-27 18:21:13,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2023-01-27 18:21:13,263 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 414 transitions. [2023-01-27 18:21:13,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 414 transitions. [2023-01-27 18:21:13,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:13,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 414 transitions. [2023-01-27 18:21:13,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 69.0) internal successors, (414), 6 states have internal predecessors, (414), 0 states have call successors, (0), 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:13,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 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:13,267 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 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:13,267 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 466 flow. Second operand 6 states and 414 transitions. [2023-01-27 18:21:13,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 905 flow [2023-01-27 18:21:13,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 832 flow, removed 33 selfloop flow, removed 4 redundant places. [2023-01-27 18:21:13,274 INFO L231 Difference]: Finished difference. Result has 57 places, 36 transitions, 338 flow [2023-01-27 18:21:13,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2023-01-27 18:21:13,274 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 31 predicate places. [2023-01-27 18:21:13,274 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 338 flow [2023-01-27 18:21:13,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.2) internal successors, (321), 5 states have internal predecessors, (321), 0 states have call successors, (0), 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:13,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:13,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:13,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:21:13,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:13,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash -127675393, now seen corresponding path program 1 times [2023-01-27 18:21:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:13,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73256913] [2023-01-27 18:21:13,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:13,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:14,070 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:14,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:14,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73256913] [2023-01-27 18:21:14,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73256913] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:14,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:14,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:21:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030970266] [2023-01-27 18:21:14,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:14,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:21:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:14,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:21:14,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:21:14,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 162 [2023-01-27 18:21:14,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 338 flow. Second operand has 8 states, 8 states have (on average 65.5) internal successors, (524), 8 states have internal predecessors, (524), 0 states have call successors, (0), 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:14,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:14,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 162 [2023-01-27 18:21:14,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:14,239 INFO L130 PetriNetUnfolder]: 174/356 cut-off events. [2023-01-27 18:21:14,240 INFO L131 PetriNetUnfolder]: For 2363/2374 co-relation queries the response was YES. [2023-01-27 18:21:14,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1836 conditions, 356 events. 174/356 cut-off events. For 2363/2374 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1563 event pairs, 102 based on Foata normal form. 14/367 useless extension candidates. Maximal degree in co-relation 1804. Up to 293 conditions per place. [2023-01-27 18:21:14,242 INFO L137 encePairwiseOnDemand]: 155/162 looper letters, 27 selfloop transitions, 6 changer transitions 15/50 dead transitions. [2023-01-27 18:21:14,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 520 flow [2023-01-27 18:21:14,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:21:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:21:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 482 transitions. [2023-01-27 18:21:14,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42504409171075835 [2023-01-27 18:21:14,245 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 482 transitions. [2023-01-27 18:21:14,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 482 transitions. [2023-01-27 18:21:14,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:14,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 482 transitions. [2023-01-27 18:21:14,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 68.85714285714286) internal successors, (482), 7 states have internal predecessors, (482), 0 states have call successors, (0), 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:14,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 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:14,248 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 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:14,248 INFO L175 Difference]: Start difference. First operand has 57 places, 36 transitions, 338 flow. Second operand 7 states and 482 transitions. [2023-01-27 18:21:14,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 520 flow [2023-01-27 18:21:14,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 500 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-01-27 18:21:14,254 INFO L231 Difference]: Finished difference. Result has 59 places, 32 transitions, 300 flow [2023-01-27 18:21:14,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=59, PETRI_TRANSITIONS=32} [2023-01-27 18:21:14,255 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 33 predicate places. [2023-01-27 18:21:14,255 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 32 transitions, 300 flow [2023-01-27 18:21:14,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 65.5) internal successors, (524), 8 states have internal predecessors, (524), 0 states have call successors, (0), 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:14,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:14,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:14,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:21:14,256 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:14,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1761470973, now seen corresponding path program 2 times [2023-01-27 18:21:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:14,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719211508] [2023-01-27 18:21:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:14,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:14,832 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:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:14,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719211508] [2023-01-27 18:21:14,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719211508] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:14,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:14,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:21:14,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078631792] [2023-01-27 18:21:14,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:14,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:21:14,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:14,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:21:14,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:21:14,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 162 [2023-01-27 18:21:14,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 32 transitions, 300 flow. Second operand has 8 states, 8 states have (on average 67.5) internal successors, (540), 8 states have internal predecessors, (540), 0 states have call successors, (0), 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:14,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:14,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 162 [2023-01-27 18:21:14,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:15,074 INFO L130 PetriNetUnfolder]: 144/293 cut-off events. [2023-01-27 18:21:15,074 INFO L131 PetriNetUnfolder]: For 2142/2152 co-relation queries the response was YES. [2023-01-27 18:21:15,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1511 conditions, 293 events. 144/293 cut-off events. For 2142/2152 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1189 event pairs, 12 based on Foata normal form. 22/314 useless extension candidates. Maximal degree in co-relation 1478. Up to 160 conditions per place. [2023-01-27 18:21:15,076 INFO L137 encePairwiseOnDemand]: 155/162 looper letters, 24 selfloop transitions, 9 changer transitions 18/52 dead transitions. [2023-01-27 18:21:15,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 543 flow [2023-01-27 18:21:15,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:21:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:21:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 635 transitions. [2023-01-27 18:21:15,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355281207133059 [2023-01-27 18:21:15,079 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 635 transitions. [2023-01-27 18:21:15,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 635 transitions. [2023-01-27 18:21:15,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:15,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 635 transitions. [2023-01-27 18:21:15,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 70.55555555555556) internal successors, (635), 9 states have internal predecessors, (635), 0 states have call successors, (0), 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:15,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 0 states have call successors, (0), 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:15,083 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 0 states have call successors, (0), 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:15,083 INFO L175 Difference]: Start difference. First operand has 59 places, 32 transitions, 300 flow. Second operand 9 states and 635 transitions. [2023-01-27 18:21:15,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 543 flow [2023-01-27 18:21:15,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 483 flow, removed 24 selfloop flow, removed 7 redundant places. [2023-01-27 18:21:15,089 INFO L231 Difference]: Finished difference. Result has 60 places, 24 transitions, 233 flow [2023-01-27 18:21:15,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=233, PETRI_PLACES=60, PETRI_TRANSITIONS=24} [2023-01-27 18:21:15,090 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 34 predicate places. [2023-01-27 18:21:15,090 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 24 transitions, 233 flow [2023-01-27 18:21:15,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 67.5) internal successors, (540), 8 states have internal predecessors, (540), 0 states have call successors, (0), 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:15,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:15,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:15,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:21:15,090 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:15,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:15,091 INFO L85 PathProgramCache]: Analyzing trace with hash -252574051, now seen corresponding path program 1 times [2023-01-27 18:21:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:15,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369833267] [2023-01-27 18:21:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:15,261 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:15,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:15,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369833267] [2023-01-27 18:21:15,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369833267] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:15,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:15,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:21:15,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562132215] [2023-01-27 18:21:15,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:15,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:21:15,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:15,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:21:15,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:21:15,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 162 [2023-01-27 18:21:15,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 24 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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:15,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:15,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 162 [2023-01-27 18:21:15,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:15,303 INFO L130 PetriNetUnfolder]: 30/78 cut-off events. [2023-01-27 18:21:15,303 INFO L131 PetriNetUnfolder]: For 576/578 co-relation queries the response was YES. [2023-01-27 18:21:15,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 78 events. 30/78 cut-off events. For 576/578 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 203 event pairs, 6 based on Foata normal form. 11/89 useless extension candidates. Maximal degree in co-relation 431. Up to 59 conditions per place. [2023-01-27 18:21:15,304 INFO L137 encePairwiseOnDemand]: 158/162 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-01-27 18:21:15,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 29 transitions, 336 flow [2023-01-27 18:21:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:21:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:21:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2023-01-27 18:21:15,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794238683127572 [2023-01-27 18:21:15,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 233 transitions. [2023-01-27 18:21:15,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 233 transitions. [2023-01-27 18:21:15,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:15,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 233 transitions. [2023-01-27 18:21:15,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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:15,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 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:21:15,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 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:21:15,307 INFO L175 Difference]: Start difference. First operand has 60 places, 24 transitions, 233 flow. Second operand 3 states and 233 transitions. [2023-01-27 18:21:15,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 29 transitions, 336 flow [2023-01-27 18:21:15,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 236 flow, removed 32 selfloop flow, removed 20 redundant places. [2023-01-27 18:21:15,309 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 164 flow [2023-01-27 18:21:15,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-01-27 18:21:15,310 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2023-01-27 18:21:15,310 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 164 flow [2023-01-27 18:21:15,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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:15,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:15,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:15,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:21:15,310 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:15,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:15,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1260231225, now seen corresponding path program 1 times [2023-01-27 18:21:15,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:15,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469008478] [2023-01-27 18:21:15,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:15,466 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:15,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:15,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469008478] [2023-01-27 18:21:15,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469008478] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:15,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:15,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:21:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273583604] [2023-01-27 18:21:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:15,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:21:15,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:15,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:21:15,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:21:15,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 162 [2023-01-27 18:21:15,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 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:15,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:15,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 162 [2023-01-27 18:21:15,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:15,504 INFO L130 PetriNetUnfolder]: 8/33 cut-off events. [2023-01-27 18:21:15,504 INFO L131 PetriNetUnfolder]: For 73/74 co-relation queries the response was YES. [2023-01-27 18:21:15,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 33 events. 8/33 cut-off events. For 73/74 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 8/41 useless extension candidates. Maximal degree in co-relation 141. Up to 16 conditions per place. [2023-01-27 18:21:15,505 INFO L137 encePairwiseOnDemand]: 158/162 looper letters, 21 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2023-01-27 18:21:15,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 251 flow [2023-01-27 18:21:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:21:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:21:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 304 transitions. [2023-01-27 18:21:15,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2023-01-27 18:21:15,506 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 304 transitions. [2023-01-27 18:21:15,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 304 transitions. [2023-01-27 18:21:15,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:15,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 304 transitions. [2023-01-27 18:21:15,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 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:15,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 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:15,509 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 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:15,509 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 164 flow. Second operand 4 states and 304 transitions. [2023-01-27 18:21:15,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 251 flow [2023-01-27 18:21:15,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 210 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-01-27 18:21:15,510 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 145 flow [2023-01-27 18:21:15,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-01-27 18:21:15,511 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2023-01-27 18:21:15,511 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 145 flow [2023-01-27 18:21:15,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 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:15,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:15,512 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:21:15,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:21:15,512 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:15,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash 537516767, now seen corresponding path program 1 times [2023-01-27 18:21:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444344522] [2023-01-27 18:21:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:15,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:21:15,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:21:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:21:15,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:21:15,585 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:21:15,586 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-27 18:21:15,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-27 18:21:15,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-27 18:21:15,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-27 18:21:15,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-27 18:21:15,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:21:15,588 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:15,593 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:21:15,593 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:21:15,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:21:15 BasicIcfg [2023-01-27 18:21:15,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:21:15,643 INFO L158 Benchmark]: Toolchain (without parser) took 12030.20ms. Allocated memory was 362.8MB in the beginning and 524.3MB in the end (delta: 161.5MB). Free memory was 327.5MB in the beginning and 375.4MB in the end (delta: -47.9MB). Peak memory consumption was 114.8MB. Max. memory is 16.0GB. [2023-01-27 18:21:15,643 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:21:15,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.98ms. Allocated memory is still 362.8MB. Free memory was 327.2MB in the beginning and 304.9MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:21:15,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.72ms. Allocated memory is still 362.8MB. Free memory was 304.9MB in the beginning and 302.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:21:15,644 INFO L158 Benchmark]: Boogie Preprocessor took 49.13ms. Allocated memory is still 362.8MB. Free memory was 302.4MB in the beginning and 300.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:21:15,644 INFO L158 Benchmark]: RCFGBuilder took 620.50ms. Allocated memory is still 362.8MB. Free memory was 300.4MB in the beginning and 268.0MB in the end (delta: 32.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-01-27 18:21:15,656 INFO L158 Benchmark]: TraceAbstraction took 10764.88ms. Allocated memory was 362.8MB in the beginning and 524.3MB in the end (delta: 161.5MB). Free memory was 337.4MB in the beginning and 375.4MB in the end (delta: -38.0MB). Peak memory consumption was 122.6MB. Max. memory is 16.0GB. [2023-01-27 18:21:15,658 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.13ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 502.98ms. Allocated memory is still 362.8MB. Free memory was 327.2MB in the beginning and 304.9MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.72ms. Allocated memory is still 362.8MB. Free memory was 304.9MB in the beginning and 302.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.13ms. Allocated memory is still 362.8MB. Free memory was 302.4MB in the beginning and 300.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 620.50ms. Allocated memory is still 362.8MB. Free memory was 300.4MB in the beginning and 268.0MB in the end (delta: 32.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 10764.88ms. Allocated memory was 362.8MB in the beginning and 524.3MB in the end (delta: 161.5MB). Free memory was 337.4MB in the beginning and 375.4MB in the end (delta: -38.0MB). Peak memory consumption was 122.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 89 PlacesBefore, 26 PlacesAfterwards, 84 TransitionsBefore, 20 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 2783 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1108, independent: 983, independent conditional: 0, independent unconditional: 983, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 541, independent: 519, independent conditional: 0, independent unconditional: 519, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1108, independent: 464, independent conditional: 0, independent unconditional: 464, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 541, unknown conditional: 0, unknown unconditional: 541] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475, ((void *)0), P0, ((void *)0))=-1, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476, ((void *)0), P1, ((void *)0))=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L821] 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}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - 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: 793]: 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: 791]: 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 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 925 IncrementalHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 19 mSDtfsCounter, 925 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=466occurred in iteration=7, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 1232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:21:15,672 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...