/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/mix019.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:08:04,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:08:04,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:08:04,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:08:04,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:08:04,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:08:04,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:08:04,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:08:04,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:08:04,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:08:04,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:08:04,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:08:04,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:08:04,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:08:04,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:08:04,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:08:04,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:08:04,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:08:04,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:08:04,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:08:04,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:08:04,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:08:04,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:08:04,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:08:04,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:08:04,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:08:04,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:08:04,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:08:04,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:08:04,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:08:04,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:08:04,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:08:04,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:08:04,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:08:04,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:08:04,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:08:04,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:08:04,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:08:04,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:08:04,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:08:04,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:08:04,927 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:08:04,944 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:08:04,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:08:04,945 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:08:04,945 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:08:04,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:08:04,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:08:04,946 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:08:04,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:08:04,946 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:08:04,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:08:04,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:08:04,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:08:04,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:08:04,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:08:04,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:08:04,947 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:08:04,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:08:04,948 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:08:04,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:08:04,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:08:04,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:08:04,948 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:08:04,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:08:04,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:08:04,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:08:04,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:08:04,949 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:08:04,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:08:04,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:08:04,949 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:08:04,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:08:04,950 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:08:05,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:08:05,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:08:05,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:08:05,182 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:08:05,183 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:08:05,184 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2023-01-27 18:08:06,339 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:08:06,531 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:08:06,532 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2023-01-27 18:08:06,543 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9033f1b/cdc0b1d69b024e6db728e9a7427803bf/FLAGc642aca42 [2023-01-27 18:08:06,555 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9033f1b/cdc0b1d69b024e6db728e9a7427803bf [2023-01-27 18:08:06,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:08:06,559 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:08:06,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:08:06,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:08:06,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:08:06,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8ce48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:06, skipping insertion in model container [2023-01-27 18:08:06,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:08:06" (1/1) ... [2023-01-27 18:08:06,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:08:06,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:08:06,809 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/mix019.opt.i[944,957] [2023-01-27 18:08:07,039 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:08:07,051 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:08:07,064 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/mix019.opt.i[944,957] [2023-01-27 18:08:07,103 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:08:07,137 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:08:07,138 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:08:07,144 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:08:07,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:07 WrapperNode [2023-01-27 18:08:07,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:08:07,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:08:07,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:08:07,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:08:07,153 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:08:07" (1/1) ... [2023-01-27 18:08:07,184 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:08:07" (1/1) ... [2023-01-27 18:08:07,216 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2023-01-27 18:08:07,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:08:07,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:08:07,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:08:07,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:08:07,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:07" (1/1) ... [2023-01-27 18:08:07,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:07" (1/1) ... [2023-01-27 18:08:07,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:07" (1/1) ... [2023-01-27 18:08:07,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:07" (1/1) ... [2023-01-27 18:08:07,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:07" (1/1) ... [2023-01-27 18:08:07,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:07" (1/1) ... [2023-01-27 18:08:07,247 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:07" (1/1) ... [2023-01-27 18:08:07,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:07" (1/1) ... [2023-01-27 18:08:07,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:08:07,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:08:07,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:08:07,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:08:07,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:07" (1/1) ... [2023-01-27 18:08:07,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:08:07,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:08:07,294 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:08:07,318 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:08:07,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:08:07,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:08:07,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:08:07,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:08:07,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:08:07,336 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:08:07,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:08:07,336 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:08:07,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:08:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:08:07,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:08:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:08:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:08:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:08:07,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:08:07,339 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:08:07,460 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:08:07,462 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:08:07,858 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:08:07,997 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:08:07,998 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:08:08,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:08:08 BoogieIcfgContainer [2023-01-27 18:08:08,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:08:08,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:08:08,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:08:08,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:08:08,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:08:06" (1/3) ... [2023-01-27 18:08:08,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1912586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:08:08, skipping insertion in model container [2023-01-27 18:08:08,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:08:07" (2/3) ... [2023-01-27 18:08:08,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1912586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:08:08, skipping insertion in model container [2023-01-27 18:08:08,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:08:08" (3/3) ... [2023-01-27 18:08:08,010 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2023-01-27 18:08:08,027 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:08:08,027 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:08:08,027 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:08:08,095 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:08:08,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-01-27 18:08:08,177 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-01-27 18:08:08,177 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:08:08,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-27 18:08:08,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-01-27 18:08:08,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-01-27 18:08:08,191 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:08:08,199 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-01-27 18:08:08,203 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-01-27 18:08:08,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-01-27 18:08:08,231 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-01-27 18:08:08,232 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:08:08,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-27 18:08:08,234 INFO L119 LiptonReduction]: Number of co-enabled transitions 1758 [2023-01-27 18:08:11,392 INFO L134 LiptonReduction]: Checked pairs total: 4661 [2023-01-27 18:08:11,393 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-01-27 18:08:11,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:08:11,412 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;@859e1cc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:08:11,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:08:11,416 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2023-01-27 18:08:11,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:08:11,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:11,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:11,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:08:11,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:11,422 INFO L85 PathProgramCache]: Analyzing trace with hash 992158827, now seen corresponding path program 1 times [2023-01-27 18:08:11,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:11,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934010415] [2023-01-27 18:08:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:11,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:11,872 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:08:11,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934010415] [2023-01-27 18:08:11,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934010415] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:11,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:11,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:08:11,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044739006] [2023-01-27 18:08:11,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:11,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:08:11,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:11,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:08:11,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:08:11,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 199 [2023-01-27 18:08:11,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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:08:11,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:11,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 199 [2023-01-27 18:08:11,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:12,196 INFO L130 PetriNetUnfolder]: 910/1447 cut-off events. [2023-01-27 18:08:12,196 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2023-01-27 18:08:12,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1447 events. 910/1447 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7047 event pairs, 146 based on Foata normal form. 60/1386 useless extension candidates. Maximal degree in co-relation 2834. Up to 1101 conditions per place. [2023-01-27 18:08:12,207 INFO L137 encePairwiseOnDemand]: 195/199 looper letters, 26 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2023-01-27 18:08:12,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 141 flow [2023-01-27 18:08:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:08:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:08:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-01-27 18:08:12,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360134003350083 [2023-01-27 18:08:12,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-01-27 18:08:12,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-01-27 18:08:12,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:12,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-01-27 18:08:12,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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:08:12,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 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:08:12,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 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:08:12,244 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 320 transitions. [2023-01-27 18:08:12,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 141 flow [2023-01-27 18:08:12,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:08:12,250 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-01-27 18:08:12,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-01-27 18:08:12,255 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 18:08:12,255 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-01-27 18:08:12,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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:08:12,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:12,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:12,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:08:12,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:08:12,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash -559402200, now seen corresponding path program 1 times [2023-01-27 18:08:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:12,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777556355] [2023-01-27 18:08:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:12,599 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:08:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:12,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777556355] [2023-01-27 18:08:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777556355] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:12,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:08:12,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938498012] [2023-01-27 18:08:12,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:12,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:08:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:12,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:08:12,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:08:12,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 199 [2023-01-27 18:08:12,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 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:08:12,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:12,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 199 [2023-01-27 18:08:12,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:13,002 INFO L130 PetriNetUnfolder]: 1637/2514 cut-off events. [2023-01-27 18:08:13,002 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2023-01-27 18:08:13,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5210 conditions, 2514 events. 1637/2514 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12129 event pairs, 509 based on Foata normal form. 140/2654 useless extension candidates. Maximal degree in co-relation 5200. Up to 1523 conditions per place. [2023-01-27 18:08:13,016 INFO L137 encePairwiseOnDemand]: 191/199 looper letters, 31 selfloop transitions, 6 changer transitions 23/60 dead transitions. [2023-01-27 18:08:13,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 60 transitions, 258 flow [2023-01-27 18:08:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:08:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:08:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2023-01-27 18:08:13,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4844221105527638 [2023-01-27 18:08:13,018 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 482 transitions. [2023-01-27 18:08:13,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 482 transitions. [2023-01-27 18:08:13,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:13,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 482 transitions. [2023-01-27 18:08:13,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.4) internal successors, (482), 5 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:08:13,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 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:08:13,023 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 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:08:13,023 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 482 transitions. [2023-01-27 18:08:13,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 60 transitions, 258 flow [2023-01-27 18:08:13,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 60 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:08:13,027 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 108 flow [2023-01-27 18:08:13,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-01-27 18:08:13,028 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-01-27 18:08:13,028 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 108 flow [2023-01-27 18:08:13,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 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:08:13,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:13,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:13,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:08:13,029 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:08:13,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:13,032 INFO L85 PathProgramCache]: Analyzing trace with hash -161624351, now seen corresponding path program 1 times [2023-01-27 18:08:13,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:13,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332992888] [2023-01-27 18:08:13,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:13,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:13,274 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:08:13,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332992888] [2023-01-27 18:08:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332992888] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:13,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:13,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:08:13,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411827211] [2023-01-27 18:08:13,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:13,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:08:13,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:08:13,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:08:13,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 199 [2023-01-27 18:08:13,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 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:08:13,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:13,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 199 [2023-01-27 18:08:13,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:13,634 INFO L130 PetriNetUnfolder]: 1405/2178 cut-off events. [2023-01-27 18:08:13,634 INFO L131 PetriNetUnfolder]: For 1636/1636 co-relation queries the response was YES. [2023-01-27 18:08:13,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6118 conditions, 2178 events. 1405/2178 cut-off events. For 1636/1636 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10050 event pairs, 357 based on Foata normal form. 108/2286 useless extension candidates. Maximal degree in co-relation 6104. Up to 1083 conditions per place. [2023-01-27 18:08:13,651 INFO L137 encePairwiseOnDemand]: 191/199 looper letters, 35 selfloop transitions, 7 changer transitions 24/66 dead transitions. [2023-01-27 18:08:13,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 66 transitions, 382 flow [2023-01-27 18:08:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:08:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:08:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2023-01-27 18:08:13,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680545585068198 [2023-01-27 18:08:13,655 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2023-01-27 18:08:13,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2023-01-27 18:08:13,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:13,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2023-01-27 18:08:13,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 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:08:13,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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:08:13,660 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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:08:13,660 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 108 flow. Second operand 7 states and 652 transitions. [2023-01-27 18:08:13,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 66 transitions, 382 flow [2023-01-27 18:08:13,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 66 transitions, 348 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 18:08:13,671 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 152 flow [2023-01-27 18:08:13,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2023-01-27 18:08:13,672 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-01-27 18:08:13,675 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 152 flow [2023-01-27 18:08:13,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 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:08:13,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:13,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:13,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:08:13,676 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:08:13,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:13,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2097312661, now seen corresponding path program 1 times [2023-01-27 18:08:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:13,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807772067] [2023-01-27 18:08:13,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:13,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:13,903 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:08:13,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:13,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807772067] [2023-01-27 18:08:13,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807772067] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:13,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:13,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:08:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491926511] [2023-01-27 18:08:13,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:13,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:08:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:13,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:08:13,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:08:13,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 199 [2023-01-27 18:08:13,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 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:08:13,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:13,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 199 [2023-01-27 18:08:13,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:14,296 INFO L130 PetriNetUnfolder]: 1300/2027 cut-off events. [2023-01-27 18:08:14,296 INFO L131 PetriNetUnfolder]: For 3248/3248 co-relation queries the response was YES. [2023-01-27 18:08:14,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6236 conditions, 2027 events. 1300/2027 cut-off events. For 3248/3248 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9509 event pairs, 285 based on Foata normal form. 94/2121 useless extension candidates. Maximal degree in co-relation 6216. Up to 1227 conditions per place. [2023-01-27 18:08:14,311 INFO L137 encePairwiseOnDemand]: 191/199 looper letters, 41 selfloop transitions, 13 changer transitions 23/77 dead transitions. [2023-01-27 18:08:14,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 77 transitions, 494 flow [2023-01-27 18:08:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:08:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:08:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2023-01-27 18:08:14,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47595118449389806 [2023-01-27 18:08:14,314 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 663 transitions. [2023-01-27 18:08:14,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 663 transitions. [2023-01-27 18:08:14,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:14,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 663 transitions. [2023-01-27 18:08:14,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 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:08:14,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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:08:14,323 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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:08:14,323 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 152 flow. Second operand 7 states and 663 transitions. [2023-01-27 18:08:14,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 77 transitions, 494 flow [2023-01-27 18:08:14,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 77 transitions, 476 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-01-27 18:08:14,343 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 223 flow [2023-01-27 18:08:14,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-01-27 18:08:14,344 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-01-27 18:08:14,345 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 223 flow [2023-01-27 18:08:14,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 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:08:14,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:14,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:14,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:08:14,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:08:14,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash -590882206, now seen corresponding path program 1 times [2023-01-27 18:08:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:14,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953789567] [2023-01-27 18:08:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:14,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:14,599 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:08:14,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953789567] [2023-01-27 18:08:14,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953789567] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:14,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:14,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:08:14,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794144603] [2023-01-27 18:08:14,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:14,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:08:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:14,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:08:14,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:08:14,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 199 [2023-01-27 18:08:14,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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:08:14,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:14,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 199 [2023-01-27 18:08:14,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:14,764 INFO L130 PetriNetUnfolder]: 555/947 cut-off events. [2023-01-27 18:08:14,765 INFO L131 PetriNetUnfolder]: For 1805/1859 co-relation queries the response was YES. [2023-01-27 18:08:14,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3152 conditions, 947 events. 555/947 cut-off events. For 1805/1859 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4352 event pairs, 141 based on Foata normal form. 56/982 useless extension candidates. Maximal degree in co-relation 3128. Up to 782 conditions per place. [2023-01-27 18:08:14,773 INFO L137 encePairwiseOnDemand]: 194/199 looper letters, 42 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-01-27 18:08:14,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 425 flow [2023-01-27 18:08:14,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:08:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:08:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-01-27 18:08:14,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125628140703518 [2023-01-27 18:08:14,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-01-27 18:08:14,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-01-27 18:08:14,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:14,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-01-27 18:08:14,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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:08:14,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 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:08:14,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 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:08:14,779 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 223 flow. Second operand 3 states and 306 transitions. [2023-01-27 18:08:14,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 425 flow [2023-01-27 18:08:14,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 407 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-01-27 18:08:14,785 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 235 flow [2023-01-27 18:08:14,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-01-27 18:08:14,787 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-01-27 18:08:14,787 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 235 flow [2023-01-27 18:08:14,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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:08:14,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:14,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:14,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:08:14,788 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:08:14,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1404043233, now seen corresponding path program 1 times [2023-01-27 18:08:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:14,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245333239] [2023-01-27 18:08:14,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:14,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:15,073 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:08:15,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:15,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245333239] [2023-01-27 18:08:15,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245333239] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:15,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:15,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:08:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485782407] [2023-01-27 18:08:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:15,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:08:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:08:15,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:08:15,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 199 [2023-01-27 18:08:15,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 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:08:15,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:15,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 199 [2023-01-27 18:08:15,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:15,332 INFO L130 PetriNetUnfolder]: 813/1396 cut-off events. [2023-01-27 18:08:15,332 INFO L131 PetriNetUnfolder]: For 2307/2307 co-relation queries the response was YES. [2023-01-27 18:08:15,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5025 conditions, 1396 events. 813/1396 cut-off events. For 2307/2307 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6699 event pairs, 244 based on Foata normal form. 38/1434 useless extension candidates. Maximal degree in co-relation 5003. Up to 654 conditions per place. [2023-01-27 18:08:15,341 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 44 selfloop transitions, 9 changer transitions 19/72 dead transitions. [2023-01-27 18:08:15,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 531 flow [2023-01-27 18:08:15,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:08:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:08:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 564 transitions. [2023-01-27 18:08:15,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723618090452261 [2023-01-27 18:08:15,344 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 564 transitions. [2023-01-27 18:08:15,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 564 transitions. [2023-01-27 18:08:15,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:15,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 564 transitions. [2023-01-27 18:08:15,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 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:08:15,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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:08:15,348 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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:08:15,348 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 235 flow. Second operand 6 states and 564 transitions. [2023-01-27 18:08:15,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 531 flow [2023-01-27 18:08:15,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:08:15,355 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 243 flow [2023-01-27 18:08:15,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2023-01-27 18:08:15,359 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-01-27 18:08:15,360 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 243 flow [2023-01-27 18:08:15,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 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:08:15,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:15,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:15,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:08:15,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:08:15,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:15,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1812893544, now seen corresponding path program 1 times [2023-01-27 18:08:15,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:15,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064983700] [2023-01-27 18:08:15,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:15,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:15,679 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:08:15,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:15,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064983700] [2023-01-27 18:08:15,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064983700] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:15,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:15,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:08:15,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606138856] [2023-01-27 18:08:15,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:15,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:08:15,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:15,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:08:15,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:08:15,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 199 [2023-01-27 18:08:15,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 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:08:15,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:15,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 199 [2023-01-27 18:08:15,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:15,798 INFO L130 PetriNetUnfolder]: 247/491 cut-off events. [2023-01-27 18:08:15,799 INFO L131 PetriNetUnfolder]: For 927/945 co-relation queries the response was YES. [2023-01-27 18:08:15,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 491 events. 247/491 cut-off events. For 927/945 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2154 event pairs, 59 based on Foata normal form. 60/544 useless extension candidates. Maximal degree in co-relation 1764. Up to 203 conditions per place. [2023-01-27 18:08:15,802 INFO L137 encePairwiseOnDemand]: 194/199 looper letters, 47 selfloop transitions, 7 changer transitions 3/62 dead transitions. [2023-01-27 18:08:15,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 532 flow [2023-01-27 18:08:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:08:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:08:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2023-01-27 18:08:15,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125628140703518 [2023-01-27 18:08:15,804 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 408 transitions. [2023-01-27 18:08:15,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 408 transitions. [2023-01-27 18:08:15,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:15,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 408 transitions. [2023-01-27 18:08:15,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 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:08:15,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 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:08:15,807 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 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:08:15,807 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 243 flow. Second operand 4 states and 408 transitions. [2023-01-27 18:08:15,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 532 flow [2023-01-27 18:08:15,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 472 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-01-27 18:08:15,812 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 238 flow [2023-01-27 18:08:15,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2023-01-27 18:08:15,813 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-01-27 18:08:15,813 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 238 flow [2023-01-27 18:08:15,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 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:08:15,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:15,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:15,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:08:15,814 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:08:15,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1021973216, now seen corresponding path program 1 times [2023-01-27 18:08:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:15,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760079927] [2023-01-27 18:08:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:15,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:16,064 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:08:16,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:16,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760079927] [2023-01-27 18:08:16,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760079927] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:16,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:16,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:08:16,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954359507] [2023-01-27 18:08:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:16,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:08:16,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:08:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:08:16,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 199 [2023-01-27 18:08:16,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 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:08:16,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:16,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 199 [2023-01-27 18:08:16,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:16,178 INFO L130 PetriNetUnfolder]: 178/353 cut-off events. [2023-01-27 18:08:16,178 INFO L131 PetriNetUnfolder]: For 700/715 co-relation queries the response was YES. [2023-01-27 18:08:16,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 353 events. 178/353 cut-off events. For 700/715 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1441 event pairs, 48 based on Foata normal form. 34/382 useless extension candidates. Maximal degree in co-relation 1389. Up to 139 conditions per place. [2023-01-27 18:08:16,181 INFO L137 encePairwiseOnDemand]: 194/199 looper letters, 40 selfloop transitions, 10 changer transitions 5/59 dead transitions. [2023-01-27 18:08:16,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 470 flow [2023-01-27 18:08:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:08:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:08:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2023-01-27 18:08:16,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015075376884423 [2023-01-27 18:08:16,183 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 499 transitions. [2023-01-27 18:08:16,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 499 transitions. [2023-01-27 18:08:16,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:16,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 499 transitions. [2023-01-27 18:08:16,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 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:08:16,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 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:08:16,187 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 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:08:16,187 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 238 flow. Second operand 5 states and 499 transitions. [2023-01-27 18:08:16,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 470 flow [2023-01-27 18:08:16,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 437 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-01-27 18:08:16,190 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 211 flow [2023-01-27 18:08:16,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-01-27 18:08:16,192 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-01-27 18:08:16,192 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 211 flow [2023-01-27 18:08:16,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 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:08:16,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:16,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:16,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:08:16,193 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:08:16,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:16,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1175362742, now seen corresponding path program 1 times [2023-01-27 18:08:16,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:16,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346205355] [2023-01-27 18:08:16,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:16,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:16,515 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:08:16,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346205355] [2023-01-27 18:08:16,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346205355] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:16,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:16,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:08:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266363690] [2023-01-27 18:08:16,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:16,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:08:16,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:16,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:08:16,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:08:16,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 199 [2023-01-27 18:08:16,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 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:08:16,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:16,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 199 [2023-01-27 18:08:16,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:16,647 INFO L130 PetriNetUnfolder]: 120/245 cut-off events. [2023-01-27 18:08:16,647 INFO L131 PetriNetUnfolder]: For 595/595 co-relation queries the response was YES. [2023-01-27 18:08:16,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 245 events. 120/245 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 819 event pairs, 13 based on Foata normal form. 1/246 useless extension candidates. Maximal degree in co-relation 1015. Up to 136 conditions per place. [2023-01-27 18:08:16,649 INFO L137 encePairwiseOnDemand]: 190/199 looper letters, 42 selfloop transitions, 12 changer transitions 8/62 dead transitions. [2023-01-27 18:08:16,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 497 flow [2023-01-27 18:08:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:08:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:08:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2023-01-27 18:08:16,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45142378559463986 [2023-01-27 18:08:16,654 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 539 transitions. [2023-01-27 18:08:16,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 539 transitions. [2023-01-27 18:08:16,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:16,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 539 transitions. [2023-01-27 18:08:16,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 0 states have call successors, (0), 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:08:16,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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:08:16,659 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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:08:16,659 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 211 flow. Second operand 6 states and 539 transitions. [2023-01-27 18:08:16,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 497 flow [2023-01-27 18:08:16,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 407 flow, removed 23 selfloop flow, removed 7 redundant places. [2023-01-27 18:08:16,664 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 245 flow [2023-01-27 18:08:16,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-01-27 18:08:16,665 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-01-27 18:08:16,666 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 245 flow [2023-01-27 18:08:16,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 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:08:16,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:16,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:16,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:08:16,666 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:08:16,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1637284766, now seen corresponding path program 2 times [2023-01-27 18:08:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:16,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427394701] [2023-01-27 18:08:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:16,974 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:08:16,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:16,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427394701] [2023-01-27 18:08:16,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427394701] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:16,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:16,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:08:16,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35784221] [2023-01-27 18:08:16,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:16,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:08:16,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:08:16,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:08:16,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 199 [2023-01-27 18:08:16,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 245 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 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:08:16,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:16,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 199 [2023-01-27 18:08:16,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:17,129 INFO L130 PetriNetUnfolder]: 142/293 cut-off events. [2023-01-27 18:08:17,129 INFO L131 PetriNetUnfolder]: For 621/621 co-relation queries the response was YES. [2023-01-27 18:08:17,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 293 events. 142/293 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1065 event pairs, 17 based on Foata normal form. 1/294 useless extension candidates. Maximal degree in co-relation 1181. Up to 124 conditions per place. [2023-01-27 18:08:17,131 INFO L137 encePairwiseOnDemand]: 191/199 looper letters, 29 selfloop transitions, 5 changer transitions 35/69 dead transitions. [2023-01-27 18:08:17,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 522 flow [2023-01-27 18:08:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:08:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:08:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 626 transitions. [2023-01-27 18:08:17,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44938980617372576 [2023-01-27 18:08:17,134 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 626 transitions. [2023-01-27 18:08:17,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 626 transitions. [2023-01-27 18:08:17,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:17,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 626 transitions. [2023-01-27 18:08:17,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.42857142857143) internal successors, (626), 7 states have internal predecessors, (626), 0 states have call successors, (0), 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:08:17,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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:08:17,139 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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:08:17,139 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 245 flow. Second operand 7 states and 626 transitions. [2023-01-27 18:08:17,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 522 flow [2023-01-27 18:08:17,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 520 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 18:08:17,143 INFO L231 Difference]: Finished difference. Result has 56 places, 27 transitions, 159 flow [2023-01-27 18:08:17,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=56, PETRI_TRANSITIONS=27} [2023-01-27 18:08:17,144 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2023-01-27 18:08:17,144 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 27 transitions, 159 flow [2023-01-27 18:08:17,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 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:08:17,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:17,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:17,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:08:17,145 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:08:17,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1268886244, now seen corresponding path program 3 times [2023-01-27 18:08:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:17,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713768405] [2023-01-27 18:08:17,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:18,250 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:08:18,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:18,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713768405] [2023-01-27 18:08:18,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713768405] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:18,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:18,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:08:18,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684969944] [2023-01-27 18:08:18,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:18,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:08:18,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:18,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:08:18,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:08:18,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 199 [2023-01-27 18:08:18,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 27 transitions, 159 flow. Second operand has 8 states, 8 states have (on average 84.375) internal successors, (675), 8 states have internal predecessors, (675), 0 states have call successors, (0), 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:08:18,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:18,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 199 [2023-01-27 18:08:18,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:18,442 INFO L130 PetriNetUnfolder]: 32/92 cut-off events. [2023-01-27 18:08:18,442 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2023-01-27 18:08:18,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 92 events. 32/92 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 249 event pairs, 4 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 382. Up to 37 conditions per place. [2023-01-27 18:08:18,443 INFO L137 encePairwiseOnDemand]: 191/199 looper letters, 24 selfloop transitions, 5 changer transitions 15/46 dead transitions. [2023-01-27 18:08:18,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 46 transitions, 363 flow [2023-01-27 18:08:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:08:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:08:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 769 transitions. [2023-01-27 18:08:18,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42936906756002235 [2023-01-27 18:08:18,446 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 769 transitions. [2023-01-27 18:08:18,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 769 transitions. [2023-01-27 18:08:18,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:18,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 769 transitions. [2023-01-27 18:08:18,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.44444444444444) internal successors, (769), 9 states have internal predecessors, (769), 0 states have call successors, (0), 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:08:18,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 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:08:18,451 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 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:08:18,451 INFO L175 Difference]: Start difference. First operand has 56 places, 27 transitions, 159 flow. Second operand 9 states and 769 transitions. [2023-01-27 18:08:18,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 46 transitions, 363 flow [2023-01-27 18:08:18,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 294 flow, removed 9 selfloop flow, removed 17 redundant places. [2023-01-27 18:08:18,454 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 130 flow [2023-01-27 18:08:18,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=130, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-01-27 18:08:18,454 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-01-27 18:08:18,455 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 130 flow [2023-01-27 18:08:18,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.375) internal successors, (675), 8 states have internal predecessors, (675), 0 states have call successors, (0), 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:08:18,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:18,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:18,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:08:18,455 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:08:18,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1146781972, now seen corresponding path program 4 times [2023-01-27 18:08:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882539541] [2023-01-27 18:08:18,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:08:18,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:08:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:08:18,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:08:18,591 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:08:18,592 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:08:18,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:08:18,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:08:18,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:08:18,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:08:18,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:08:18,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:08:18,595 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:18,603 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:08:18,603 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:08:18,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:08:18 BasicIcfg [2023-01-27 18:08:18,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:08:18,683 INFO L158 Benchmark]: Toolchain (without parser) took 12124.25ms. Allocated memory was 354.4MB in the beginning and 614.5MB in the end (delta: 260.0MB). Free memory was 311.6MB in the beginning and 395.3MB in the end (delta: -83.7MB). Peak memory consumption was 179.1MB. Max. memory is 16.0GB. [2023-01-27 18:08:18,683 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:08:18,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.66ms. Allocated memory is still 354.4MB. Free memory was 311.6MB in the beginning and 287.8MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 18:08:18,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.22ms. Allocated memory is still 354.4MB. Free memory was 287.8MB in the beginning and 285.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:08:18,684 INFO L158 Benchmark]: Boogie Preprocessor took 34.45ms. Allocated memory is still 354.4MB. Free memory was 285.1MB in the beginning and 283.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:08:18,684 INFO L158 Benchmark]: RCFGBuilder took 747.72ms. Allocated memory is still 354.4MB. Free memory was 283.0MB in the beginning and 305.7MB in the end (delta: -22.7MB). Peak memory consumption was 20.7MB. Max. memory is 16.0GB. [2023-01-27 18:08:18,684 INFO L158 Benchmark]: TraceAbstraction took 10679.14ms. Allocated memory was 354.4MB in the beginning and 614.5MB in the end (delta: 260.0MB). Free memory was 304.4MB in the beginning and 395.3MB in the end (delta: -90.9MB). Peak memory consumption was 168.9MB. Max. memory is 16.0GB. [2023-01-27 18:08:18,685 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.14ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 585.66ms. Allocated memory is still 354.4MB. Free memory was 311.6MB in the beginning and 287.8MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.22ms. Allocated memory is still 354.4MB. Free memory was 287.8MB in the beginning and 285.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.45ms. Allocated memory is still 354.4MB. Free memory was 285.1MB in the beginning and 283.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 747.72ms. Allocated memory is still 354.4MB. Free memory was 283.0MB in the beginning and 305.7MB in the end (delta: -22.7MB). Peak memory consumption was 20.7MB. Max. memory is 16.0GB. * TraceAbstraction took 10679.14ms. Allocated memory was 354.4MB in the beginning and 614.5MB in the end (delta: 260.0MB). Free memory was 304.4MB in the beginning and 395.3MB in the end (delta: -90.9MB). Peak memory consumption was 168.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 113 PlacesBefore, 34 PlacesAfterwards, 105 TransitionsBefore, 25 TransitionsAfterwards, 1758 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 4661 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2388, independent: 2214, independent conditional: 0, independent unconditional: 2214, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 975, independent: 941, independent conditional: 0, independent unconditional: 941, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2388, independent: 1273, independent conditional: 0, independent unconditional: 1273, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 975, unknown conditional: 0, unknown unconditional: 975] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t500, ((void *)0), P0, ((void *)0))=-2, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t501, ((void *)0), P1, ((void *)0))=-1, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t502, ((void *)0), P2, ((void *)0))=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L768] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L769] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L770] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L771] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L773] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L819] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 844]: 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: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1016 IncrementalHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 25 mSDtfsCounter, 1016 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=9, InterpolantAutomatonStates: 62, 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, 3.5s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 1082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:08:18,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...