/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix013.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:06:26,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:06:26,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:06:26,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:06:26,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:06:26,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:06:26,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:06:26,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:06:26,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:06:26,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:06:26,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:06:26,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:06:26,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:06:26,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:06:26,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:06:26,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:06:26,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:06:26,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:06:26,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:06:26,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:06:26,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:06:26,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:06:26,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:06:26,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:06:26,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:06:26,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:06:26,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:06:26,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:06:26,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:06:26,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:06:26,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:06:26,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:06:26,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:06:26,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:06:26,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:06:26,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:06:26,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:06:26,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:06:26,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:06:26,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:06:26,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:06:26,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:06:26,556 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:06:26,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:06:26,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:06:26,557 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:06:26,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:06:26,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:06:26,558 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:06:26,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:06:26,558 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:06:26,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:06:26,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:06:26,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:06:26,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:06:26,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:06:26,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:06:26,559 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:06:26,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:06:26,559 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:06:26,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:06:26,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:06:26,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:06:26,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:06:26,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:06:26,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:06:26,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:06:26,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:06:26,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:06:26,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:06:26,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:06:26,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:06:26,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:06:26,561 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 18:06:26,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:06:26,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:06:26,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:06:26,775 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:06:26,775 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:06:26,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.oepc.i [2023-01-27 18:06:27,975 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:06:28,237 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:06:28,238 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.oepc.i [2023-01-27 18:06:28,248 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5ddd275/ab56915cbb5c42ea97c5909519ccfa29/FLAGf3e18f0a0 [2023-01-27 18:06:28,260 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5ddd275/ab56915cbb5c42ea97c5909519ccfa29 [2023-01-27 18:06:28,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:06:28,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:06:28,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:06:28,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:06:28,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:06:28,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2749a910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28, skipping insertion in model container [2023-01-27 18:06:28,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:06:28,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:06:28,419 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/mix013.oepc.i[945,958] [2023-01-27 18:06:28,567 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:06:28,577 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:06:28,588 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/mix013.oepc.i[945,958] [2023-01-27 18:06:28,652 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:06:28,707 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:06:28,707 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:06:28,712 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:06:28,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28 WrapperNode [2023-01-27 18:06:28,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:06:28,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:06:28,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:06:28,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:06:28,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,770 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-01-27 18:06:28,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:06:28,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:06:28,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:06:28,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:06:28,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,804 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:06:28,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:06:28,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:06:28,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:06:28,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28" (1/1) ... [2023-01-27 18:06:28,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:06:28,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:06:28,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 18:06:28,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 18:06:28,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:06:28,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:06:28,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:06:28,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:06:28,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:06:28,918 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:06:28,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:06:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:06:28,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:06:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:06:28,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:06:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:06:28,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:06:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:06:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:06:28,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:06:28,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:06:28,923 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:06:29,109 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:06:29,111 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:06:29,467 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:06:29,570 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:06:29,570 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:06:29,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:06:29 BoogieIcfgContainer [2023-01-27 18:06:29,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:06:29,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:06:29,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:06:29,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:06:29,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:06:28" (1/3) ... [2023-01-27 18:06:29,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c474e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:06:29, skipping insertion in model container [2023-01-27 18:06:29,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:06:28" (2/3) ... [2023-01-27 18:06:29,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c474e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:06:29, skipping insertion in model container [2023-01-27 18:06:29,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:06:29" (3/3) ... [2023-01-27 18:06:29,579 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.oepc.i [2023-01-27 18:06:29,591 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:06:29,592 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:06:29,592 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:06:29,643 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:06:29,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2023-01-27 18:06:29,733 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2023-01-27 18:06:29,734 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:06:29,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-27 18:06:29,739 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2023-01-27 18:06:29,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2023-01-27 18:06:29,756 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:06:29,769 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2023-01-27 18:06:29,771 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2023-01-27 18:06:29,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2023-01-27 18:06:29,798 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2023-01-27 18:06:29,799 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:06:29,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-27 18:06:29,801 INFO L119 LiptonReduction]: Number of co-enabled transitions 3300 [2023-01-27 18:06:33,481 INFO L134 LiptonReduction]: Checked pairs total: 10234 [2023-01-27 18:06:33,481 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-01-27 18:06:33,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:06:33,512 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;@337e97d7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:06:33,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:06:33,521 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-27 18:06:33,521 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:06:33,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:33,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-27 18:06:33,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:33,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:33,531 INFO L85 PathProgramCache]: Analyzing trace with hash 554559, now seen corresponding path program 1 times [2023-01-27 18:06:33,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:33,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695230491] [2023-01-27 18:06:33,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:33,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:34,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:34,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695230491] [2023-01-27 18:06:34,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695230491] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:34,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:06:34,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927115137] [2023-01-27 18:06:34,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:34,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:06:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:34,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:06:34,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:06:34,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 241 [2023-01-27 18:06:34,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:34,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:34,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 241 [2023-01-27 18:06:34,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:35,629 INFO L130 PetriNetUnfolder]: 6855/9371 cut-off events. [2023-01-27 18:06:35,629 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2023-01-27 18:06:35,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18811 conditions, 9371 events. 6855/9371 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 48378 event pairs, 3527 based on Foata normal form. 320/9026 useless extension candidates. Maximal degree in co-relation 18799. Up to 7399 conditions per place. [2023-01-27 18:06:35,677 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 43 selfloop transitions, 2 changer transitions 4/54 dead transitions. [2023-01-27 18:06:35,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 227 flow [2023-01-27 18:06:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:06:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:06:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-01-27 18:06:35,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5615491009681881 [2023-01-27 18:06:35,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-01-27 18:06:35,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-01-27 18:06:35,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:35,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-01-27 18:06:35,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:35,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:35,705 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:35,706 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 80 flow. Second operand 3 states and 406 transitions. [2023-01-27 18:06:35,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 227 flow [2023-01-27 18:06:35,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:06:35,712 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-01-27 18:06:35,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-01-27 18:06:35,717 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-01-27 18:06:35,717 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-01-27 18:06:35,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:35,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:35,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:35,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:06:35,719 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:35,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:35,725 INFO L85 PathProgramCache]: Analyzing trace with hash -641385965, now seen corresponding path program 1 times [2023-01-27 18:06:35,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:35,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208644884] [2023-01-27 18:06:35,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:35,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:35,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:35,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208644884] [2023-01-27 18:06:35,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208644884] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:35,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:35,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:06:35,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445361026] [2023-01-27 18:06:35,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:35,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:06:35,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:35,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:06:35,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:06:35,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-01-27 18:06:35,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:35,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:35,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-01-27 18:06:35,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:37,536 INFO L130 PetriNetUnfolder]: 16565/22304 cut-off events. [2023-01-27 18:06:37,537 INFO L131 PetriNetUnfolder]: For 1137/1137 co-relation queries the response was YES. [2023-01-27 18:06:37,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46122 conditions, 22304 events. 16565/22304 cut-off events. For 1137/1137 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 110236 event pairs, 8983 based on Foata normal form. 900/23204 useless extension candidates. Maximal degree in co-relation 46112. Up to 19157 conditions per place. [2023-01-27 18:06:37,665 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 41 selfloop transitions, 5 changer transitions 27/73 dead transitions. [2023-01-27 18:06:37,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 73 transitions, 316 flow [2023-01-27 18:06:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:06:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:06:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-01-27 18:06:37,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979253112033195 [2023-01-27 18:06:37,667 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-01-27 18:06:37,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-01-27 18:06:37,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:37,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-01-27 18:06:37,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:37,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:37,671 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:37,672 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 600 transitions. [2023-01-27 18:06:37,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 73 transitions, 316 flow [2023-01-27 18:06:37,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 73 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:06:37,675 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 113 flow [2023-01-27 18:06:37,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-01-27 18:06:37,675 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2023-01-27 18:06:37,676 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 113 flow [2023-01-27 18:06:37,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:37,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:37,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:37,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:06:37,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:37,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:37,677 INFO L85 PathProgramCache]: Analyzing trace with hash 657428209, now seen corresponding path program 1 times [2023-01-27 18:06:37,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:37,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335338247] [2023-01-27 18:06:37,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:37,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:37,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:37,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335338247] [2023-01-27 18:06:37,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335338247] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:37,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:37,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:06:37,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959912821] [2023-01-27 18:06:37,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:37,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:06:37,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:37,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:06:37,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:06:37,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-01-27 18:06:37,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:37,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:37,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-01-27 18:06:37,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:39,489 INFO L130 PetriNetUnfolder]: 14765/19888 cut-off events. [2023-01-27 18:06:39,489 INFO L131 PetriNetUnfolder]: For 9859/9859 co-relation queries the response was YES. [2023-01-27 18:06:39,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49107 conditions, 19888 events. 14765/19888 cut-off events. For 9859/9859 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 95535 event pairs, 3813 based on Foata normal form. 852/20740 useless extension candidates. Maximal degree in co-relation 49094. Up to 12401 conditions per place. [2023-01-27 18:06:39,593 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 46 selfloop transitions, 3 changer transitions 32/81 dead transitions. [2023-01-27 18:06:39,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 81 transitions, 411 flow [2023-01-27 18:06:39,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:06:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:06:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-01-27 18:06:39,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012448132780083 [2023-01-27 18:06:39,595 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-01-27 18:06:39,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-01-27 18:06:39,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:39,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-01-27 18:06:39,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:39,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:39,599 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:39,599 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 113 flow. Second operand 5 states and 604 transitions. [2023-01-27 18:06:39,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 81 transitions, 411 flow [2023-01-27 18:06:39,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 81 transitions, 404 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:06:39,711 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 121 flow [2023-01-27 18:06:39,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-01-27 18:06:39,712 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-01-27 18:06:39,715 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 121 flow [2023-01-27 18:06:39,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:39,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:39,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:39,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:06:39,716 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:39,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:39,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2034950308, now seen corresponding path program 1 times [2023-01-27 18:06:39,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:39,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654982635] [2023-01-27 18:06:39,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:39,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:39,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:39,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654982635] [2023-01-27 18:06:39,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654982635] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:39,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:39,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:06:39,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724899465] [2023-01-27 18:06:39,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:39,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:06:39,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:39,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:06:39,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:06:39,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 241 [2023-01-27 18:06:39,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:39,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:39,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 241 [2023-01-27 18:06:39,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:41,055 INFO L130 PetriNetUnfolder]: 8172/11842 cut-off events. [2023-01-27 18:06:41,056 INFO L131 PetriNetUnfolder]: For 6726/6951 co-relation queries the response was YES. [2023-01-27 18:06:41,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27629 conditions, 11842 events. 8172/11842 cut-off events. For 6726/6951 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 67601 event pairs, 2986 based on Foata normal form. 500/12112 useless extension candidates. Maximal degree in co-relation 27613. Up to 6867 conditions per place. [2023-01-27 18:06:41,123 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 40 selfloop transitions, 3 changer transitions 23/73 dead transitions. [2023-01-27 18:06:41,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 343 flow [2023-01-27 18:06:41,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:06:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:06:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-01-27 18:06:41,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286307053941909 [2023-01-27 18:06:41,125 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-01-27 18:06:41,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-01-27 18:06:41,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:41,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-01-27 18:06:41,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:41,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:41,133 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:41,134 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 121 flow. Second operand 5 states and 637 transitions. [2023-01-27 18:06:41,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 343 flow [2023-01-27 18:06:41,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 333 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:06:41,197 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 126 flow [2023-01-27 18:06:41,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2023-01-27 18:06:41,198 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2023-01-27 18:06:41,198 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 126 flow [2023-01-27 18:06:41,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:41,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:41,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:41,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:06:41,199 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:41,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1019303317, now seen corresponding path program 1 times [2023-01-27 18:06:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:41,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495451036] [2023-01-27 18:06:41,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:41,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:41,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:41,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495451036] [2023-01-27 18:06:41,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495451036] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:41,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:41,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:06:41,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519321817] [2023-01-27 18:06:41,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:41,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:06:41,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:41,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:06:41,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:06:41,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-01-27 18:06:41,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:41,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:41,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-01-27 18:06:41,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:42,023 INFO L130 PetriNetUnfolder]: 5237/7739 cut-off events. [2023-01-27 18:06:42,024 INFO L131 PetriNetUnfolder]: For 2041/2161 co-relation queries the response was YES. [2023-01-27 18:06:42,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17414 conditions, 7739 events. 5237/7739 cut-off events. For 2041/2161 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 44779 event pairs, 1078 based on Foata normal form. 541/8090 useless extension candidates. Maximal degree in co-relation 17397. Up to 5000 conditions per place. [2023-01-27 18:06:42,069 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 61 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2023-01-27 18:06:42,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 366 flow [2023-01-27 18:06:42,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:06:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:06:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2023-01-27 18:06:42,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211618257261411 [2023-01-27 18:06:42,071 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 628 transitions. [2023-01-27 18:06:42,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 628 transitions. [2023-01-27 18:06:42,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:42,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 628 transitions. [2023-01-27 18:06:42,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:42,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:42,075 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:42,075 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 126 flow. Second operand 5 states and 628 transitions. [2023-01-27 18:06:42,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 366 flow [2023-01-27 18:06:42,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 356 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:06:42,088 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 191 flow [2023-01-27 18:06:42,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-01-27 18:06:42,090 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2023-01-27 18:06:42,090 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 191 flow [2023-01-27 18:06:42,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:42,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:42,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:42,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:06:42,091 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:42,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash 684158938, now seen corresponding path program 1 times [2023-01-27 18:06:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:42,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595612785] [2023-01-27 18:06:42,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595612785] [2023-01-27 18:06:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595612785] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:42,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:42,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:06:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372608499] [2023-01-27 18:06:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:06:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:06:42,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:06:42,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-01-27 18:06:42,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:42,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:42,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-01-27 18:06:42,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:42,952 INFO L130 PetriNetUnfolder]: 3948/6076 cut-off events. [2023-01-27 18:06:42,953 INFO L131 PetriNetUnfolder]: For 2865/2935 co-relation queries the response was YES. [2023-01-27 18:06:42,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17057 conditions, 6076 events. 3948/6076 cut-off events. For 2865/2935 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 36189 event pairs, 598 based on Foata normal form. 350/6282 useless extension candidates. Maximal degree in co-relation 17039. Up to 1865 conditions per place. [2023-01-27 18:06:42,988 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 83 selfloop transitions, 19 changer transitions 0/111 dead transitions. [2023-01-27 18:06:42,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 111 transitions, 591 flow [2023-01-27 18:06:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:06:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:06:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2023-01-27 18:06:42,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222288085358625 [2023-01-27 18:06:42,991 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 881 transitions. [2023-01-27 18:06:42,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 881 transitions. [2023-01-27 18:06:42,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:42,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 881 transitions. [2023-01-27 18:06:42,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.85714285714286) internal successors, (881), 7 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:42,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:42,995 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:42,995 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 191 flow. Second operand 7 states and 881 transitions. [2023-01-27 18:06:42,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 111 transitions, 591 flow [2023-01-27 18:06:43,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 111 transitions, 586 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:06:43,009 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 320 flow [2023-01-27 18:06:43,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=320, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-01-27 18:06:43,011 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2023-01-27 18:06:43,011 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 320 flow [2023-01-27 18:06:43,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:43,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:43,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:43,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:06:43,012 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:43,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1595725164, now seen corresponding path program 1 times [2023-01-27 18:06:43,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:43,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066999921] [2023-01-27 18:06:43,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:43,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:43,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066999921] [2023-01-27 18:06:43,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066999921] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:43,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:43,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:06:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921543233] [2023-01-27 18:06:43,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:43,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:06:43,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:06:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:06:43,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-01-27 18:06:43,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:43,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:43,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-01-27 18:06:43,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:43,818 INFO L130 PetriNetUnfolder]: 3526/5450 cut-off events. [2023-01-27 18:06:43,819 INFO L131 PetriNetUnfolder]: For 6328/6390 co-relation queries the response was YES. [2023-01-27 18:06:43,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17854 conditions, 5450 events. 3526/5450 cut-off events. For 6328/6390 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 32513 event pairs, 504 based on Foata normal form. 116/5433 useless extension candidates. Maximal degree in co-relation 17832. Up to 1743 conditions per place. [2023-01-27 18:06:43,854 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 92 selfloop transitions, 28 changer transitions 11/140 dead transitions. [2023-01-27 18:06:43,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 140 transitions, 870 flow [2023-01-27 18:06:43,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:06:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:06:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1132 transitions. [2023-01-27 18:06:43,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218994928538497 [2023-01-27 18:06:43,858 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1132 transitions. [2023-01-27 18:06:43,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1132 transitions. [2023-01-27 18:06:43,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:43,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1132 transitions. [2023-01-27 18:06:43,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.77777777777777) internal successors, (1132), 9 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:43,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:43,864 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:43,864 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 320 flow. Second operand 9 states and 1132 transitions. [2023-01-27 18:06:43,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 140 transitions, 870 flow [2023-01-27 18:06:44,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 140 transitions, 820 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-01-27 18:06:44,028 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 448 flow [2023-01-27 18:06:44,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=448, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-01-27 18:06:44,029 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2023-01-27 18:06:44,029 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 448 flow [2023-01-27 18:06:44,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:44,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:44,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:44,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:06:44,030 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:44,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:44,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1548607585, now seen corresponding path program 1 times [2023-01-27 18:06:44,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:44,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613880131] [2023-01-27 18:06:44,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:44,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:44,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613880131] [2023-01-27 18:06:44,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613880131] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:44,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:44,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:06:44,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614333987] [2023-01-27 18:06:44,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:44,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:06:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:44,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:06:44,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:06:44,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-01-27 18:06:44,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 448 flow. Second operand has 8 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:44,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:44,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-01-27 18:06:44,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:45,869 INFO L130 PetriNetUnfolder]: 5947/9556 cut-off events. [2023-01-27 18:06:45,869 INFO L131 PetriNetUnfolder]: For 21066/21112 co-relation queries the response was YES. [2023-01-27 18:06:45,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33692 conditions, 9556 events. 5947/9556 cut-off events. For 21066/21112 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 65432 event pairs, 1558 based on Foata normal form. 10/9393 useless extension candidates. Maximal degree in co-relation 33667. Up to 4519 conditions per place. [2023-01-27 18:06:45,944 INFO L137 encePairwiseOnDemand]: 232/241 looper letters, 177 selfloop transitions, 13 changer transitions 24/223 dead transitions. [2023-01-27 18:06:45,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 223 transitions, 2192 flow [2023-01-27 18:06:45,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:06:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:06:45,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 970 transitions. [2023-01-27 18:06:45,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031120331950207 [2023-01-27 18:06:45,947 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 970 transitions. [2023-01-27 18:06:45,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 970 transitions. [2023-01-27 18:06:45,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:45,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 970 transitions. [2023-01-27 18:06:45,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.25) internal successors, (970), 8 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:45,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:45,952 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:45,952 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 448 flow. Second operand 8 states and 970 transitions. [2023-01-27 18:06:45,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 223 transitions, 2192 flow [2023-01-27 18:06:46,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 223 transitions, 1755 flow, removed 154 selfloop flow, removed 4 redundant places. [2023-01-27 18:06:46,637 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 465 flow [2023-01-27 18:06:46,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=465, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2023-01-27 18:06:46,639 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2023-01-27 18:06:46,639 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 465 flow [2023-01-27 18:06:46,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:46,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:46,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:46,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:06:46,658 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:46,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:46,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1769291287, now seen corresponding path program 2 times [2023-01-27 18:06:46,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:46,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870849629] [2023-01-27 18:06:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:46,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:46,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:46,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870849629] [2023-01-27 18:06:46,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870849629] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:46,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:46,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:06:46,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293030786] [2023-01-27 18:06:46,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:46,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:06:46,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:46,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:06:46,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:06:46,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 241 [2023-01-27 18:06:46,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:46,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:46,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 241 [2023-01-27 18:06:46,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:49,067 INFO L130 PetriNetUnfolder]: 17859/26077 cut-off events. [2023-01-27 18:06:49,068 INFO L131 PetriNetUnfolder]: For 47309/47309 co-relation queries the response was YES. [2023-01-27 18:06:49,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95519 conditions, 26077 events. 17859/26077 cut-off events. For 47309/47309 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 167442 event pairs, 1914 based on Foata normal form. 16/26093 useless extension candidates. Maximal degree in co-relation 95488. Up to 13749 conditions per place. [2023-01-27 18:06:49,289 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 99 selfloop transitions, 10 changer transitions 112/221 dead transitions. [2023-01-27 18:06:49,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 221 transitions, 1770 flow [2023-01-27 18:06:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:06:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:06:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 832 transitions. [2023-01-27 18:06:49,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49318316538233553 [2023-01-27 18:06:49,292 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 832 transitions. [2023-01-27 18:06:49,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 832 transitions. [2023-01-27 18:06:49,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:49,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 832 transitions. [2023-01-27 18:06:49,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:49,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:49,296 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:49,296 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 465 flow. Second operand 7 states and 832 transitions. [2023-01-27 18:06:49,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 221 transitions, 1770 flow [2023-01-27 18:06:50,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 221 transitions, 1765 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 18:06:50,918 INFO L231 Difference]: Finished difference. Result has 81 places, 58 transitions, 379 flow [2023-01-27 18:06:50,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=81, PETRI_TRANSITIONS=58} [2023-01-27 18:06:50,919 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2023-01-27 18:06:50,920 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 58 transitions, 379 flow [2023-01-27 18:06:50,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:50,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:50,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:50,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:06:50,920 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:50,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2049393869, now seen corresponding path program 3 times [2023-01-27 18:06:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:50,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630906462] [2023-01-27 18:06:50,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:50,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:51,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630906462] [2023-01-27 18:06:51,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630906462] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:51,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:51,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:06:51,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808801889] [2023-01-27 18:06:51,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:51,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:06:51,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:51,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:06:51,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:06:51,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-01-27 18:06:51,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 58 transitions, 379 flow. Second operand has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:51,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:51,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-01-27 18:06:51,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:51,670 INFO L130 PetriNetUnfolder]: 3271/5268 cut-off events. [2023-01-27 18:06:51,670 INFO L131 PetriNetUnfolder]: For 8336/8527 co-relation queries the response was YES. [2023-01-27 18:06:51,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17817 conditions, 5268 events. 3271/5268 cut-off events. For 8336/8527 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 33903 event pairs, 662 based on Foata normal form. 70/5165 useless extension candidates. Maximal degree in co-relation 17789. Up to 2061 conditions per place. [2023-01-27 18:06:51,702 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 82 selfloop transitions, 18 changer transitions 20/128 dead transitions. [2023-01-27 18:06:51,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 128 transitions, 908 flow [2023-01-27 18:06:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:06:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:06:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 980 transitions. [2023-01-27 18:06:51,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508298755186722 [2023-01-27 18:06:51,705 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 980 transitions. [2023-01-27 18:06:51,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 980 transitions. [2023-01-27 18:06:51,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:51,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 980 transitions. [2023-01-27 18:06:51,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.5) internal successors, (980), 8 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:51,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:51,709 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:51,709 INFO L175 Difference]: Start difference. First operand has 81 places, 58 transitions, 379 flow. Second operand 8 states and 980 transitions. [2023-01-27 18:06:51,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 128 transitions, 908 flow [2023-01-27 18:06:51,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 828 flow, removed 33 selfloop flow, removed 11 redundant places. [2023-01-27 18:06:51,823 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 330 flow [2023-01-27 18:06:51,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=330, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2023-01-27 18:06:51,824 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2023-01-27 18:06:51,825 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 330 flow [2023-01-27 18:06:51,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:51,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:51,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:51,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:06:51,825 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:51,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:51,826 INFO L85 PathProgramCache]: Analyzing trace with hash 271414072, now seen corresponding path program 1 times [2023-01-27 18:06:51,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:51,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553533467] [2023-01-27 18:06:51,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:51,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:52,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:52,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553533467] [2023-01-27 18:06:52,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553533467] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:52,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:52,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:06:52,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227677286] [2023-01-27 18:06:52,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:52,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:06:52,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:52,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:06:52,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:06:52,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 241 [2023-01-27 18:06:52,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 53 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:52,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:52,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 241 [2023-01-27 18:06:52,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:52,695 INFO L130 PetriNetUnfolder]: 4917/7523 cut-off events. [2023-01-27 18:06:52,695 INFO L131 PetriNetUnfolder]: For 15338/15338 co-relation queries the response was YES. [2023-01-27 18:06:52,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28003 conditions, 7523 events. 4917/7523 cut-off events. For 15338/15338 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 41939 event pairs, 1030 based on Foata normal form. 1/7524 useless extension candidates. Maximal degree in co-relation 27977. Up to 3488 conditions per place. [2023-01-27 18:06:52,742 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 75 selfloop transitions, 4 changer transitions 48/127 dead transitions. [2023-01-27 18:06:52,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 127 transitions, 1042 flow [2023-01-27 18:06:52,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:06:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:06:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 800 transitions. [2023-01-27 18:06:52,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742145820983995 [2023-01-27 18:06:52,744 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 800 transitions. [2023-01-27 18:06:52,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 800 transitions. [2023-01-27 18:06:52,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:52,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 800 transitions. [2023-01-27 18:06:52,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:52,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:52,748 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:52,748 INFO L175 Difference]: Start difference. First operand has 71 places, 53 transitions, 330 flow. Second operand 7 states and 800 transitions. [2023-01-27 18:06:52,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 127 transitions, 1042 flow [2023-01-27 18:06:52,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 127 transitions, 859 flow, removed 53 selfloop flow, removed 9 redundant places. [2023-01-27 18:06:52,850 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 255 flow [2023-01-27 18:06:52,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2023-01-27 18:06:52,851 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2023-01-27 18:06:52,851 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 255 flow [2023-01-27 18:06:52,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:52,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:52,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:52,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:06:52,852 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:52,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash 743488830, now seen corresponding path program 2 times [2023-01-27 18:06:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:52,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147058989] [2023-01-27 18:06:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:53,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:53,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147058989] [2023-01-27 18:06:53,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147058989] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:53,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:53,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:06:53,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764460000] [2023-01-27 18:06:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:53,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:06:53,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:53,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:06:53,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:06:53,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 241 [2023-01-27 18:06:53,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:53,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:53,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 241 [2023-01-27 18:06:53,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:53,534 INFO L130 PetriNetUnfolder]: 3394/5217 cut-off events. [2023-01-27 18:06:53,534 INFO L131 PetriNetUnfolder]: For 6793/6793 co-relation queries the response was YES. [2023-01-27 18:06:53,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17243 conditions, 5217 events. 3394/5217 cut-off events. For 6793/6793 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 27676 event pairs, 677 based on Foata normal form. 1/5218 useless extension candidates. Maximal degree in co-relation 17224. Up to 2758 conditions per place. [2023-01-27 18:06:53,552 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 57 selfloop transitions, 3 changer transitions 60/120 dead transitions. [2023-01-27 18:06:53,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 120 transitions, 824 flow [2023-01-27 18:06:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:06:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:06:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 798 transitions. [2023-01-27 18:06:53,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730290456431535 [2023-01-27 18:06:53,554 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 798 transitions. [2023-01-27 18:06:53,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 798 transitions. [2023-01-27 18:06:53,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:53,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 798 transitions. [2023-01-27 18:06:53,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:53,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:53,559 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:53,559 INFO L175 Difference]: Start difference. First operand has 68 places, 51 transitions, 255 flow. Second operand 7 states and 798 transitions. [2023-01-27 18:06:53,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 120 transitions, 824 flow [2023-01-27 18:06:53,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 120 transitions, 804 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-01-27 18:06:53,599 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 228 flow [2023-01-27 18:06:53,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-01-27 18:06:53,600 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2023-01-27 18:06:53,600 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 228 flow [2023-01-27 18:06:53,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:53,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:53,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:53,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:06:53,601 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:53,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:53,601 INFO L85 PathProgramCache]: Analyzing trace with hash 646544992, now seen corresponding path program 3 times [2023-01-27 18:06:53,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:53,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938005884] [2023-01-27 18:06:53,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:53,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:06:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:06:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:06:54,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938005884] [2023-01-27 18:06:54,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938005884] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:06:54,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:06:54,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 18:06:54,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904847126] [2023-01-27 18:06:54,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:06:54,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-27 18:06:54,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:06:54,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-27 18:06:54,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-01-27 18:06:54,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-01-27 18:06:54,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 228 flow. Second operand has 9 states, 9 states have (on average 107.77777777777777) internal successors, (970), 9 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:54,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:06:54,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-01-27 18:06:54,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:06:54,565 INFO L130 PetriNetUnfolder]: 962/1579 cut-off events. [2023-01-27 18:06:54,565 INFO L131 PetriNetUnfolder]: For 2208/2246 co-relation queries the response was YES. [2023-01-27 18:06:54,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5289 conditions, 1579 events. 962/1579 cut-off events. For 2208/2246 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7619 event pairs, 151 based on Foata normal form. 32/1568 useless extension candidates. Maximal degree in co-relation 5269. Up to 1000 conditions per place. [2023-01-27 18:06:54,571 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 53 selfloop transitions, 4 changer transitions 34/96 dead transitions. [2023-01-27 18:06:54,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 96 transitions, 646 flow [2023-01-27 18:06:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:06:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:06:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 898 transitions. [2023-01-27 18:06:54,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657676348547718 [2023-01-27 18:06:54,573 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 898 transitions. [2023-01-27 18:06:54,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 898 transitions. [2023-01-27 18:06:54,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:06:54,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 898 transitions. [2023-01-27 18:06:54,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:54,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:54,577 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:54,577 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 228 flow. Second operand 8 states and 898 transitions. [2023-01-27 18:06:54,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 96 transitions, 646 flow [2023-01-27 18:06:54,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 627 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-01-27 18:06:54,587 INFO L231 Difference]: Finished difference. Result has 70 places, 44 transitions, 222 flow [2023-01-27 18:06:54,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2023-01-27 18:06:54,588 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2023-01-27 18:06:54,589 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 222 flow [2023-01-27 18:06:54,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.77777777777777) internal successors, (970), 9 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:06:54,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:06:54,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:54,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:06:54,589 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:06:54,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:06:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash -996024222, now seen corresponding path program 4 times [2023-01-27 18:06:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:06:54,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721668348] [2023-01-27 18:06:54,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:06:54,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:06:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:06:54,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:06:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:06:54,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:06:54,721 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:06:54,722 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:06:54,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:06:54,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:06:54,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:06:54,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:06:54,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:06:54,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:06:54,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:06:54,726 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:06:54,731 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:06:54,732 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:06:54,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:06:54 BasicIcfg [2023-01-27 18:06:54,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:06:54,887 INFO L158 Benchmark]: Toolchain (without parser) took 26623.55ms. Allocated memory was 367.0MB in the beginning and 3.2GB in the end (delta: 2.9GB). Free memory was 302.5MB in the beginning and 3.1GB in the end (delta: -2.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-01-27 18:06:54,887 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 367.0MB. Free memory is still 314.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:06:54,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.83ms. Allocated memory was 367.0MB in the beginning and 669.0MB in the end (delta: 302.0MB). Free memory was 302.3MB in the beginning and 631.2MB in the end (delta: -328.9MB). Peak memory consumption was 29.5MB. Max. memory is 16.0GB. [2023-01-27 18:06:54,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.12ms. Allocated memory is still 669.0MB. Free memory was 631.2MB in the beginning and 628.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:06:54,888 INFO L158 Benchmark]: Boogie Preprocessor took 36.33ms. Allocated memory is still 669.0MB. Free memory was 628.9MB in the beginning and 626.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:06:54,888 INFO L158 Benchmark]: RCFGBuilder took 764.24ms. Allocated memory is still 669.0MB. Free memory was 626.9MB in the beginning and 585.0MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-01-27 18:06:54,888 INFO L158 Benchmark]: TraceAbstraction took 25312.27ms. Allocated memory was 669.0MB in the beginning and 3.2GB in the end (delta: 2.5GB). Free memory was 585.0MB in the beginning and 3.1GB in the end (delta: -2.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-01-27 18:06:54,889 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.10ms. Allocated memory is still 367.0MB. Free memory is still 314.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 446.83ms. Allocated memory was 367.0MB in the beginning and 669.0MB in the end (delta: 302.0MB). Free memory was 302.3MB in the beginning and 631.2MB in the end (delta: -328.9MB). Peak memory consumption was 29.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.12ms. Allocated memory is still 669.0MB. Free memory was 631.2MB in the beginning and 628.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.33ms. Allocated memory is still 669.0MB. Free memory was 628.9MB in the beginning and 626.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 764.24ms. Allocated memory is still 669.0MB. Free memory was 626.9MB in the beginning and 585.0MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 25312.27ms. Allocated memory was 669.0MB in the beginning and 3.2GB in the end (delta: 2.5GB). Free memory was 585.0MB in the beginning and 3.1GB in the end (delta: -2.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 141 PlacesBefore, 46 PlacesAfterwards, 130 TransitionsBefore, 34 TransitionsAfterwards, 3300 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 10234 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4236, independent: 3967, independent conditional: 0, independent unconditional: 3967, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1707, independent: 1660, independent conditional: 0, independent unconditional: 1660, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4236, independent: 2307, independent conditional: 0, independent unconditional: 2307, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 1707, unknown conditional: 0, unknown unconditional: 1707] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 192, Positive conditional cache size: 0, Positive unconditional cache size: 192, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t321; [L874] FCALL, FORK 0 pthread_create(&t321, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t321, ((void *)0), P0, ((void *)0))=-3, t321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t322; [L876] FCALL, FORK 0 pthread_create(&t322, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t322, ((void *)0), P1, ((void *)0))=-2, t321={5:0}, t322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t323; [L878] FCALL, FORK 0 pthread_create(&t323, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t323, ((void *)0), P2, ((void *)0))=-1, t321={5:0}, t322={6:0}, t323={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t324; [L880] FCALL, FORK 0 pthread_create(&t324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t324, ((void *)0), P3, ((void *)0))=0, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$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_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 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_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L795] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L796] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L798] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L799] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, 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: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 706 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 706 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2155 IncrementalHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 53 mSDtfsCounter, 2155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=465occurred in iteration=8, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 2069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:06:54,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...