/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 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix032.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:40:45,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:40:45,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:40:45,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:40:45,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:40:45,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:40:45,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:40:45,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:40:45,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:40:45,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:40:45,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:40:45,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:40:45,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:40:45,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:40:45,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:40:45,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:40:45,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:40:45,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:40:45,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:40:45,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:40:45,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:40:45,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:40:45,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:40:45,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:40:45,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:40:45,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:40:45,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:40:45,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:40:45,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:40:45,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:40:45,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:40:45,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:40:45,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:40:45,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:40:45,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:40:45,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:40:45,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:40:45,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:40:45,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:40:45,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:40:45,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:40:45,745 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-28 00:40:45,770 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:40:45,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:40:45,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:40:45,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:40:45,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:40:45,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:40:45,772 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:40:45,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:40:45,773 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:40:45,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:40:45,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:40:45,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:40:45,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:40:45,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:40:45,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:40:45,774 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:40:45,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:40:45,774 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:40:45,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:40:45,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:40:45,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:40:45,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:40:45,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:40:45,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:40:45,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:40:45,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:40:45,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:40:45,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:40:45,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:40:45,775 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:40:45,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:40:45,776 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:40:45,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:40:45,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:40:45,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:40:45,948 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:40:45,948 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:40:45,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.oepc.i [2023-01-28 00:40:46,965 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:40:47,113 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:40:47,114 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.oepc.i [2023-01-28 00:40:47,125 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801907789/8dd81cc791244bd6a6d47ea63aa477f6/FLAG9b9060961 [2023-01-28 00:40:47,136 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801907789/8dd81cc791244bd6a6d47ea63aa477f6 [2023-01-28 00:40:47,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:40:47,139 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:40:47,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:40:47,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:40:47,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:40:47,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1428a6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47, skipping insertion in model container [2023-01-28 00:40:47,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:40:47,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:40:47,258 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/mix032.oepc.i[945,958] [2023-01-28 00:40:47,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:40:47,413 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:40:47,423 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/mix032.oepc.i[945,958] [2023-01-28 00:40:47,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:40:47,508 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:40:47,509 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:40:47,513 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:40:47,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47 WrapperNode [2023-01-28 00:40:47,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:40:47,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:40:47,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:40:47,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:40:47,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,542 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2023-01-28 00:40:47,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:40:47,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:40:47,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:40:47,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:40:47,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,558 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:40:47,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:40:47,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:40:47,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:40:47,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47" (1/1) ... [2023-01-28 00:40:47,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:40:47,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:40:47,586 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-28 00:40:47,607 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-28 00:40:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:40:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:40:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:40:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:40:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:40:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:40:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:40:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:40:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:40:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:40:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:40:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:40:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:40:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:40:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:40:47,620 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:40:47,715 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:40:47,716 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:40:47,972 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:40:48,055 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:40:48,055 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:40:48,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:40:48 BoogieIcfgContainer [2023-01-28 00:40:48,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:40:48,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:40:48,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:40:48,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:40:48,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:40:47" (1/3) ... [2023-01-28 00:40:48,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fccb2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:40:48, skipping insertion in model container [2023-01-28 00:40:48,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:40:47" (2/3) ... [2023-01-28 00:40:48,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fccb2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:40:48, skipping insertion in model container [2023-01-28 00:40:48,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:40:48" (3/3) ... [2023-01-28 00:40:48,064 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.oepc.i [2023-01-28 00:40:48,075 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:40:48,076 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:40:48,076 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:40:48,128 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:40:48,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2023-01-28 00:40:48,219 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-01-28 00:40:48,220 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:40:48,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-01-28 00:40:48,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2023-01-28 00:40:48,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2023-01-28 00:40:48,237 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:40:48,244 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2023-01-28 00:40:48,245 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2023-01-28 00:40:48,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2023-01-28 00:40:48,265 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-01-28 00:40:48,265 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:40:48,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-01-28 00:40:48,267 INFO L119 LiptonReduction]: Number of co-enabled transitions 2308 [2023-01-28 00:40:50,610 INFO L134 LiptonReduction]: Checked pairs total: 6507 [2023-01-28 00:40:50,611 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-01-28 00:40:50,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:40:50,631 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;@38b1d3a9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:40:50,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:40:50,635 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 00:40:50,635 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:40:50,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:50,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:40:50,636 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:50,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash 498326, now seen corresponding path program 1 times [2023-01-28 00:40:50,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:50,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013174930] [2023-01-28 00:40:50,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:50,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:50,958 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-28 00:40:50,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:50,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013174930] [2023-01-28 00:40:50,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013174930] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:50,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:50,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:40:50,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521681541] [2023-01-28 00:40:50,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:50,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:40:50,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:50,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:40:50,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:40:50,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 216 [2023-01-28 00:40:50,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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-28 00:40:50,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:50,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 216 [2023-01-28 00:40:50,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:51,276 INFO L130 PetriNetUnfolder]: 1614/2565 cut-off events. [2023-01-28 00:40:51,277 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-01-28 00:40:51,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4983 conditions, 2565 events. 1614/2565 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14396 event pairs, 264 based on Foata normal form. 100/2458 useless extension candidates. Maximal degree in co-relation 4972. Up to 1912 conditions per place. [2023-01-28 00:40:51,292 INFO L137 encePairwiseOnDemand]: 212/216 looper letters, 35 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-01-28 00:40:51,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 185 flow [2023-01-28 00:40:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:40:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:40:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-01-28 00:40:51,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5447530864197531 [2023-01-28 00:40:51,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-01-28 00:40:51,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-01-28 00:40:51,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:51,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-01-28 00:40:51,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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-28 00:40:51,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 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-28 00:40:51,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 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-28 00:40:51,322 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 353 transitions. [2023-01-28 00:40:51,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 185 flow [2023-01-28 00:40:51,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:40:51,326 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-01-28 00:40:51,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-01-28 00:40:51,329 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-01-28 00:40:51,330 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-01-28 00:40:51,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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-28 00:40:51,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:51,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:51,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:40:51,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:51,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:51,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1604903128, now seen corresponding path program 1 times [2023-01-28 00:40:51,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:51,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681219575] [2023-01-28 00:40:51,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:51,541 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-28 00:40:51,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:51,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681219575] [2023-01-28 00:40:51,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681219575] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:51,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:51,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:40:51,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479557474] [2023-01-28 00:40:51,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:51,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:40:51,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:51,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:40:51,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:40:51,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-01-28 00:40:51,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 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-28 00:40:51,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:51,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-01-28 00:40:51,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:51,855 INFO L130 PetriNetUnfolder]: 2371/3506 cut-off events. [2023-01-28 00:40:51,855 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2023-01-28 00:40:51,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7310 conditions, 3506 events. 2371/3506 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15889 event pairs, 1191 based on Foata normal form. 180/3686 useless extension candidates. Maximal degree in co-relation 7300. Up to 2979 conditions per place. [2023-01-28 00:40:51,867 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 32 selfloop transitions, 4 changer transitions 21/57 dead transitions. [2023-01-28 00:40:51,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 57 transitions, 248 flow [2023-01-28 00:40:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:40:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:40:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-01-28 00:40:51,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2023-01-28 00:40:51,869 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-01-28 00:40:51,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-01-28 00:40:51,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:51,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-01-28 00:40:51,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 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-28 00:40:51,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:51,873 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:51,873 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 519 transitions. [2023-01-28 00:40:51,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 57 transitions, 248 flow [2023-01-28 00:40:51,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:40:51,874 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 90 flow [2023-01-28 00:40:51,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-01-28 00:40:51,875 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-01-28 00:40:51,875 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 90 flow [2023-01-28 00:40:51,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 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-28 00:40:51,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:51,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:51,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:40:51,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:51,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1326176381, now seen corresponding path program 1 times [2023-01-28 00:40:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:51,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792263849] [2023-01-28 00:40:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:51,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:52,054 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-28 00:40:52,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:52,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792263849] [2023-01-28 00:40:52,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792263849] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:52,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:52,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:40:52,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732247727] [2023-01-28 00:40:52,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:52,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:40:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:52,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:40:52,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:40:52,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-01-28 00:40:52,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 90 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-28 00:40:52,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:52,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-01-28 00:40:52,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:52,390 INFO L130 PetriNetUnfolder]: 2103/3110 cut-off events. [2023-01-28 00:40:52,391 INFO L131 PetriNetUnfolder]: For 1498/1498 co-relation queries the response was YES. [2023-01-28 00:40:52,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7647 conditions, 3110 events. 2103/3110 cut-off events. For 1498/1498 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13613 event pairs, 579 based on Foata normal form. 156/3266 useless extension candidates. Maximal degree in co-relation 7634. Up to 2001 conditions per place. [2023-01-28 00:40:52,407 INFO L137 encePairwiseOnDemand]: 212/216 looper letters, 35 selfloop transitions, 3 changer transitions 24/62 dead transitions. [2023-01-28 00:40:52,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 314 flow [2023-01-28 00:40:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:40:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:40:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2023-01-28 00:40:52,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824074074074074 [2023-01-28 00:40:52,409 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 521 transitions. [2023-01-28 00:40:52,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 521 transitions. [2023-01-28 00:40:52,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:52,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 521 transitions. [2023-01-28 00:40:52,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 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-28 00:40:52,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:52,412 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:52,412 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 90 flow. Second operand 5 states and 521 transitions. [2023-01-28 00:40:52,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 314 flow [2023-01-28 00:40:52,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 308 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:40:52,422 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 99 flow [2023-01-28 00:40:52,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-01-28 00:40:52,423 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2023-01-28 00:40:52,425 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 99 flow [2023-01-28 00:40:52,426 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-28 00:40:52,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:52,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:52,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:40:52,427 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:52,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:52,427 INFO L85 PathProgramCache]: Analyzing trace with hash -327250024, now seen corresponding path program 1 times [2023-01-28 00:40:52,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:52,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983695136] [2023-01-28 00:40:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:52,611 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-28 00:40:52,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:52,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983695136] [2023-01-28 00:40:52,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983695136] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:52,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:52,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:40:52,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297659975] [2023-01-28 00:40:52,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:52,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:40:52,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:52,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:40:52,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:40:52,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2023-01-28 00:40:52,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 99 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-28 00:40:52,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:52,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2023-01-28 00:40:52,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:52,883 INFO L130 PetriNetUnfolder]: 1833/2724 cut-off events. [2023-01-28 00:40:52,884 INFO L131 PetriNetUnfolder]: For 2064/2064 co-relation queries the response was YES. [2023-01-28 00:40:52,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6920 conditions, 2724 events. 1833/2724 cut-off events. For 2064/2064 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11917 event pairs, 575 based on Foata normal form. 120/2844 useless extension candidates. Maximal degree in co-relation 6904. Up to 1829 conditions per place. [2023-01-28 00:40:52,892 INFO L137 encePairwiseOnDemand]: 212/216 looper letters, 37 selfloop transitions, 3 changer transitions 20/60 dead transitions. [2023-01-28 00:40:52,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 60 transitions, 314 flow [2023-01-28 00:40:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:40:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:40:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-01-28 00:40:52,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2023-01-28 00:40:52,894 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-01-28 00:40:52,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-01-28 00:40:52,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:52,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-01-28 00:40:52,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 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-28 00:40:52,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:52,897 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:52,897 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 99 flow. Second operand 5 states and 519 transitions. [2023-01-28 00:40:52,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 60 transitions, 314 flow [2023-01-28 00:40:52,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 302 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:40:52,902 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 104 flow [2023-01-28 00:40:52,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-01-28 00:40:52,903 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-01-28 00:40:52,903 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 104 flow [2023-01-28 00:40:52,903 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-28 00:40:52,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:52,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:52,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:40:52,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:52,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:52,904 INFO L85 PathProgramCache]: Analyzing trace with hash 934024599, now seen corresponding path program 1 times [2023-01-28 00:40:52,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:52,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071094931] [2023-01-28 00:40:52,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:52,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:53,016 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-28 00:40:53,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071094931] [2023-01-28 00:40:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071094931] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:53,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:53,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:40:53,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325471645] [2023-01-28 00:40:53,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:53,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:40:53,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:53,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:40:53,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:40:53,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 216 [2023-01-28 00:40:53,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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-28 00:40:53,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:53,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 216 [2023-01-28 00:40:53,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:53,121 INFO L130 PetriNetUnfolder]: 574/984 cut-off events. [2023-01-28 00:40:53,122 INFO L131 PetriNetUnfolder]: For 599/610 co-relation queries the response was YES. [2023-01-28 00:40:53,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2526 conditions, 984 events. 574/984 cut-off events. For 599/610 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4471 event pairs, 162 based on Foata normal form. 60/1037 useless extension candidates. Maximal degree in co-relation 2509. Up to 729 conditions per place. [2023-01-28 00:40:53,125 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 33 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-01-28 00:40:53,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 219 flow [2023-01-28 00:40:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:40:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:40:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-01-28 00:40:53,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2023-01-28 00:40:53,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-01-28 00:40:53,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-01-28 00:40:53,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:53,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-01-28 00:40:53,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-28 00:40:53,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 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-28 00:40:53,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 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-28 00:40:53,129 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 104 flow. Second operand 3 states and 334 transitions. [2023-01-28 00:40:53,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 219 flow [2023-01-28 00:40:53,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 207 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:40:53,131 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 120 flow [2023-01-28 00:40:53,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-01-28 00:40:53,132 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-01-28 00:40:53,132 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 120 flow [2023-01-28 00:40:53,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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-28 00:40:53,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:53,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:53,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:40:53,132 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:53,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash 205807894, now seen corresponding path program 1 times [2023-01-28 00:40:53,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:53,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485662032] [2023-01-28 00:40:53,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:53,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:53,271 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-28 00:40:53,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:53,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485662032] [2023-01-28 00:40:53,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485662032] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:53,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:53,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:40:53,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049490882] [2023-01-28 00:40:53,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:53,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:40:53,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:53,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:40:53,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:40:53,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 216 [2023-01-28 00:40:53,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 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-28 00:40:53,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:53,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 216 [2023-01-28 00:40:53,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:53,373 INFO L130 PetriNetUnfolder]: 282/540 cut-off events. [2023-01-28 00:40:53,373 INFO L131 PetriNetUnfolder]: For 195/196 co-relation queries the response was YES. [2023-01-28 00:40:53,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 540 events. 282/540 cut-off events. For 195/196 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2314 event pairs, 109 based on Foata normal form. 50/585 useless extension candidates. Maximal degree in co-relation 1505. Up to 206 conditions per place. [2023-01-28 00:40:53,375 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 43 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-01-28 00:40:53,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 292 flow [2023-01-28 00:40:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:40:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:40:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2023-01-28 00:40:53,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162037037037037 [2023-01-28 00:40:53,390 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2023-01-28 00:40:53,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2023-01-28 00:40:53,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:53,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2023-01-28 00:40:53,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 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-28 00:40:53,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 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-28 00:40:53,392 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 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-28 00:40:53,392 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 120 flow. Second operand 4 states and 446 transitions. [2023-01-28 00:40:53,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 292 flow [2023-01-28 00:40:53,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:40:53,394 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 156 flow [2023-01-28 00:40:53,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-01-28 00:40:53,394 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-01-28 00:40:53,394 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 156 flow [2023-01-28 00:40:53,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 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-28 00:40:53,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:53,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:53,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:40:53,395 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:53,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:53,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1928063046, now seen corresponding path program 1 times [2023-01-28 00:40:53,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:53,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711754786] [2023-01-28 00:40:53,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:53,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:40:53,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:53,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711754786] [2023-01-28 00:40:53,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711754786] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:53,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:53,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:40:53,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143501640] [2023-01-28 00:40:53,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:53,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:40:53,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:53,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:40:53,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:40:53,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 216 [2023-01-28 00:40:53,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 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-28 00:40:53,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:53,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 216 [2023-01-28 00:40:53,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:53,777 INFO L130 PetriNetUnfolder]: 239/453 cut-off events. [2023-01-28 00:40:53,777 INFO L131 PetriNetUnfolder]: For 413/413 co-relation queries the response was YES. [2023-01-28 00:40:53,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 453 events. 239/453 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1934 event pairs, 105 based on Foata normal form. 13/461 useless extension candidates. Maximal degree in co-relation 1321. Up to 206 conditions per place. [2023-01-28 00:40:53,779 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 40 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2023-01-28 00:40:53,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 316 flow [2023-01-28 00:40:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:40:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:40:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2023-01-28 00:40:53,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2023-01-28 00:40:53,781 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2023-01-28 00:40:53,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2023-01-28 00:40:53,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:53,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2023-01-28 00:40:53,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 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-28 00:40:53,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:53,783 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:53,783 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 156 flow. Second operand 5 states and 545 transitions. [2023-01-28 00:40:53,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 316 flow [2023-01-28 00:40:53,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 286 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-01-28 00:40:53,786 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 156 flow [2023-01-28 00:40:53,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-01-28 00:40:53,787 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2023-01-28 00:40:53,787 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 156 flow [2023-01-28 00:40:53,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 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-28 00:40:53,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:53,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:53,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:40:53,788 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:53,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash 917205118, now seen corresponding path program 1 times [2023-01-28 00:40:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:53,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90681182] [2023-01-28 00:40:53,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:53,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:54,363 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-28 00:40:54,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:54,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90681182] [2023-01-28 00:40:54,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90681182] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:54,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:54,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:40:54,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595082212] [2023-01-28 00:40:54,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:54,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:40:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:54,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:40:54,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:40:54,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 216 [2023-01-28 00:40:54,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 156 flow. Second operand has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:54,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:54,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 216 [2023-01-28 00:40:54,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:54,636 INFO L130 PetriNetUnfolder]: 407/701 cut-off events. [2023-01-28 00:40:54,636 INFO L131 PetriNetUnfolder]: For 806/806 co-relation queries the response was YES. [2023-01-28 00:40:54,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2147 conditions, 701 events. 407/701 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2854 event pairs, 40 based on Foata normal form. 1/702 useless extension candidates. Maximal degree in co-relation 2130. Up to 269 conditions per place. [2023-01-28 00:40:54,639 INFO L137 encePairwiseOnDemand]: 205/216 looper letters, 73 selfloop transitions, 13 changer transitions 9/95 dead transitions. [2023-01-28 00:40:54,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 95 transitions, 612 flow [2023-01-28 00:40:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:40:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:40:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 836 transitions. [2023-01-28 00:40:54,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43004115226337447 [2023-01-28 00:40:54,642 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 836 transitions. [2023-01-28 00:40:54,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 836 transitions. [2023-01-28 00:40:54,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:54,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 836 transitions. [2023-01-28 00:40:54,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.88888888888889) internal successors, (836), 9 states have internal predecessors, (836), 0 states have call successors, (0), 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-28 00:40:54,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 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-28 00:40:54,646 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 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-28 00:40:54,646 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 156 flow. Second operand 9 states and 836 transitions. [2023-01-28 00:40:54,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 95 transitions, 612 flow [2023-01-28 00:40:54,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 95 transitions, 534 flow, removed 20 selfloop flow, removed 4 redundant places. [2023-01-28 00:40:54,651 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 190 flow [2023-01-28 00:40:54,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-01-28 00:40:54,653 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2023-01-28 00:40:54,653 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 190 flow [2023-01-28 00:40:54,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.0) internal successors, (696), 8 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:54,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:54,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:54,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:40:54,653 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:54,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1380789090, now seen corresponding path program 2 times [2023-01-28 00:40:54,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:54,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46911039] [2023-01-28 00:40:54,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:54,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:55,218 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-28 00:40:55,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:55,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46911039] [2023-01-28 00:40:55,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46911039] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:55,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:55,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 00:40:55,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304491455] [2023-01-28 00:40:55,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:55,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 00:40:55,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:55,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 00:40:55,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-01-28 00:40:55,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 216 [2023-01-28 00:40:55,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 190 flow. Second operand has 9 states, 9 states have (on average 93.44444444444444) internal successors, (841), 9 states have internal predecessors, (841), 0 states have call successors, (0), 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-28 00:40:55,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:55,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 216 [2023-01-28 00:40:55,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:55,499 INFO L130 PetriNetUnfolder]: 451/850 cut-off events. [2023-01-28 00:40:55,500 INFO L131 PetriNetUnfolder]: For 917/917 co-relation queries the response was YES. [2023-01-28 00:40:55,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 850 events. 451/850 cut-off events. For 917/917 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4087 event pairs, 105 based on Foata normal form. 1/846 useless extension candidates. Maximal degree in co-relation 2618. Up to 529 conditions per place. [2023-01-28 00:40:55,503 INFO L137 encePairwiseOnDemand]: 207/216 looper letters, 68 selfloop transitions, 13 changer transitions 15/101 dead transitions. [2023-01-28 00:40:55,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 101 transitions, 658 flow [2023-01-28 00:40:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:40:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:40:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions. [2023-01-28 00:40:55,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2023-01-28 00:40:55,505 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 888 transitions. [2023-01-28 00:40:55,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions. [2023-01-28 00:40:55,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:55,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions. [2023-01-28 00:40:55,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:40:55,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 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-28 00:40:55,509 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 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-28 00:40:55,509 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 190 flow. Second operand 9 states and 888 transitions. [2023-01-28 00:40:55,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 101 transitions, 658 flow [2023-01-28 00:40:55,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 101 transitions, 620 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-01-28 00:40:55,513 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 274 flow [2023-01-28 00:40:55,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=274, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-01-28 00:40:55,513 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2023-01-28 00:40:55,514 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 274 flow [2023-01-28 00:40:55,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.44444444444444) internal successors, (841), 9 states have internal predecessors, (841), 0 states have call successors, (0), 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-28 00:40:55,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:55,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:55,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:40:55,514 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:55,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:55,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1428202452, now seen corresponding path program 3 times [2023-01-28 00:40:55,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:55,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614689677] [2023-01-28 00:40:55,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:55,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:55,700 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-28 00:40:55,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:55,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614689677] [2023-01-28 00:40:55,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614689677] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:55,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:55,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:40:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106363861] [2023-01-28 00:40:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:55,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:40:55,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:55,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:40:55,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:40:55,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-01-28 00:40:55,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 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-28 00:40:55,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:55,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-01-28 00:40:55,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:55,870 INFO L130 PetriNetUnfolder]: 696/1198 cut-off events. [2023-01-28 00:40:55,870 INFO L131 PetriNetUnfolder]: For 1695/1695 co-relation queries the response was YES. [2023-01-28 00:40:55,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 1198 events. 696/1198 cut-off events. For 1695/1695 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5507 event pairs, 108 based on Foata normal form. 1/1199 useless extension candidates. Maximal degree in co-relation 4316. Up to 742 conditions per place. [2023-01-28 00:40:55,874 INFO L137 encePairwiseOnDemand]: 207/216 looper letters, 56 selfloop transitions, 18 changer transitions 24/98 dead transitions. [2023-01-28 00:40:55,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 98 transitions, 710 flow [2023-01-28 00:40:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:40:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:40:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions. [2023-01-28 00:40:55,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46141975308641975 [2023-01-28 00:40:55,876 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 598 transitions. [2023-01-28 00:40:55,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 598 transitions. [2023-01-28 00:40:55,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:55,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 598 transitions. [2023-01-28 00:40:55,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 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-28 00:40:55,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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-28 00:40:55,879 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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-28 00:40:55,879 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 274 flow. Second operand 6 states and 598 transitions. [2023-01-28 00:40:55,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 98 transitions, 710 flow [2023-01-28 00:40:55,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 98 transitions, 696 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-01-28 00:40:55,885 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 350 flow [2023-01-28 00:40:55,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2023-01-28 00:40:55,885 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2023-01-28 00:40:55,885 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 350 flow [2023-01-28 00:40:55,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 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-28 00:40:55,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:55,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:55,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:40:55,886 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:55,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2065333826, now seen corresponding path program 4 times [2023-01-28 00:40:55,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:55,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116010918] [2023-01-28 00:40:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:55,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:40:56,057 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-28 00:40:56,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:40:56,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116010918] [2023-01-28 00:40:56,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116010918] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:40:56,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:40:56,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:40:56,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804307044] [2023-01-28 00:40:56,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:40:56,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:40:56,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:40:56,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:40:56,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:40:56,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-01-28 00:40:56,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 350 flow. Second operand has 6 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-28 00:40:56,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:40:56,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-01-28 00:40:56,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:40:56,308 INFO L130 PetriNetUnfolder]: 741/1337 cut-off events. [2023-01-28 00:40:56,308 INFO L131 PetriNetUnfolder]: For 2986/2986 co-relation queries the response was YES. [2023-01-28 00:40:56,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5396 conditions, 1337 events. 741/1337 cut-off events. For 2986/2986 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6971 event pairs, 177 based on Foata normal form. 1/1338 useless extension candidates. Maximal degree in co-relation 5376. Up to 696 conditions per place. [2023-01-28 00:40:56,312 INFO L137 encePairwiseOnDemand]: 209/216 looper letters, 45 selfloop transitions, 5 changer transitions 67/117 dead transitions. [2023-01-28 00:40:56,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 117 transitions, 966 flow [2023-01-28 00:40:56,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:40:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:40:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions. [2023-01-28 00:40:56,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46164021164021163 [2023-01-28 00:40:56,314 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 698 transitions. [2023-01-28 00:40:56,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 698 transitions. [2023-01-28 00:40:56,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:40:56,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 698 transitions. [2023-01-28 00:40:56,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.71428571428571) internal successors, (698), 7 states have internal predecessors, (698), 0 states have call successors, (0), 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-28 00:40:56,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 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-28 00:40:56,318 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 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-28 00:40:56,318 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 350 flow. Second operand 7 states and 698 transitions. [2023-01-28 00:40:56,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 117 transitions, 966 flow [2023-01-28 00:40:56,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 117 transitions, 938 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-01-28 00:40:56,325 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 264 flow [2023-01-28 00:40:56,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=264, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2023-01-28 00:40:56,326 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2023-01-28 00:40:56,326 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 264 flow [2023-01-28 00:40:56,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-28 00:40:56,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:40:56,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:56,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:40:56,326 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:40:56,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:40:56,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1256059784, now seen corresponding path program 5 times [2023-01-28 00:40:56,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:40:56,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764444938] [2023-01-28 00:40:56,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:40:56,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:40:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:40:56,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:40:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:40:56,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:40:56,412 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:40:56,413 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:40:56,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:40:56,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:40:56,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:40:56,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:40:56,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:40:56,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:40:56,415 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:40:56,419 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:40:56,419 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:40:56,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:40:56 BasicIcfg [2023-01-28 00:40:56,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:40:56,460 INFO L158 Benchmark]: Toolchain (without parser) took 9321.62ms. Allocated memory was 348.1MB in the beginning and 1.1GB in the end (delta: 713.0MB). Free memory was 282.7MB in the beginning and 889.1MB in the end (delta: -606.4MB). Peak memory consumption was 109.1MB. Max. memory is 16.0GB. [2023-01-28 00:40:56,460 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 348.1MB. Free memory is still 295.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:40:56,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.87ms. Allocated memory was 348.1MB in the beginning and 604.0MB in the end (delta: 255.9MB). Free memory was 282.7MB in the beginning and 564.1MB in the end (delta: -281.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-01-28 00:40:56,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.76ms. Allocated memory is still 604.0MB. Free memory was 564.1MB in the beginning and 562.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:40:56,461 INFO L158 Benchmark]: Boogie Preprocessor took 19.09ms. Allocated memory is still 604.0MB. Free memory was 562.0MB in the beginning and 559.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:40:56,461 INFO L158 Benchmark]: RCFGBuilder took 494.71ms. Allocated memory is still 604.0MB. Free memory was 559.9MB in the beginning and 522.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-01-28 00:40:56,461 INFO L158 Benchmark]: TraceAbstraction took 8402.11ms. Allocated memory was 604.0MB in the beginning and 1.1GB in the end (delta: 457.2MB). Free memory was 522.1MB in the beginning and 889.1MB in the end (delta: -367.0MB). Peak memory consumption was 90.2MB. Max. memory is 16.0GB. [2023-01-28 00:40:56,462 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.08ms. Allocated memory is still 348.1MB. Free memory is still 295.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 373.87ms. Allocated memory was 348.1MB in the beginning and 604.0MB in the end (delta: 255.9MB). Free memory was 282.7MB in the beginning and 564.1MB in the end (delta: -281.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 27.76ms. Allocated memory is still 604.0MB. Free memory was 564.1MB in the beginning and 562.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.09ms. Allocated memory is still 604.0MB. Free memory was 562.0MB in the beginning and 559.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 494.71ms. Allocated memory is still 604.0MB. Free memory was 559.9MB in the beginning and 522.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 8402.11ms. Allocated memory was 604.0MB in the beginning and 1.1GB in the end (delta: 457.2MB). Free memory was 522.1MB in the beginning and 889.1MB in the end (delta: -367.0MB). Peak memory consumption was 90.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 122 PlacesBefore, 37 PlacesAfterwards, 114 TransitionsBefore, 28 TransitionsAfterwards, 2308 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 6507 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2801, independent: 2589, independent conditional: 0, independent unconditional: 2589, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1271, independent: 1236, independent conditional: 0, independent unconditional: 1236, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2801, independent: 1353, independent conditional: 0, independent unconditional: 1353, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 1271, unknown conditional: 0, unknown unconditional: 1271] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool b$flush_delayed; [L725] 0 int b$mem_tmp; [L726] 0 _Bool b$r_buff0_thd0; [L727] 0 _Bool b$r_buff0_thd1; [L728] 0 _Bool b$r_buff0_thd2; [L729] 0 _Bool b$r_buff0_thd3; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$read_delayed; [L735] 0 int *b$read_delayed_var; [L736] 0 int b$w_buff0; [L737] 0 _Bool b$w_buff0_used; [L738] 0 int b$w_buff1; [L739] 0 _Bool b$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t849; [L856] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t849, ((void *)0), P0, ((void *)0))=-2, t849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 b$w_buff1 = b$w_buff0 [L754] 1 b$w_buff0 = 1 [L755] 1 b$w_buff1_used = b$w_buff0_used [L756] 1 b$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L758] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L759] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L760] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L761] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t850; [L858] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t850, ((void *)0), P1, ((void *)0))=-1, t849={5:0}, t850={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t851; [L860] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t851, ((void *)0), P2, ((void *)0))=0, t849={5:0}, t850={6:0}, t851={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L795] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L796] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L797] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L798] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L808] 3 z = 1 [L811] 3 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 b$flush_delayed = weak$$choice2 [L820] 3 b$mem_tmp = b [L821] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L822] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L823] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L824] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L825] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L827] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = b [L829] 3 b = b$flush_delayed ? b$mem_tmp : b [L830] 3 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L833] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L834] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L835] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L836] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L837] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L867] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L868] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L869] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L870] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849={5:0}, t850={6:0}, t851={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, 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: 860]: 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: 856]: 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: 858]: 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, 148 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: 8.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 341 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1275 IncrementalHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 36 mSDtfsCounter, 1275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=10, InterpolantAutomatonStates: 61, 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.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 1339 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-28 00:40:56,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...