/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix010.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:49:17,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:49:17,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:49:17,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:49:17,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:49:17,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:49:17,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:49:17,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:49:17,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:49:17,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:49:17,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:49:17,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:49:17,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:49:17,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:49:17,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:49:17,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:49:17,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:49:17,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:49:17,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:49:17,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:49:17,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:49:17,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:49:17,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:49:17,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:49:17,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:49:17,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:49:17,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:49:17,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:49:17,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:49:17,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:49:17,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:49:17,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:49:17,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:49:17,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:49:17,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:49:17,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:49:17,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:49:17,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:49:17,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:49:17,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:49:17,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:49:17,610 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:49:17,637 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:49:17,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:49:17,639 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:49:17,639 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:49:17,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:49:17,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:49:17,640 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:49:17,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:49:17,640 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:49:17,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:49:17,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:49:17,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:49:17,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:49:17,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:49:17,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:49:17,641 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:49:17,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:49:17,642 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:49:17,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:49:17,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:49:17,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:49:17,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:49:17,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:49:17,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:49:17,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:49:17,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:49:17,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:49:17,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:49:17,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:49:17,644 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:49:17,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:49:17,644 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:49:17,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:49:17,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:49:17,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:49:17,883 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:49:17,884 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:49:17,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.oepc.i [2023-01-28 06:49:18,979 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:49:19,226 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:49:19,226 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.oepc.i [2023-01-28 06:49:19,244 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd26830fd/e1049d688f794a49930b205fa799c186/FLAGfab3b5e9f [2023-01-28 06:49:19,260 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd26830fd/e1049d688f794a49930b205fa799c186 [2023-01-28 06:49:19,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:49:19,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:49:19,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:49:19,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:49:19,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:49:19,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cf99d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19, skipping insertion in model container [2023-01-28 06:49:19,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:49:19,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:49:19,473 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/mix010.oepc.i[945,958] [2023-01-28 06:49:19,652 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:49:19,673 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:49:19,681 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/mix010.oepc.i[945,958] [2023-01-28 06:49:19,727 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:49:19,748 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:49:19,748 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:49:19,753 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:49:19,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19 WrapperNode [2023-01-28 06:49:19,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:49:19,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:49:19,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:49:19,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:49:19,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,804 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2023-01-28 06:49:19,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:49:19,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:49:19,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:49:19,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:49:19,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,835 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:49:19,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:49:19,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:49:19,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:49:19,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19" (1/1) ... [2023-01-28 06:49:19,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:49:19,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:49:19,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:49:19,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:49:19,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:49:19,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:49:19,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:49:19,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:49:19,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:49:19,899 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:49:19,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:49:19,899 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:49:19,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:49:19,899 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:49:19,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:49:19,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:49:19,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:49:19,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:49:19,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:49:19,901 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:49:20,027 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:49:20,029 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:49:20,388 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:49:20,549 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:49:20,549 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:49:20,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:49:20 BoogieIcfgContainer [2023-01-28 06:49:20,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:49:20,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:49:20,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:49:20,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:49:20,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:49:19" (1/3) ... [2023-01-28 06:49:20,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8a69e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:49:20, skipping insertion in model container [2023-01-28 06:49:20,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:49:19" (2/3) ... [2023-01-28 06:49:20,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8a69e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:49:20, skipping insertion in model container [2023-01-28 06:49:20,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:49:20" (3/3) ... [2023-01-28 06:49:20,559 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.oepc.i [2023-01-28 06:49:20,577 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:49:20,577 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:49:20,577 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:49:20,627 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:49:20,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2023-01-28 06:49:20,712 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-01-28 06:49:20,713 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:49:20,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-01-28 06:49:20,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2023-01-28 06:49:20,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-01-28 06:49:20,726 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:49:20,734 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-01-28 06:49:20,736 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-01-28 06:49:20,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-01-28 06:49:20,758 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-01-28 06:49:20,758 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:49:20,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-01-28 06:49:20,760 INFO L119 LiptonReduction]: Number of co-enabled transitions 2216 [2023-01-28 06:49:24,040 INFO L134 LiptonReduction]: Checked pairs total: 6622 [2023-01-28 06:49:24,040 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-01-28 06:49:24,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:49:24,058 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;@6162251e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:49:24,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 06:49:24,060 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 06:49:24,060 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:49:24,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:24,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 06:49:24,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:49:24,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:24,065 INFO L85 PathProgramCache]: Analyzing trace with hash 489458, now seen corresponding path program 1 times [2023-01-28 06:49:24,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:24,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157986871] [2023-01-28 06:49:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:24,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:24,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:24,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157986871] [2023-01-28 06:49:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157986871] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:24,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:24,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:49:24,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113208790] [2023-01-28 06:49:24,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:24,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:49:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:24,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:49:24,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:49:24,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 210 [2023-01-28 06:49:24,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:24,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:24,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 210 [2023-01-28 06:49:24,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:24,810 INFO L130 PetriNetUnfolder]: 1614/2556 cut-off events. [2023-01-28 06:49:24,811 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-01-28 06:49:24,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4974 conditions, 2556 events. 1614/2556 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14404 event pairs, 264 based on Foata normal form. 100/2447 useless extension candidates. Maximal degree in co-relation 4963. Up to 1912 conditions per place. [2023-01-28 06:49:24,827 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 35 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-01-28 06:49:24,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 185 flow [2023-01-28 06:49:24,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:49:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:49:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-01-28 06:49:24,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5507936507936508 [2023-01-28 06:49:24,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-01-28 06:49:24,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-01-28 06:49:24,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:24,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-01-28 06:49:24,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:24,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:24,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:24,852 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 347 transitions. [2023-01-28 06:49:24,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 185 flow [2023-01-28 06:49:24,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 06:49:24,856 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-01-28 06:49:24,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-01-28 06:49:24,865 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-01-28 06:49:24,865 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-01-28 06:49:24,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:24,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:24,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:24,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:49:24,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:49:24,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash 502737743, now seen corresponding path program 1 times [2023-01-28 06:49:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690653781] [2023-01-28 06:49:24,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:25,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:25,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690653781] [2023-01-28 06:49:25,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690653781] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:25,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:25,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:49:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270049934] [2023-01-28 06:49:25,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:25,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:49:25,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:25,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:49:25,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:49:25,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-01-28 06:49:25,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:25,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:25,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-01-28 06:49:25,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:25,690 INFO L130 PetriNetUnfolder]: 2371/3506 cut-off events. [2023-01-28 06:49:25,690 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2023-01-28 06:49:25,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7310 conditions, 3506 events. 2371/3506 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15916 event pairs, 1191 based on Foata normal form. 180/3686 useless extension candidates. Maximal degree in co-relation 7300. Up to 2979 conditions per place. [2023-01-28 06:49:25,710 INFO L137 encePairwiseOnDemand]: 204/210 looper letters, 32 selfloop transitions, 4 changer transitions 21/57 dead transitions. [2023-01-28 06:49:25,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 57 transitions, 248 flow [2023-01-28 06:49:25,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:49:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:49:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2023-01-28 06:49:25,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47523809523809524 [2023-01-28 06:49:25,714 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 499 transitions. [2023-01-28 06:49:25,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 499 transitions. [2023-01-28 06:49:25,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:25,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 499 transitions. [2023-01-28 06:49:25,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:25,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:25,719 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:25,719 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 499 transitions. [2023-01-28 06:49:25,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 57 transitions, 248 flow [2023-01-28 06:49:25,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:49:25,721 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 90 flow [2023-01-28 06:49:25,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-01-28 06:49:25,722 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-01-28 06:49:25,722 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 90 flow [2023-01-28 06:49:25,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:25,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:25,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:25,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:49:25,723 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:49:25,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:25,723 INFO L85 PathProgramCache]: Analyzing trace with hash -248772060, now seen corresponding path program 1 times [2023-01-28 06:49:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:25,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952884872] [2023-01-28 06:49:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:25,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:25,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952884872] [2023-01-28 06:49:25,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952884872] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:25,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:25,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:49:25,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595773515] [2023-01-28 06:49:25,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:25,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:49:25,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:25,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:49:25,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:49:25,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-01-28 06:49:25,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:25,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:25,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-01-28 06:49:25,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:26,318 INFO L130 PetriNetUnfolder]: 2103/3110 cut-off events. [2023-01-28 06:49:26,319 INFO L131 PetriNetUnfolder]: For 1509/1509 co-relation queries the response was YES. [2023-01-28 06:49:26,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7647 conditions, 3110 events. 2103/3110 cut-off events. For 1509/1509 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13586 event pairs, 579 based on Foata normal form. 156/3266 useless extension candidates. Maximal degree in co-relation 7634. Up to 2001 conditions per place. [2023-01-28 06:49:26,336 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 35 selfloop transitions, 3 changer transitions 24/62 dead transitions. [2023-01-28 06:49:26,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 314 flow [2023-01-28 06:49:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:49:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:49:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-01-28 06:49:26,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47714285714285715 [2023-01-28 06:49:26,338 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-01-28 06:49:26,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-01-28 06:49:26,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:26,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-01-28 06:49:26,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:26,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:26,342 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:26,343 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 90 flow. Second operand 5 states and 501 transitions. [2023-01-28 06:49:26,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 314 flow [2023-01-28 06:49:26,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 308 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:49:26,351 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 99 flow [2023-01-28 06:49:26,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-01-28 06:49:26,352 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2023-01-28 06:49:26,352 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 99 flow [2023-01-28 06:49:26,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:26,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:26,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:26,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:49:26,353 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:49:26,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:26,354 INFO L85 PathProgramCache]: Analyzing trace with hash 727207216, now seen corresponding path program 1 times [2023-01-28 06:49:26,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:26,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276158835] [2023-01-28 06:49:26,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:26,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:26,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:26,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276158835] [2023-01-28 06:49:26,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276158835] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:26,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:26,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:49:26,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549916451] [2023-01-28 06:49:26,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:26,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:49:26,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:26,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:49:26,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:49:26,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 210 [2023-01-28 06:49:26,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:26,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:26,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 210 [2023-01-28 06:49:26,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:26,845 INFO L130 PetriNetUnfolder]: 1225/1976 cut-off events. [2023-01-28 06:49:26,845 INFO L131 PetriNetUnfolder]: For 1228/1257 co-relation queries the response was YES. [2023-01-28 06:49:26,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4652 conditions, 1976 events. 1225/1976 cut-off events. For 1228/1257 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9884 event pairs, 415 based on Foata normal form. 100/2052 useless extension candidates. Maximal degree in co-relation 4636. Up to 1146 conditions per place. [2023-01-28 06:49:26,856 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 30 selfloop transitions, 3 changer transitions 17/55 dead transitions. [2023-01-28 06:49:26,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 265 flow [2023-01-28 06:49:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:49:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:49:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 526 transitions. [2023-01-28 06:49:26,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009523809523809 [2023-01-28 06:49:26,859 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 526 transitions. [2023-01-28 06:49:26,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 526 transitions. [2023-01-28 06:49:26,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:26,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 526 transitions. [2023-01-28 06:49:26,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:26,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:26,863 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:26,863 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 99 flow. Second operand 5 states and 526 transitions. [2023-01-28 06:49:26,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 265 flow [2023-01-28 06:49:26,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 255 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 06:49:26,871 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 104 flow [2023-01-28 06:49:26,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-01-28 06:49:26,871 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-01-28 06:49:26,872 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 104 flow [2023-01-28 06:49:26,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:26,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:26,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:26,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:49:26,872 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:49:26,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash -592144845, now seen corresponding path program 1 times [2023-01-28 06:49:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:26,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770886204] [2023-01-28 06:49:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:26,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:27,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:27,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770886204] [2023-01-28 06:49:27,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770886204] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:27,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:27,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:49:27,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863015535] [2023-01-28 06:49:27,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:27,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:49:27,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:27,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:49:27,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:49:27,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 210 [2023-01-28 06:49:27,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:27,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:27,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 210 [2023-01-28 06:49:27,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:27,220 INFO L130 PetriNetUnfolder]: 573/980 cut-off events. [2023-01-28 06:49:27,220 INFO L131 PetriNetUnfolder]: For 609/620 co-relation queries the response was YES. [2023-01-28 06:49:27,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2519 conditions, 980 events. 573/980 cut-off events. For 609/620 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4457 event pairs, 162 based on Foata normal form. 60/1035 useless extension candidates. Maximal degree in co-relation 2502. Up to 729 conditions per place. [2023-01-28 06:49:27,226 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 33 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-01-28 06:49:27,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 219 flow [2023-01-28 06:49:27,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:49:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:49:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-01-28 06:49:27,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206349206349207 [2023-01-28 06:49:27,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-01-28 06:49:27,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-01-28 06:49:27,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:27,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-01-28 06:49:27,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:27,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:27,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:27,233 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 104 flow. Second operand 3 states and 328 transitions. [2023-01-28 06:49:27,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 219 flow [2023-01-28 06:49:27,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 207 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 06:49:27,236 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 120 flow [2023-01-28 06:49:27,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-01-28 06:49:27,238 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-01-28 06:49:27,238 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 120 flow [2023-01-28 06:49:27,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:27,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:27,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:27,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:49:27,239 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:49:27,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash -317512214, now seen corresponding path program 1 times [2023-01-28 06:49:27,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:27,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872794876] [2023-01-28 06:49:27,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:27,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:27,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872794876] [2023-01-28 06:49:27,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872794876] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:27,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:27,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:49:27,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711980147] [2023-01-28 06:49:27,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:27,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:49:27,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:27,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:49:27,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:49:27,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 210 [2023-01-28 06:49:27,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:27,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:27,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 210 [2023-01-28 06:49:27,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:27,626 INFO L130 PetriNetUnfolder]: 281/536 cut-off events. [2023-01-28 06:49:27,626 INFO L131 PetriNetUnfolder]: For 203/204 co-relation queries the response was YES. [2023-01-28 06:49:27,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 536 events. 281/536 cut-off events. For 203/204 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2274 event pairs, 109 based on Foata normal form. 50/583 useless extension candidates. Maximal degree in co-relation 1498. Up to 206 conditions per place. [2023-01-28 06:49:27,629 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 43 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-01-28 06:49:27,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 292 flow [2023-01-28 06:49:27,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:49:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:49:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2023-01-28 06:49:27,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2023-01-28 06:49:27,631 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 438 transitions. [2023-01-28 06:49:27,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions. [2023-01-28 06:49:27,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:27,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions. [2023-01-28 06:49:27,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:27,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:27,634 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:27,634 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 120 flow. Second operand 4 states and 438 transitions. [2023-01-28 06:49:27,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 292 flow [2023-01-28 06:49:27,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:49:27,636 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 156 flow [2023-01-28 06:49:27,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-01-28 06:49:27,637 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2023-01-28 06:49:27,637 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 156 flow [2023-01-28 06:49:27,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:27,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:27,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:27,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:49:27,638 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:49:27,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:27,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1092294704, now seen corresponding path program 1 times [2023-01-28 06:49:27,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:27,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373222948] [2023-01-28 06:49:27,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:27,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:27,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373222948] [2023-01-28 06:49:27,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373222948] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:27,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:27,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:49:27,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864971248] [2023-01-28 06:49:27,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:27,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:49:27,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:27,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:49:27,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:49:27,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 210 [2023-01-28 06:49:27,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:27,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:27,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 210 [2023-01-28 06:49:27,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:28,028 INFO L130 PetriNetUnfolder]: 238/449 cut-off events. [2023-01-28 06:49:28,028 INFO L131 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2023-01-28 06:49:28,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 449 events. 238/449 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1911 event pairs, 105 based on Foata normal form. 13/459 useless extension candidates. Maximal degree in co-relation 1314. Up to 206 conditions per place. [2023-01-28 06:49:28,031 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 40 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2023-01-28 06:49:28,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 316 flow [2023-01-28 06:49:28,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:49:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:49:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2023-01-28 06:49:28,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2023-01-28 06:49:28,033 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2023-01-28 06:49:28,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2023-01-28 06:49:28,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:28,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2023-01-28 06:49:28,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:28,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:28,037 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:28,037 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 156 flow. Second operand 5 states and 535 transitions. [2023-01-28 06:49:28,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 316 flow [2023-01-28 06:49:28,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 286 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-01-28 06:49:28,039 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 156 flow [2023-01-28 06:49:28,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-01-28 06:49:28,040 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2023-01-28 06:49:28,040 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 156 flow [2023-01-28 06:49:28,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:28,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:28,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:28,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:49:28,041 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:49:28,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash 360292321, now seen corresponding path program 1 times [2023-01-28 06:49:28,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:28,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657342679] [2023-01-28 06:49:28,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:28,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:28,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:28,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657342679] [2023-01-28 06:49:28,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657342679] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:28,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:28,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:49:28,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134316986] [2023-01-28 06:49:28,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:28,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:49:28,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:28,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:49:28,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:49:28,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 210 [2023-01-28 06:49:28,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 156 flow. Second operand has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:28,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:28,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 210 [2023-01-28 06:49:28,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:29,356 INFO L130 PetriNetUnfolder]: 547/957 cut-off events. [2023-01-28 06:49:29,356 INFO L131 PetriNetUnfolder]: For 1258/1258 co-relation queries the response was YES. [2023-01-28 06:49:29,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2999 conditions, 957 events. 547/957 cut-off events. For 1258/1258 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4327 event pairs, 63 based on Foata normal form. 1/958 useless extension candidates. Maximal degree in co-relation 2982. Up to 297 conditions per place. [2023-01-28 06:49:29,361 INFO L137 encePairwiseOnDemand]: 198/210 looper letters, 96 selfloop transitions, 15 changer transitions 9/120 dead transitions. [2023-01-28 06:49:29,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 120 transitions, 786 flow [2023-01-28 06:49:29,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:49:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:49:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 846 transitions. [2023-01-28 06:49:29,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2023-01-28 06:49:29,365 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 846 transitions. [2023-01-28 06:49:29,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 846 transitions. [2023-01-28 06:49:29,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:29,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 846 transitions. [2023-01-28 06:49:29,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.0) internal successors, (846), 9 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:29,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:29,370 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:29,370 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 156 flow. Second operand 9 states and 846 transitions. [2023-01-28 06:49:29,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 120 transitions, 786 flow [2023-01-28 06:49:29,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 120 transitions, 678 flow, removed 29 selfloop flow, removed 4 redundant places. [2023-01-28 06:49:29,379 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 213 flow [2023-01-28 06:49:29,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-01-28 06:49:29,381 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2023-01-28 06:49:29,381 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 213 flow [2023-01-28 06:49:29,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:29,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:29,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:29,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:49:29,382 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:49:29,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash -293756201, now seen corresponding path program 2 times [2023-01-28 06:49:29,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:29,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593327854] [2023-01-28 06:49:29,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:29,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593327854] [2023-01-28 06:49:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593327854] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:29,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:29,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:49:29,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316045708] [2023-01-28 06:49:29,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:29,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:49:29,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:29,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:49:29,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:49:29,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-01-28 06:49:29,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:29,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:29,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-01-28 06:49:29,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:29,907 INFO L130 PetriNetUnfolder]: 688/1220 cut-off events. [2023-01-28 06:49:29,908 INFO L131 PetriNetUnfolder]: For 1382/1382 co-relation queries the response was YES. [2023-01-28 06:49:29,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4141 conditions, 1220 events. 688/1220 cut-off events. For 1382/1382 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5829 event pairs, 85 based on Foata normal form. 2/1222 useless extension candidates. Maximal degree in co-relation 4124. Up to 702 conditions per place. [2023-01-28 06:49:29,914 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 63 selfloop transitions, 16 changer transitions 12/91 dead transitions. [2023-01-28 06:49:29,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 91 transitions, 621 flow [2023-01-28 06:49:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:49:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:49:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 574 transitions. [2023-01-28 06:49:29,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2023-01-28 06:49:29,916 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 574 transitions. [2023-01-28 06:49:29,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 574 transitions. [2023-01-28 06:49:29,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:29,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 574 transitions. [2023-01-28 06:49:29,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:29,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:29,920 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:29,920 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 213 flow. Second operand 6 states and 574 transitions. [2023-01-28 06:49:29,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 91 transitions, 621 flow [2023-01-28 06:49:29,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 91 transitions, 600 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-28 06:49:29,929 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 290 flow [2023-01-28 06:49:29,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-01-28 06:49:29,930 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2023-01-28 06:49:29,930 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 290 flow [2023-01-28 06:49:29,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:29,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:29,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:29,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:49:29,931 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:49:29,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:29,931 INFO L85 PathProgramCache]: Analyzing trace with hash 505320137, now seen corresponding path program 3 times [2023-01-28 06:49:29,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:29,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126125661] [2023-01-28 06:49:29,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:29,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:30,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:30,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126125661] [2023-01-28 06:49:30,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126125661] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:30,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:30,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:49:30,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641526544] [2023-01-28 06:49:30,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:30,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:49:30,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:30,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:49:30,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:49:30,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 210 [2023-01-28 06:49:30,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:30,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:30,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 210 [2023-01-28 06:49:30,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:30,506 INFO L130 PetriNetUnfolder]: 717/1390 cut-off events. [2023-01-28 06:49:30,506 INFO L131 PetriNetUnfolder]: For 2124/2162 co-relation queries the response was YES. [2023-01-28 06:49:30,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 1390 events. 717/1390 cut-off events. For 2124/2162 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8117 event pairs, 143 based on Foata normal form. 10/1390 useless extension candidates. Maximal degree in co-relation 4984. Up to 654 conditions per place. [2023-01-28 06:49:30,512 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 39 selfloop transitions, 1 changer transitions 48/94 dead transitions. [2023-01-28 06:49:30,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 710 flow [2023-01-28 06:49:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:49:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:49:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-01-28 06:49:30,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876190476190476 [2023-01-28 06:49:30,514 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-01-28 06:49:30,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-01-28 06:49:30,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:30,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-01-28 06:49:30,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:30,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:30,518 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:30,518 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 290 flow. Second operand 5 states and 512 transitions. [2023-01-28 06:49:30,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 710 flow [2023-01-28 06:49:30,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 696 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-01-28 06:49:30,528 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 247 flow [2023-01-28 06:49:30,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-01-28 06:49:30,529 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2023-01-28 06:49:30,529 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 247 flow [2023-01-28 06:49:30,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:30,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:30,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:30,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:49:30,530 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:49:30,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:30,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1951034557, now seen corresponding path program 4 times [2023-01-28 06:49:30,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:30,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895245223] [2023-01-28 06:49:30,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:30,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:49:30,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:49:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:49:30,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:49:30,690 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:49:30,691 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 06:49:30,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 06:49:30,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 06:49:30,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 06:49:30,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 06:49:30,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 06:49:30,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:49:30,694 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:30,699 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:49:30,699 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:49:30,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:49:30 BasicIcfg [2023-01-28 06:49:30,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:49:30,771 INFO L158 Benchmark]: Toolchain (without parser) took 11507.48ms. Allocated memory was 364.9MB in the beginning and 633.3MB in the end (delta: 268.4MB). Free memory was 323.1MB in the beginning and 405.6MB in the end (delta: -82.5MB). Peak memory consumption was 187.8MB. Max. memory is 16.0GB. [2023-01-28 06:49:30,771 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:49:30,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.30ms. Allocated memory is still 364.9MB. Free memory was 323.1MB in the beginning and 299.7MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:49:30,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.76ms. Allocated memory is still 364.9MB. Free memory was 299.7MB in the beginning and 297.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:49:30,772 INFO L158 Benchmark]: Boogie Preprocessor took 34.19ms. Allocated memory is still 364.9MB. Free memory was 297.3MB in the beginning and 295.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:49:30,772 INFO L158 Benchmark]: RCFGBuilder took 711.75ms. Allocated memory is still 364.9MB. Free memory was 295.2MB in the beginning and 330.3MB in the end (delta: -35.1MB). Peak memory consumption was 35.9MB. Max. memory is 16.0GB. [2023-01-28 06:49:30,773 INFO L158 Benchmark]: TraceAbstraction took 10217.35ms. Allocated memory was 364.9MB in the beginning and 633.3MB in the end (delta: 268.4MB). Free memory was 330.3MB in the beginning and 405.6MB in the end (delta: -75.3MB). Peak memory consumption was 193.9MB. Max. memory is 16.0GB. [2023-01-28 06:49:30,774 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 487.30ms. Allocated memory is still 364.9MB. Free memory was 323.1MB in the beginning and 299.7MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 50.76ms. Allocated memory is still 364.9MB. Free memory was 299.7MB in the beginning and 297.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.19ms. Allocated memory is still 364.9MB. Free memory was 297.3MB in the beginning and 295.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 711.75ms. Allocated memory is still 364.9MB. Free memory was 295.2MB in the beginning and 330.3MB in the end (delta: -35.1MB). Peak memory consumption was 35.9MB. Max. memory is 16.0GB. * TraceAbstraction took 10217.35ms. Allocated memory was 364.9MB in the beginning and 633.3MB in the end (delta: 268.4MB). Free memory was 330.3MB in the beginning and 405.6MB in the end (delta: -75.3MB). Peak memory consumption was 193.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 120 PlacesBefore, 37 PlacesAfterwards, 112 TransitionsBefore, 28 TransitionsAfterwards, 2216 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 6622 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3264, independent: 3044, independent conditional: 0, independent unconditional: 3044, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1231, independent: 1193, independent conditional: 0, independent unconditional: 1193, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3264, independent: 1851, independent conditional: 0, independent unconditional: 1851, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1231, unknown conditional: 0, unknown unconditional: 1231] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t257; [L851] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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(&t257, ((void *)0), P0, ((void *)0))=-2, t257={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t258; [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 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_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t258, ((void *)0), P1, ((void *)0))=-1, t257={5:0}, t258={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t259; [L855] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t259, ((void *)0), P2, ((void *)0))=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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$$choice2=0, x=1, y=1, z=1] [L792] 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) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 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 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 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=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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$$choice2=0, x=1, y=1, z=1] [L766] 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) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 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 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 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=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L828] 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) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 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 [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 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 [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, 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: 853]: 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: 855]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 260 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 960 IncrementalHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 24 mSDtfsCounter, 960 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=9, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 1013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 06:49:30,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...