/usr/bin/java -Xmx8000000000 -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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-0612a5f-m [2022-09-20 20:41:02,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 20:41:02,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 20:41:02,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 20:41:02,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 20:41:02,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 20:41:02,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 20:41:02,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 20:41:02,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 20:41:02,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 20:41:02,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 20:41:02,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 20:41:02,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 20:41:02,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 20:41:02,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 20:41:02,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 20:41:02,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 20:41:02,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 20:41:02,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 20:41:02,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 20:41:02,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 20:41:02,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 20:41:02,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 20:41:02,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 20:41:02,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 20:41:02,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 20:41:02,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 20:41:02,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 20:41:02,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 20:41:02,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 20:41:02,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 20:41:02,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 20:41:02,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 20:41:02,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 20:41:02,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 20:41:02,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 20:41:02,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 20:41:02,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 20:41:02,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 20:41:02,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 20:41:02,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 20:41:02,764 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-NoLbe.epf [2022-09-20 20:41:02,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 20:41:02,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 20:41:02,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 20:41:02,779 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 20:41:02,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 20:41:02,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 20:41:02,780 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 20:41:02,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 20:41:02,780 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 20:41:02,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 20:41:02,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 20:41:02,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 20:41:02,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 20:41:02,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 20:41:02,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 20:41:02,781 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 20:41:02,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 20:41:02,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 20:41:02,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 20:41:02,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 20:41:02,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 20:41:02,782 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 20:41:02,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 20:41:02,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:41:02,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 20:41:02,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 20:41:02,782 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 20:41:02,783 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 20:41:02,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 20:41:02,783 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 20:41:02,783 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 20:41:02,783 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-09-20 20:41:02,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 20:41:02,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 20:41:02,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 20:41:02,960 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 20:41:02,962 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 20:41:02,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-09-20 20:41:03,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32a59cf0/93dc18842e67401d979c3d01f323418c/FLAGb620e59b6 [2022-09-20 20:41:03,408 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 20:41:03,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-09-20 20:41:03,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32a59cf0/93dc18842e67401d979c3d01f323418c/FLAGb620e59b6 [2022-09-20 20:41:03,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32a59cf0/93dc18842e67401d979c3d01f323418c [2022-09-20 20:41:03,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 20:41:03,443 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 20:41:03,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 20:41:03,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 20:41:03,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 20:41:03,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:41:03" (1/1) ... [2022-09-20 20:41:03,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36795748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03, skipping insertion in model container [2022-09-20 20:41:03,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:41:03" (1/1) ... [2022-09-20 20:41:03,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 20:41:03,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 20:41:03,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-09-20 20:41:03,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:41:03,801 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 20:41:03,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-09-20 20:41:03,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:41:03,888 INFO L208 MainTranslator]: Completed translation [2022-09-20 20:41:03,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03 WrapperNode [2022-09-20 20:41:03,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 20:41:03,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 20:41:03,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 20:41:03,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 20:41:03,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03" (1/1) ... [2022-09-20 20:41:03,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03" (1/1) ... [2022-09-20 20:41:03,956 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-09-20 20:41:03,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 20:41:03,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 20:41:03,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 20:41:03,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 20:41:03,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03" (1/1) ... [2022-09-20 20:41:03,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03" (1/1) ... [2022-09-20 20:41:03,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03" (1/1) ... [2022-09-20 20:41:03,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03" (1/1) ... [2022-09-20 20:41:03,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03" (1/1) ... [2022-09-20 20:41:03,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03" (1/1) ... [2022-09-20 20:41:04,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03" (1/1) ... [2022-09-20 20:41:04,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 20:41:04,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 20:41:04,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 20:41:04,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 20:41:04,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03" (1/1) ... [2022-09-20 20:41:04,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:41:04,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 20:41:04,038 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) [2022-09-20 20:41:04,056 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 [2022-09-20 20:41:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 20:41:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 20:41:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 20:41:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 20:41:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 20:41:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 20:41:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 20:41:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 20:41:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 20:41:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 20:41:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 20:41:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 20:41:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 20:41:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 20:41:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 20:41:04,075 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 20:41:04,208 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 20:41:04,209 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 20:41:04,815 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 20:41:05,091 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 20:41:05,092 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 20:41:05,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:41:05 BoogieIcfgContainer [2022-09-20 20:41:05,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 20:41:05,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 20:41:05,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 20:41:05,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 20:41:05,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 08:41:03" (1/3) ... [2022-09-20 20:41:05,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d6ac7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:41:05, skipping insertion in model container [2022-09-20 20:41:05,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:41:03" (2/3) ... [2022-09-20 20:41:05,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d6ac7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:41:05, skipping insertion in model container [2022-09-20 20:41:05,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:41:05" (3/3) ... [2022-09-20 20:41:05,100 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-09-20 20:41:05,111 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 20:41:05,112 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 20:41:05,112 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 20:41:05,156 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 20:41:05,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-09-20 20:41:05,236 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-09-20 20:41:05,236 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:41:05,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-09-20 20:41:05,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-09-20 20:41:05,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-09-20 20:41:05,254 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 20:41:05,260 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;@2c48e92b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 20:41:05,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-09-20 20:41:05,269 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-09-20 20:41:05,269 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:41:05,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:05,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:05,270 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:41:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:05,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1234575711, now seen corresponding path program 1 times [2022-09-20 20:41:05,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:05,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612507254] [2022-09-20 20:41:05,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:05,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:05,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:05,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612507254] [2022-09-20 20:41:05,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612507254] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:05,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:05,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 20:41:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671021308] [2022-09-20 20:41:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:05,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 20:41:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:05,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 20:41:05,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 20:41:05,531 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2022-09-20 20:41:05,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:05,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:05,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2022-09-20 20:41:05,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:05,685 INFO L130 PetriNetUnfolder]: 58/484 cut-off events. [2022-09-20 20:41:05,685 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-09-20 20:41:05,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 484 events. 58/484 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2501 event pairs, 44 based on Foata normal form. 15/466 useless extension candidates. Maximal degree in co-relation 563. Up to 79 conditions per place. [2022-09-20 20:41:05,691 INFO L137 encePairwiseOnDemand]: 107/112 looper letters, 14 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2022-09-20 20:41:05,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 269 flow [2022-09-20 20:41:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 20:41:05,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 20:41:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2022-09-20 20:41:05,705 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9375 [2022-09-20 20:41:05,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2022-09-20 20:41:05,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2022-09-20 20:41:05,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:05,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2022-09-20 20:41:05,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:05,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:05,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:05,721 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 227 flow. Second operand 3 states and 315 transitions. [2022-09-20 20:41:05,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 269 flow [2022-09-20 20:41:05,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-20 20:41:05,728 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 220 flow [2022-09-20 20:41:05,729 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2022-09-20 20:41:05,732 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2022-09-20 20:41:05,732 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 220 flow [2022-09-20 20:41:05,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:05,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:05,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:05,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 20:41:05,733 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)] === [2022-09-20 20:41:05,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:05,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1218056957, now seen corresponding path program 1 times [2022-09-20 20:41:05,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:05,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666987102] [2022-09-20 20:41:05,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:05,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:05,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:05,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666987102] [2022-09-20 20:41:05,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666987102] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:05,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:05,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:41:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195380306] [2022-09-20 20:41:05,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:05,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:41:05,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:05,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:41:05,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:41:05,969 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-09-20 20:41:05,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:05,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:05,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-09-20 20:41:05,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:06,387 INFO L130 PetriNetUnfolder]: 834/2274 cut-off events. [2022-09-20 20:41:06,388 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-09-20 20:41:06,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3699 conditions, 2274 events. 834/2274 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 17106 event pairs, 193 based on Foata normal form. 0/2201 useless extension candidates. Maximal degree in co-relation 3649. Up to 732 conditions per place. [2022-09-20 20:41:06,396 INFO L137 encePairwiseOnDemand]: 105/112 looper letters, 23 selfloop transitions, 3 changer transitions 57/158 dead transitions. [2022-09-20 20:41:06,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 158 transitions, 488 flow [2022-09-20 20:41:06,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:41:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:41:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 875 transitions. [2022-09-20 20:41:06,399 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8680555555555556 [2022-09-20 20:41:06,399 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 875 transitions. [2022-09-20 20:41:06,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 875 transitions. [2022-09-20 20:41:06,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:06,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 875 transitions. [2022-09-20 20:41:06,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.22222222222223) internal successors, (875), 9 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:06,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:06,404 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:06,404 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 220 flow. Second operand 9 states and 875 transitions. [2022-09-20 20:41:06,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 158 transitions, 488 flow [2022-09-20 20:41:06,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 158 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 20:41:06,407 INFO L231 Difference]: Finished difference. Result has 127 places, 95 transitions, 235 flow [2022-09-20 20:41:06,407 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=127, PETRI_TRANSITIONS=95} [2022-09-20 20:41:06,408 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2022-09-20 20:41:06,408 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 95 transitions, 235 flow [2022-09-20 20:41:06,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:06,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:06,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:06,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 20:41:06,409 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)] === [2022-09-20 20:41:06,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:06,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2123130946, now seen corresponding path program 1 times [2022-09-20 20:41:06,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:06,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869883793] [2022-09-20 20:41:06,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:06,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:06,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869883793] [2022-09-20 20:41:06,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869883793] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:06,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:06,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:41:06,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150009967] [2022-09-20 20:41:06,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:06,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:41:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:06,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:41:06,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:41:06,603 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-09-20 20:41:06,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 95 transitions, 235 flow. Second operand has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:06,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:06,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-09-20 20:41:06,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:06,969 INFO L130 PetriNetUnfolder]: 477/1078 cut-off events. [2022-09-20 20:41:06,969 INFO L131 PetriNetUnfolder]: For 760/763 co-relation queries the response was YES. [2022-09-20 20:41:06,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 1078 events. 477/1078 cut-off events. For 760/763 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6383 event pairs, 129 based on Foata normal form. 30/1075 useless extension candidates. Maximal degree in co-relation 2373. Up to 418 conditions per place. [2022-09-20 20:41:06,974 INFO L137 encePairwiseOnDemand]: 100/112 looper letters, 21 selfloop transitions, 10 changer transitions 44/151 dead transitions. [2022-09-20 20:41:06,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 151 transitions, 533 flow [2022-09-20 20:41:06,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 20:41:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 20:41:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1398 transitions. [2022-09-20 20:41:06,977 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8321428571428572 [2022-09-20 20:41:06,977 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1398 transitions. [2022-09-20 20:41:06,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1398 transitions. [2022-09-20 20:41:06,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:06,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1398 transitions. [2022-09-20 20:41:06,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 93.2) internal successors, (1398), 15 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:06,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:06,983 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:06,983 INFO L175 Difference]: Start difference. First operand has 127 places, 95 transitions, 235 flow. Second operand 15 states and 1398 transitions. [2022-09-20 20:41:06,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 151 transitions, 533 flow [2022-09-20 20:41:06,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 151 transitions, 512 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-09-20 20:41:06,988 INFO L231 Difference]: Finished difference. Result has 130 places, 101 transitions, 310 flow [2022-09-20 20:41:06,988 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=310, PETRI_PLACES=130, PETRI_TRANSITIONS=101} [2022-09-20 20:41:06,989 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 13 predicate places. [2022-09-20 20:41:06,989 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 101 transitions, 310 flow [2022-09-20 20:41:06,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:06,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:06,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:06,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 20:41:06,990 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)] === [2022-09-20 20:41:06,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:06,990 INFO L85 PathProgramCache]: Analyzing trace with hash -271884843, now seen corresponding path program 1 times [2022-09-20 20:41:06,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:06,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257193333] [2022-09-20 20:41:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:06,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:07,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:07,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257193333] [2022-09-20 20:41:07,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257193333] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:07,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:07,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:41:07,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045842236] [2022-09-20 20:41:07,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:07,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:41:07,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:07,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:41:07,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:41:07,082 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-09-20 20:41:07,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 101 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:07,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:07,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-09-20 20:41:07,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:07,340 INFO L130 PetriNetUnfolder]: 387/912 cut-off events. [2022-09-20 20:41:07,340 INFO L131 PetriNetUnfolder]: For 2459/2477 co-relation queries the response was YES. [2022-09-20 20:41:07,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 912 events. 387/912 cut-off events. For 2459/2477 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5129 event pairs, 117 based on Foata normal form. 20/876 useless extension candidates. Maximal degree in co-relation 2853. Up to 397 conditions per place. [2022-09-20 20:41:07,347 INFO L137 encePairwiseOnDemand]: 106/112 looper letters, 26 selfloop transitions, 2 changer transitions 31/140 dead transitions. [2022-09-20 20:41:07,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 140 transitions, 683 flow [2022-09-20 20:41:07,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:41:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:41:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions. [2022-09-20 20:41:07,350 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8650793650793651 [2022-09-20 20:41:07,350 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 872 transitions. [2022-09-20 20:41:07,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 872 transitions. [2022-09-20 20:41:07,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:07,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 872 transitions. [2022-09-20 20:41:07,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:07,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:07,353 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:07,353 INFO L175 Difference]: Start difference. First operand has 130 places, 101 transitions, 310 flow. Second operand 9 states and 872 transitions. [2022-09-20 20:41:07,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 140 transitions, 683 flow [2022-09-20 20:41:07,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 140 transitions, 665 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-09-20 20:41:07,361 INFO L231 Difference]: Finished difference. Result has 131 places, 101 transitions, 320 flow [2022-09-20 20:41:07,361 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=320, PETRI_PLACES=131, PETRI_TRANSITIONS=101} [2022-09-20 20:41:07,362 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 14 predicate places. [2022-09-20 20:41:07,362 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 101 transitions, 320 flow [2022-09-20 20:41:07,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:07,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:07,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:07,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 20:41:07,370 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)] === [2022-09-20 20:41:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:07,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1908378922, now seen corresponding path program 1 times [2022-09-20 20:41:07,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:07,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280444737] [2022-09-20 20:41:07,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:07,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:07,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280444737] [2022-09-20 20:41:07,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280444737] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:07,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:07,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-09-20 20:41:07,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51154056] [2022-09-20 20:41:07,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:07,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-09-20 20:41:07,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:07,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-09-20 20:41:07,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-09-20 20:41:07,614 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 112 [2022-09-20 20:41:07,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 101 transitions, 320 flow. Second operand has 14 states, 14 states have (on average 86.28571428571429) internal successors, (1208), 14 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:07,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:07,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 112 [2022-09-20 20:41:07,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:07,956 INFO L130 PetriNetUnfolder]: 314/782 cut-off events. [2022-09-20 20:41:07,956 INFO L131 PetriNetUnfolder]: For 2608/2622 co-relation queries the response was YES. [2022-09-20 20:41:07,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 782 events. 314/782 cut-off events. For 2608/2622 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4125 event pairs, 100 based on Foata normal form. 23/772 useless extension candidates. Maximal degree in co-relation 2553. Up to 360 conditions per place. [2022-09-20 20:41:07,962 INFO L137 encePairwiseOnDemand]: 98/112 looper letters, 23 selfloop transitions, 15 changer transitions 35/146 dead transitions. [2022-09-20 20:41:07,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 146 transitions, 774 flow [2022-09-20 20:41:07,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-20 20:41:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-09-20 20:41:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1687 transitions. [2022-09-20 20:41:07,965 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7927631578947368 [2022-09-20 20:41:07,965 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1687 transitions. [2022-09-20 20:41:07,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1687 transitions. [2022-09-20 20:41:07,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:07,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1687 transitions. [2022-09-20 20:41:07,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 88.78947368421052) internal successors, (1687), 19 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:07,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 112.0) internal successors, (2240), 20 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:07,971 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 112.0) internal successors, (2240), 20 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:07,971 INFO L175 Difference]: Start difference. First operand has 131 places, 101 transitions, 320 flow. Second operand 19 states and 1687 transitions. [2022-09-20 20:41:07,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 146 transitions, 774 flow [2022-09-20 20:41:07,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 146 transitions, 734 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-09-20 20:41:07,976 INFO L231 Difference]: Finished difference. Result has 146 places, 105 transitions, 413 flow [2022-09-20 20:41:07,977 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=413, PETRI_PLACES=146, PETRI_TRANSITIONS=105} [2022-09-20 20:41:07,977 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2022-09-20 20:41:07,977 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 105 transitions, 413 flow [2022-09-20 20:41:07,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.28571428571429) internal successors, (1208), 14 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:07,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:07,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:07,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 20:41:07,978 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)] === [2022-09-20 20:41:07,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:07,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1734892530, now seen corresponding path program 1 times [2022-09-20 20:41:07,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:07,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130621640] [2022-09-20 20:41:07,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:07,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:08,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:08,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130621640] [2022-09-20 20:41:08,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130621640] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:08,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:08,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:41:08,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053678208] [2022-09-20 20:41:08,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:08,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:41:08,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:08,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:41:08,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:41:08,102 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-09-20 20:41:08,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 105 transitions, 413 flow. Second operand has 8 states, 8 states have (on average 90.75) internal successors, (726), 8 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:08,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:08,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-09-20 20:41:08,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:08,483 INFO L130 PetriNetUnfolder]: 355/844 cut-off events. [2022-09-20 20:41:08,483 INFO L131 PetriNetUnfolder]: For 5685/5699 co-relation queries the response was YES. [2022-09-20 20:41:08,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3491 conditions, 844 events. 355/844 cut-off events. For 5685/5699 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4360 event pairs, 99 based on Foata normal form. 20/828 useless extension candidates. Maximal degree in co-relation 3404. Up to 328 conditions per place. [2022-09-20 20:41:08,506 INFO L137 encePairwiseOnDemand]: 101/112 looper letters, 31 selfloop transitions, 11 changer transitions 25/144 dead transitions. [2022-09-20 20:41:08,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 865 flow [2022-09-20 20:41:08,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 20:41:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 20:41:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1039 transitions. [2022-09-20 20:41:08,521 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8433441558441559 [2022-09-20 20:41:08,521 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1039 transitions. [2022-09-20 20:41:08,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1039 transitions. [2022-09-20 20:41:08,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:08,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1039 transitions. [2022-09-20 20:41:08,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.45454545454545) internal successors, (1039), 11 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:08,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:08,525 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:08,525 INFO L175 Difference]: Start difference. First operand has 146 places, 105 transitions, 413 flow. Second operand 11 states and 1039 transitions. [2022-09-20 20:41:08,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 865 flow [2022-09-20 20:41:08,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 144 transitions, 727 flow, removed 63 selfloop flow, removed 15 redundant places. [2022-09-20 20:41:08,531 INFO L231 Difference]: Finished difference. Result has 139 places, 109 transitions, 427 flow [2022-09-20 20:41:08,532 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=427, PETRI_PLACES=139, PETRI_TRANSITIONS=109} [2022-09-20 20:41:08,532 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 22 predicate places. [2022-09-20 20:41:08,532 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 109 transitions, 427 flow [2022-09-20 20:41:08,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.75) internal successors, (726), 8 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:08,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:08,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:08,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 20:41:08,533 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)] === [2022-09-20 20:41:08,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:08,533 INFO L85 PathProgramCache]: Analyzing trace with hash 863196512, now seen corresponding path program 2 times [2022-09-20 20:41:08,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:08,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852111702] [2022-09-20 20:41:08,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:08,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:08,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:08,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852111702] [2022-09-20 20:41:08,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852111702] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:08,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:08,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:41:08,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471249408] [2022-09-20 20:41:08,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:08,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:41:08,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:08,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:41:08,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:41:08,680 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-09-20 20:41:08,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 109 transitions, 427 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:08,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:08,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-09-20 20:41:08,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:09,039 INFO L130 PetriNetUnfolder]: 630/1357 cut-off events. [2022-09-20 20:41:09,039 INFO L131 PetriNetUnfolder]: For 6257/7425 co-relation queries the response was YES. [2022-09-20 20:41:09,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5486 conditions, 1357 events. 630/1357 cut-off events. For 6257/7425 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7976 event pairs, 72 based on Foata normal form. 37/1315 useless extension candidates. Maximal degree in co-relation 5405. Up to 463 conditions per place. [2022-09-20 20:41:09,048 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 40 selfloop transitions, 5 changer transitions 35/158 dead transitions. [2022-09-20 20:41:09,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 158 transitions, 1006 flow [2022-09-20 20:41:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 20:41:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 20:41:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2022-09-20 20:41:09,050 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8584183673469388 [2022-09-20 20:41:09,050 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 673 transitions. [2022-09-20 20:41:09,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 673 transitions. [2022-09-20 20:41:09,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:09,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 673 transitions. [2022-09-20 20:41:09,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:09,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:09,052 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:09,052 INFO L175 Difference]: Start difference. First operand has 139 places, 109 transitions, 427 flow. Second operand 7 states and 673 transitions. [2022-09-20 20:41:09,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 158 transitions, 1006 flow [2022-09-20 20:41:09,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 158 transitions, 935 flow, removed 27 selfloop flow, removed 8 redundant places. [2022-09-20 20:41:09,065 INFO L231 Difference]: Finished difference. Result has 135 places, 109 transitions, 419 flow [2022-09-20 20:41:09,065 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=419, PETRI_PLACES=135, PETRI_TRANSITIONS=109} [2022-09-20 20:41:09,065 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 18 predicate places. [2022-09-20 20:41:09,065 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 109 transitions, 419 flow [2022-09-20 20:41:09,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:09,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:09,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:09,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 20:41:09,066 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)] === [2022-09-20 20:41:09,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1674736738, now seen corresponding path program 3 times [2022-09-20 20:41:09,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:09,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288100490] [2022-09-20 20:41:09,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:09,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:09,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288100490] [2022-09-20 20:41:09,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288100490] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:09,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:09,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:41:09,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040294487] [2022-09-20 20:41:09,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:09,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:41:09,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:09,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:41:09,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:41:09,178 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-09-20 20:41:09,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 109 transitions, 419 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:09,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:09,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-09-20 20:41:09,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:09,489 INFO L130 PetriNetUnfolder]: 302/765 cut-off events. [2022-09-20 20:41:09,489 INFO L131 PetriNetUnfolder]: For 3013/3199 co-relation queries the response was YES. [2022-09-20 20:41:09,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 765 events. 302/765 cut-off events. For 3013/3199 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3818 event pairs, 113 based on Foata normal form. 18/741 useless extension candidates. Maximal degree in co-relation 2738. Up to 293 conditions per place. [2022-09-20 20:41:09,511 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 30 selfloop transitions, 9 changer transitions 25/140 dead transitions. [2022-09-20 20:41:09,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 770 flow [2022-09-20 20:41:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 20:41:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 20:41:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1111 transitions. [2022-09-20 20:41:09,525 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8266369047619048 [2022-09-20 20:41:09,525 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1111 transitions. [2022-09-20 20:41:09,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1111 transitions. [2022-09-20 20:41:09,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:09,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1111 transitions. [2022-09-20 20:41:09,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.58333333333333) internal successors, (1111), 12 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:09,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:09,529 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:09,529 INFO L175 Difference]: Start difference. First operand has 135 places, 109 transitions, 419 flow. Second operand 12 states and 1111 transitions. [2022-09-20 20:41:09,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 770 flow [2022-09-20 20:41:09,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 140 transitions, 734 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-09-20 20:41:09,534 INFO L231 Difference]: Finished difference. Result has 144 places, 109 transitions, 435 flow [2022-09-20 20:41:09,534 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=435, PETRI_PLACES=144, PETRI_TRANSITIONS=109} [2022-09-20 20:41:09,534 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 27 predicate places. [2022-09-20 20:41:09,535 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 109 transitions, 435 flow [2022-09-20 20:41:09,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:09,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:09,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:09,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 20:41:09,535 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)] === [2022-09-20 20:41:09,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1531004485, now seen corresponding path program 1 times [2022-09-20 20:41:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:09,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696372262] [2022-09-20 20:41:09,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:09,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:09,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:09,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696372262] [2022-09-20 20:41:09,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696372262] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:09,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:09,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:41:09,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594142566] [2022-09-20 20:41:09,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:09,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:41:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:09,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:41:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:41:09,671 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-09-20 20:41:09,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 109 transitions, 435 flow. Second operand has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:09,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:09,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-09-20 20:41:09,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:10,090 INFO L130 PetriNetUnfolder]: 632/1494 cut-off events. [2022-09-20 20:41:10,090 INFO L131 PetriNetUnfolder]: For 6452/7001 co-relation queries the response was YES. [2022-09-20 20:41:10,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5656 conditions, 1494 events. 632/1494 cut-off events. For 6452/7001 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9378 event pairs, 123 based on Foata normal form. 41/1443 useless extension candidates. Maximal degree in co-relation 5571. Up to 497 conditions per place. [2022-09-20 20:41:10,101 INFO L137 encePairwiseOnDemand]: 105/112 looper letters, 39 selfloop transitions, 3 changer transitions 60/180 dead transitions. [2022-09-20 20:41:10,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 180 transitions, 1197 flow [2022-09-20 20:41:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 20:41:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 20:41:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1317 transitions. [2022-09-20 20:41:10,104 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8399234693877551 [2022-09-20 20:41:10,104 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1317 transitions. [2022-09-20 20:41:10,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1317 transitions. [2022-09-20 20:41:10,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:10,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1317 transitions. [2022-09-20 20:41:10,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 94.07142857142857) internal successors, (1317), 14 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:10,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:10,108 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:10,108 INFO L175 Difference]: Start difference. First operand has 144 places, 109 transitions, 435 flow. Second operand 14 states and 1317 transitions. [2022-09-20 20:41:10,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 180 transitions, 1197 flow [2022-09-20 20:41:10,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 180 transitions, 1093 flow, removed 45 selfloop flow, removed 13 redundant places. [2022-09-20 20:41:10,117 INFO L231 Difference]: Finished difference. Result has 150 places, 109 transitions, 428 flow [2022-09-20 20:41:10,118 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=428, PETRI_PLACES=150, PETRI_TRANSITIONS=109} [2022-09-20 20:41:10,118 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 33 predicate places. [2022-09-20 20:41:10,118 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 109 transitions, 428 flow [2022-09-20 20:41:10,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:10,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:10,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:10,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 20:41:10,119 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)] === [2022-09-20 20:41:10,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1700060686, now seen corresponding path program 1 times [2022-09-20 20:41:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:10,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968422187] [2022-09-20 20:41:10,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:10,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:10,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:10,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968422187] [2022-09-20 20:41:10,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968422187] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:10,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:10,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:41:10,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290868866] [2022-09-20 20:41:10,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:10,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:41:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:10,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:41:10,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:41:10,231 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-09-20 20:41:10,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 109 transitions, 428 flow. Second operand has 8 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:10,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:10,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-09-20 20:41:10,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:10,487 INFO L130 PetriNetUnfolder]: 351/992 cut-off events. [2022-09-20 20:41:10,487 INFO L131 PetriNetUnfolder]: For 4663/5113 co-relation queries the response was YES. [2022-09-20 20:41:10,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3623 conditions, 992 events. 351/992 cut-off events. For 4663/5113 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6165 event pairs, 97 based on Foata normal form. 27/963 useless extension candidates. Maximal degree in co-relation 3537. Up to 353 conditions per place. [2022-09-20 20:41:10,494 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 29 selfloop transitions, 12 changer transitions 25/143 dead transitions. [2022-09-20 20:41:10,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 143 transitions, 837 flow [2022-09-20 20:41:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 20:41:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 20:41:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1033 transitions. [2022-09-20 20:41:10,496 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.838474025974026 [2022-09-20 20:41:10,496 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1033 transitions. [2022-09-20 20:41:10,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1033 transitions. [2022-09-20 20:41:10,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:10,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1033 transitions. [2022-09-20 20:41:10,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.9090909090909) internal successors, (1033), 11 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:10,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:10,500 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:10,500 INFO L175 Difference]: Start difference. First operand has 150 places, 109 transitions, 428 flow. Second operand 11 states and 1033 transitions. [2022-09-20 20:41:10,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 143 transitions, 837 flow [2022-09-20 20:41:10,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 143 transitions, 760 flow, removed 37 selfloop flow, removed 12 redundant places. [2022-09-20 20:41:10,506 INFO L231 Difference]: Finished difference. Result has 144 places, 112 transitions, 491 flow [2022-09-20 20:41:10,507 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=491, PETRI_PLACES=144, PETRI_TRANSITIONS=112} [2022-09-20 20:41:10,507 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 27 predicate places. [2022-09-20 20:41:10,507 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 112 transitions, 491 flow [2022-09-20 20:41:10,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:10,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:10,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:10,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 20:41:10,508 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)] === [2022-09-20 20:41:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1297160514, now seen corresponding path program 1 times [2022-09-20 20:41:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:10,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133622184] [2022-09-20 20:41:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:10,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:10,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:10,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133622184] [2022-09-20 20:41:10,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133622184] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:10,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:10,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:41:10,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729205574] [2022-09-20 20:41:10,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:10,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:41:10,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:10,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:41:10,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:41:10,569 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-09-20 20:41:10,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 112 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:10,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:10,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-09-20 20:41:10,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:11,147 INFO L130 PetriNetUnfolder]: 1954/3776 cut-off events. [2022-09-20 20:41:11,147 INFO L131 PetriNetUnfolder]: For 24431/24780 co-relation queries the response was YES. [2022-09-20 20:41:11,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14517 conditions, 3776 events. 1954/3776 cut-off events. For 24431/24780 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 26585 event pairs, 77 based on Foata normal form. 235/3881 useless extension candidates. Maximal degree in co-relation 14435. Up to 1149 conditions per place. [2022-09-20 20:41:11,167 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 56 selfloop transitions, 6 changer transitions 90/231 dead transitions. [2022-09-20 20:41:11,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 231 transitions, 1721 flow [2022-09-20 20:41:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:41:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:41:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2022-09-20 20:41:11,169 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2022-09-20 20:41:11,169 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2022-09-20 20:41:11,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2022-09-20 20:41:11,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:11,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2022-09-20 20:41:11,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,172 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,172 INFO L175 Difference]: Start difference. First operand has 144 places, 112 transitions, 491 flow. Second operand 10 states and 962 transitions. [2022-09-20 20:41:11,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 231 transitions, 1721 flow [2022-09-20 20:41:11,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 231 transitions, 1623 flow, removed 27 selfloop flow, removed 6 redundant places. [2022-09-20 20:41:11,184 INFO L231 Difference]: Finished difference. Result has 147 places, 114 transitions, 519 flow [2022-09-20 20:41:11,185 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=519, PETRI_PLACES=147, PETRI_TRANSITIONS=114} [2022-09-20 20:41:11,185 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 30 predicate places. [2022-09-20 20:41:11,185 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 114 transitions, 519 flow [2022-09-20 20:41:11,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:11,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:11,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 20:41:11,186 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:41:11,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:11,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2142872252, now seen corresponding path program 1 times [2022-09-20 20:41:11,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:11,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484629815] [2022-09-20 20:41:11,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:11,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:11,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:11,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484629815] [2022-09-20 20:41:11,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484629815] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:11,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:11,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:41:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8087128] [2022-09-20 20:41:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:11,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:41:11,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:41:11,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:41:11,255 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-09-20 20:41:11,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 114 transitions, 519 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:11,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-09-20 20:41:11,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:11,542 INFO L130 PetriNetUnfolder]: 638/1562 cut-off events. [2022-09-20 20:41:11,542 INFO L131 PetriNetUnfolder]: For 9785/9911 co-relation queries the response was YES. [2022-09-20 20:41:11,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6476 conditions, 1562 events. 638/1562 cut-off events. For 9785/9911 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10362 event pairs, 19 based on Foata normal form. 138/1679 useless extension candidates. Maximal degree in co-relation 6391. Up to 381 conditions per place. [2022-09-20 20:41:11,553 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 55 selfloop transitions, 9 changer transitions 51/194 dead transitions. [2022-09-20 20:41:11,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 194 transitions, 1467 flow [2022-09-20 20:41:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:41:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:41:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 960 transitions. [2022-09-20 20:41:11,555 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-09-20 20:41:11,555 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 960 transitions. [2022-09-20 20:41:11,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 960 transitions. [2022-09-20 20:41:11,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:11,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 960 transitions. [2022-09-20 20:41:11,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,557 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,558 INFO L175 Difference]: Start difference. First operand has 147 places, 114 transitions, 519 flow. Second operand 10 states and 960 transitions. [2022-09-20 20:41:11,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 194 transitions, 1467 flow [2022-09-20 20:41:11,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 194 transitions, 1431 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-09-20 20:41:11,567 INFO L231 Difference]: Finished difference. Result has 150 places, 116 transitions, 573 flow [2022-09-20 20:41:11,567 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=573, PETRI_PLACES=150, PETRI_TRANSITIONS=116} [2022-09-20 20:41:11,567 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 33 predicate places. [2022-09-20 20:41:11,567 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 116 transitions, 573 flow [2022-09-20 20:41:11,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:11,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:11,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 20:41:11,568 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:41:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:11,568 INFO L85 PathProgramCache]: Analyzing trace with hash 903364591, now seen corresponding path program 1 times [2022-09-20 20:41:11,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:11,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847099811] [2022-09-20 20:41:11,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:11,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:11,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:11,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847099811] [2022-09-20 20:41:11,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847099811] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:11,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:11,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:41:11,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886075182] [2022-09-20 20:41:11,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:11,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:41:11,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:11,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:41:11,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:41:11,642 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-09-20 20:41:11,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 116 transitions, 573 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:11,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-09-20 20:41:11,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:11,898 INFO L130 PetriNetUnfolder]: 201/664 cut-off events. [2022-09-20 20:41:11,898 INFO L131 PetriNetUnfolder]: For 3692/3725 co-relation queries the response was YES. [2022-09-20 20:41:11,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 664 events. 201/664 cut-off events. For 3692/3725 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3657 event pairs, 14 based on Foata normal form. 29/680 useless extension candidates. Maximal degree in co-relation 2644. Up to 137 conditions per place. [2022-09-20 20:41:11,902 INFO L137 encePairwiseOnDemand]: 103/112 looper letters, 33 selfloop transitions, 12 changer transitions 36/158 dead transitions. [2022-09-20 20:41:11,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 158 transitions, 1141 flow [2022-09-20 20:41:11,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 20:41:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 20:41:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1027 transitions. [2022-09-20 20:41:11,903 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8336038961038961 [2022-09-20 20:41:11,904 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1027 transitions. [2022-09-20 20:41:11,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1027 transitions. [2022-09-20 20:41:11,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:11,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1027 transitions. [2022-09-20 20:41:11,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.36363636363636) internal successors, (1027), 11 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,908 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,908 INFO L175 Difference]: Start difference. First operand has 150 places, 116 transitions, 573 flow. Second operand 11 states and 1027 transitions. [2022-09-20 20:41:11,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 158 transitions, 1141 flow [2022-09-20 20:41:11,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 158 transitions, 953 flow, removed 79 selfloop flow, removed 17 redundant places. [2022-09-20 20:41:11,915 INFO L231 Difference]: Finished difference. Result has 145 places, 108 transitions, 444 flow [2022-09-20 20:41:11,915 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=444, PETRI_PLACES=145, PETRI_TRANSITIONS=108} [2022-09-20 20:41:11,916 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 28 predicate places. [2022-09-20 20:41:11,916 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 108 transitions, 444 flow [2022-09-20 20:41:11,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:11,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:11,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:11,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 20:41:11,917 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:41:11,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1837034471, now seen corresponding path program 1 times [2022-09-20 20:41:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:11,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280624793] [2022-09-20 20:41:11,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:41:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:41:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:41:12,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280624793] [2022-09-20 20:41:12,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280624793] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:41:12,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:41:12,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-09-20 20:41:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978824895] [2022-09-20 20:41:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:41:12,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-09-20 20:41:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:41:12,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-09-20 20:41:12,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-09-20 20:41:12,167 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 112 [2022-09-20 20:41:12,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 108 transitions, 444 flow. Second operand has 15 states, 15 states have (on average 83.66666666666667) internal successors, (1255), 15 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:12,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:41:12,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 112 [2022-09-20 20:41:12,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:41:12,354 INFO L130 PetriNetUnfolder]: 63/418 cut-off events. [2022-09-20 20:41:12,354 INFO L131 PetriNetUnfolder]: For 845/894 co-relation queries the response was YES. [2022-09-20 20:41:12,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 418 events. 63/418 cut-off events. For 845/894 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2194 event pairs, 7 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 1154. Up to 63 conditions per place. [2022-09-20 20:41:12,357 INFO L137 encePairwiseOnDemand]: 100/112 looper letters, 24 selfloop transitions, 10 changer transitions 9/117 dead transitions. [2022-09-20 20:41:12,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 117 transitions, 574 flow [2022-09-20 20:41:12,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 20:41:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 20:41:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1020 transitions. [2022-09-20 20:41:12,358 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7589285714285714 [2022-09-20 20:41:12,358 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1020 transitions. [2022-09-20 20:41:12,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1020 transitions. [2022-09-20 20:41:12,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:41:12,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1020 transitions. [2022-09-20 20:41:12,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:12,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:12,362 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:12,362 INFO L175 Difference]: Start difference. First operand has 145 places, 108 transitions, 444 flow. Second operand 12 states and 1020 transitions. [2022-09-20 20:41:12,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 117 transitions, 574 flow [2022-09-20 20:41:12,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 117 transitions, 442 flow, removed 43 selfloop flow, removed 23 redundant places. [2022-09-20 20:41:12,365 INFO L231 Difference]: Finished difference. Result has 131 places, 104 transitions, 331 flow [2022-09-20 20:41:12,366 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=331, PETRI_PLACES=131, PETRI_TRANSITIONS=104} [2022-09-20 20:41:12,366 INFO L287 CegarLoopForPetriNet]: 117 programPoint places, 14 predicate places. [2022-09-20 20:41:12,366 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 104 transitions, 331 flow [2022-09-20 20:41:12,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 83.66666666666667) internal successors, (1255), 15 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:41:12,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:41:12,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:12,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-20 20:41:12,367 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:41:12,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:41:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 468578735, now seen corresponding path program 2 times [2022-09-20 20:41:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:41:12,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290299898] [2022-09-20 20:41:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:41:12,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:41:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:41:12,414 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 20:41:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:41:12,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 20:41:12,480 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 20:41:12,481 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-09-20 20:41:12,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-09-20 20:41:12,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-09-20 20:41:12,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-09-20 20:41:12,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-09-20 20:41:12,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-09-20 20:41:12,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-20 20:41:12,483 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:41:12,488 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 20:41:12,488 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 20:41:12,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 08:41:12 BasicIcfg [2022-09-20 20:41:12,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 20:41:12,580 INFO L158 Benchmark]: Toolchain (without parser) took 9137.42ms. Allocated memory was 194.0MB in the beginning and 386.9MB in the end (delta: 192.9MB). Free memory was 164.4MB in the beginning and 105.7MB in the end (delta: 58.7MB). Peak memory consumption was 251.4MB. Max. memory is 8.0GB. [2022-09-20 20:41:12,581 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 194.0MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 20:41:12,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.77ms. Allocated memory is still 194.0MB. Free memory was 164.2MB in the beginning and 154.1MB in the end (delta: 10.1MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-09-20 20:41:12,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.13ms. Allocated memory is still 194.0MB. Free memory was 154.1MB in the beginning and 151.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-20 20:41:12,581 INFO L158 Benchmark]: Boogie Preprocessor took 49.38ms. Allocated memory is still 194.0MB. Free memory was 151.0MB in the beginning and 148.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 20:41:12,581 INFO L158 Benchmark]: RCFGBuilder took 1087.07ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 148.6MB in the beginning and 173.7MB in the end (delta: -25.1MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2022-09-20 20:41:12,582 INFO L158 Benchmark]: TraceAbstraction took 7484.67ms. Allocated memory was 232.8MB in the beginning and 386.9MB in the end (delta: 154.1MB). Free memory was 173.2MB in the beginning and 105.7MB in the end (delta: 67.5MB). Peak memory consumption was 222.7MB. Max. memory is 8.0GB. [2022-09-20 20:41:12,583 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.16ms. Allocated memory is still 194.0MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 445.77ms. Allocated memory is still 194.0MB. Free memory was 164.2MB in the beginning and 154.1MB in the end (delta: 10.1MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.13ms. Allocated memory is still 194.0MB. Free memory was 154.1MB in the beginning and 151.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.38ms. Allocated memory is still 194.0MB. Free memory was 151.0MB in the beginning and 148.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1087.07ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 148.6MB in the beginning and 173.7MB in the end (delta: -25.1MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7484.67ms. Allocated memory was 232.8MB in the beginning and 386.9MB in the end (delta: 154.1MB). Free memory was 173.2MB in the beginning and 105.7MB in the end (delta: 67.5MB). Peak memory consumption was 222.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 0 pthread_t t2177; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-2, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2178; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=-1, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2179; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=66, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 816]: 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: 818]: 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: 814]: 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, 138 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: 7.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 710 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 710 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1062 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1735 IncrementalHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 122 mSDtfsCounter, 1735 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=573occurred in iteration=12, InterpolantAutomatonStates: 153, 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, 1.4s InterpolantComputationTime, 1145 NumberOfCodeBlocks, 1145 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1045 ConstructedInterpolants, 0 QuantifiedInterpolants, 5786 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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! [2022-09-20 20:41:12,618 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...