/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 05:01:03,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 05:01:03,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 05:01:03,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 05:01:03,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 05:01:03,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 05:01:03,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 05:01:03,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 05:01:03,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 05:01:03,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 05:01:03,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 05:01:03,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 05:01:03,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 05:01:03,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 05:01:03,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 05:01:03,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 05:01:03,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 05:01:03,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 05:01:03,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 05:01:03,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 05:01:03,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 05:01:03,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 05:01:03,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 05:01:03,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 05:01:03,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 05:01:03,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 05:01:03,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 05:01:03,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 05:01:03,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 05:01:03,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 05:01:03,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 05:01:03,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 05:01:03,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 05:01:03,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 05:01:03,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 05:01:03,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 05:01:03,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 05:01:03,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 05:01:03,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 05:01:03,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 05:01:03,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 05:01:03,095 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-Before.epf [2022-01-19 05:01:03,110 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 05:01:03,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 05:01:03,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 05:01:03,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 05:01:03,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 05:01:03,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 05:01:03,111 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 05:01:03,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 05:01:03,111 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 05:01:03,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 05:01:03,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 05:01:03,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 05:01:03,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 05:01:03,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 05:01:03,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 05:01:03,112 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 05:01:03,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 05:01:03,112 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 05:01:03,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 05:01:03,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 05:01:03,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 05:01:03,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 05:01:03,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 05:01:03,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 05:01:03,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 05:01:03,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 05:01:03,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 05:01:03,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 05:01:03,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 05:01:03,113 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 05:01:03,113 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 05:01:03,113 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 05:01:03,114 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-01-19 05:01:03,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 05:01:03,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 05:01:03,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 05:01:03,307 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 05:01:03,315 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 05:01:03,317 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-01-19 05:01:03,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190d50b64/97f31427ad904a4ca59df7176e9741b6/FLAGa3e6a4d4b [2022-01-19 05:01:03,826 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 05:01:03,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-01-19 05:01:03,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190d50b64/97f31427ad904a4ca59df7176e9741b6/FLAGa3e6a4d4b [2022-01-19 05:01:03,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190d50b64/97f31427ad904a4ca59df7176e9741b6 [2022-01-19 05:01:03,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 05:01:03,865 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 05:01:03,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 05:01:03,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 05:01:03,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 05:01:03,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 05:01:03" (1/1) ... [2022-01-19 05:01:03,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c4a848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:03, skipping insertion in model container [2022-01-19 05:01:03,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 05:01:03" (1/1) ... [2022-01-19 05:01:03,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 05:01:03,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 05:01:04,068 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-01-19 05:01:04,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 05:01:04,234 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 05:01:04,245 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-01-19 05:01:04,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 05:01:04,332 INFO L208 MainTranslator]: Completed translation [2022-01-19 05:01:04,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:04 WrapperNode [2022-01-19 05:01:04,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 05:01:04,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 05:01:04,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 05:01:04,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 05:01:04,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:04" (1/1) ... [2022-01-19 05:01:04,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:04" (1/1) ... [2022-01-19 05:01:04,389 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-01-19 05:01:04,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 05:01:04,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 05:01:04,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 05:01:04,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 05:01:04,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:04" (1/1) ... [2022-01-19 05:01:04,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:04" (1/1) ... [2022-01-19 05:01:04,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:04" (1/1) ... [2022-01-19 05:01:04,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:04" (1/1) ... [2022-01-19 05:01:04,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:04" (1/1) ... [2022-01-19 05:01:04,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:04" (1/1) ... [2022-01-19 05:01:04,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:04" (1/1) ... [2022-01-19 05:01:04,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 05:01:04,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 05:01:04,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 05:01:04,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 05:01:04,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:04" (1/1) ... [2022-01-19 05:01:04,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 05:01:04,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:01:04,472 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-01-19 05:01:04,480 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-01-19 05:01:04,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 05:01:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 05:01:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 05:01:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 05:01:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 05:01:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 05:01:04,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 05:01:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 05:01:04,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 05:01:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 05:01:04,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 05:01:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 05:01:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 05:01:04,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 05:01:04,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 05:01:04,506 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 05:01:04,587 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 05:01:04,588 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 05:01:04,907 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 05:01:05,099 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 05:01:05,100 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 05:01:05,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 05:01:05 BoogieIcfgContainer [2022-01-19 05:01:05,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 05:01:05,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 05:01:05,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 05:01:05,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 05:01:05,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 05:01:03" (1/3) ... [2022-01-19 05:01:05,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bf503b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 05:01:05, skipping insertion in model container [2022-01-19 05:01:05,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:01:04" (2/3) ... [2022-01-19 05:01:05,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bf503b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 05:01:05, skipping insertion in model container [2022-01-19 05:01:05,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 05:01:05" (3/3) ... [2022-01-19 05:01:05,110 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2022-01-19 05:01:05,114 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 05:01:05,114 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 05:01:05,114 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 05:01:05,147 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,147 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,147 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,147 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,147 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,148 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,148 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,148 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,148 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,148 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,148 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,148 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,149 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,149 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,149 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,149 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,150 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,150 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,150 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,150 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,150 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,150 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,151 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,151 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,151 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,151 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,151 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,155 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,155 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,155 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,155 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,159 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,159 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,159 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,159 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,162 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,162 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,162 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,163 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,163 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,164 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,165 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,165 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,165 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,165 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,165 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,165 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,166 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,166 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,168 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,171 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,171 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,172 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,172 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,172 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,172 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:01:05,172 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 05:01:05,207 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 05:01:05,212 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 05:01:05,212 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 05:01:05,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-01-19 05:01:05,263 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2022-01-19 05:01:05,263 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:01:05,266 INFO L84 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 49 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-01-19 05:01:05,266 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-01-19 05:01:05,269 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-01-19 05:01:05,287 INFO L129 PetriNetUnfolder]: 0/72 cut-off events. [2022-01-19 05:01:05,287 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:01:05,287 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:05,288 INFO L254 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] [2022-01-19 05:01:05,288 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:05,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2040665683, now seen corresponding path program 1 times [2022-01-19 05:01:05,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:05,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453490843] [2022-01-19 05:01:05,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:05,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:05,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:05,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453490843] [2022-01-19 05:01:05,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453490843] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:05,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:05,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 05:01:05,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239138502] [2022-01-19 05:01:05,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:05,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 05:01:05,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:05,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 05:01:05,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 05:01:05,599 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 112 [2022-01-19 05:01:05,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-01-19 05:01:05,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:05,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 112 [2022-01-19 05:01:05,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:05,711 INFO L129 PetriNetUnfolder]: 17/241 cut-off events. [2022-01-19 05:01:05,712 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 05:01:05,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 241 events. 17/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 751 event pairs, 7 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2022-01-19 05:01:05,715 INFO L132 encePairwiseOnDemand]: 107/112 looper letters, 10 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2022-01-19 05:01:05,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 108 transitions, 249 flow [2022-01-19 05:01:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 05:01:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 05:01:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-01-19 05:01:05,729 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9345238095238095 [2022-01-19 05:01:05,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-01-19 05:01:05,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-01-19 05:01:05,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:05,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-01-19 05:01:05,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-01-19 05:01:05,748 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-01-19 05:01:05,748 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-01-19 05:01:05,750 INFO L186 Difference]: Start difference. First operand has 117 places, 109 transitions, 227 flow. Second operand 3 states and 314 transitions. [2022-01-19 05:01:05,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 108 transitions, 249 flow [2022-01-19 05:01:05,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 108 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 05:01:05,758 INFO L242 Difference]: Finished difference. Result has 114 places, 105 transitions, 220 flow [2022-01-19 05:01:05,760 INFO L317 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-01-19 05:01:05,763 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2022-01-19 05:01:05,763 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 220 flow [2022-01-19 05:01:05,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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-01-19 05:01:05,764 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:05,764 INFO L254 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-01-19 05:01:05,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 05:01:05,764 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash -690634123, now seen corresponding path program 1 times [2022-01-19 05:01:05,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:05,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638193965] [2022-01-19 05:01:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:05,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:06,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:06,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638193965] [2022-01-19 05:01:06,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638193965] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:06,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:06,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 05:01:06,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958364735] [2022-01-19 05:01:06,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:06,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 05:01:06,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:06,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 05:01:06,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 05:01:06,023 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-01-19 05:01:06,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 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-01-19 05:01:06,023 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:06,023 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-01-19 05:01:06,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:06,345 INFO L129 PetriNetUnfolder]: 282/963 cut-off events. [2022-01-19 05:01:06,345 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-01-19 05:01:06,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 963 events. 282/963 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6343 event pairs, 42 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 1445. Up to 249 conditions per place. [2022-01-19 05:01:06,352 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 20 selfloop transitions, 3 changer transitions 48/148 dead transitions. [2022-01-19 05:01:06,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 148 transitions, 444 flow [2022-01-19 05:01:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 05:01:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 05:01:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2022-01-19 05:01:06,356 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8740079365079365 [2022-01-19 05:01:06,356 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2022-01-19 05:01:06,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2022-01-19 05:01:06,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:06,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2022-01-19 05:01:06,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:06,361 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-01-19 05:01:06,361 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-01-19 05:01:06,361 INFO L186 Difference]: Start difference. First operand has 114 places, 105 transitions, 220 flow. Second operand 9 states and 881 transitions. [2022-01-19 05:01:06,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 148 transitions, 444 flow [2022-01-19 05:01:06,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 148 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 05:01:06,366 INFO L242 Difference]: Finished difference. Result has 127 places, 95 transitions, 235 flow [2022-01-19 05:01:06,366 INFO L317 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-01-19 05:01:06,367 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2022-01-19 05:01:06,367 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 95 transitions, 235 flow [2022-01-19 05:01:06,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 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-01-19 05:01:06,367 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:06,367 INFO L254 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-01-19 05:01:06,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 05:01:06,368 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:06,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:06,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1140221050, now seen corresponding path program 1 times [2022-01-19 05:01:06,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:06,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596602552] [2022-01-19 05:01:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:06,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:06,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:06,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596602552] [2022-01-19 05:01:06,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596602552] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:06,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:06,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 05:01:06,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218045750] [2022-01-19 05:01:06,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:06,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 05:01:06,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:06,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 05:01:06,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 05:01:06,521 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-01-19 05:01:06,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 95 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 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-01-19 05:01:06,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:06,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-01-19 05:01:06,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:06,774 INFO L129 PetriNetUnfolder]: 466/1063 cut-off events. [2022-01-19 05:01:06,774 INFO L130 PetriNetUnfolder]: For 760/760 co-relation queries the response was YES. [2022-01-19 05:01:06,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 1063 events. 466/1063 cut-off events. For 760/760 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6122 event pairs, 202 based on Foata normal form. 30/1068 useless extension candidates. Maximal degree in co-relation 2339. Up to 393 conditions per place. [2022-01-19 05:01:06,784 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 20 selfloop transitions, 3 changer transitions 34/136 dead transitions. [2022-01-19 05:01:06,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 136 transitions, 453 flow [2022-01-19 05:01:06,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 05:01:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 05:01:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 878 transitions. [2022-01-19 05:01:06,786 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.871031746031746 [2022-01-19 05:01:06,786 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 878 transitions. [2022-01-19 05:01:06,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 878 transitions. [2022-01-19 05:01:06,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:06,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 878 transitions. [2022-01-19 05:01:06,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 0 states have call successors, (0), 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-01-19 05:01:06,790 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-01-19 05:01:06,790 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-01-19 05:01:06,791 INFO L186 Difference]: Start difference. First operand has 127 places, 95 transitions, 235 flow. Second operand 9 states and 878 transitions. [2022-01-19 05:01:06,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 136 transitions, 453 flow [2022-01-19 05:01:06,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 136 transitions, 436 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-01-19 05:01:06,799 INFO L242 Difference]: Finished difference. Result has 120 places, 97 transitions, 269 flow [2022-01-19 05:01:06,800 INFO L317 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=269, PETRI_PLACES=120, PETRI_TRANSITIONS=97} [2022-01-19 05:01:06,801 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 3 predicate places. [2022-01-19 05:01:06,801 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 97 transitions, 269 flow [2022-01-19 05:01:06,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 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-01-19 05:01:06,802 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:06,802 INFO L254 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-01-19 05:01:06,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 05:01:06,802 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:06,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1834518823, now seen corresponding path program 1 times [2022-01-19 05:01:06,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:06,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005006294] [2022-01-19 05:01:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:06,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:06,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:06,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005006294] [2022-01-19 05:01:06,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005006294] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:06,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:06,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 05:01:06,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865297199] [2022-01-19 05:01:06,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:06,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 05:01:06,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:06,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 05:01:06,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 05:01:06,931 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-01-19 05:01:06,931 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 97 transitions, 269 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-01-19 05:01:06,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:06,932 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-01-19 05:01:06,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:07,215 INFO L129 PetriNetUnfolder]: 380/986 cut-off events. [2022-01-19 05:01:07,215 INFO L130 PetriNetUnfolder]: For 1656/1672 co-relation queries the response was YES. [2022-01-19 05:01:07,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 986 events. 380/986 cut-off events. For 1656/1672 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5965 event pairs, 175 based on Foata normal form. 20/976 useless extension candidates. Maximal degree in co-relation 2632. Up to 286 conditions per place. [2022-01-19 05:01:07,223 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 25 selfloop transitions, 3 changer transitions 28/135 dead transitions. [2022-01-19 05:01:07,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 135 transitions, 531 flow [2022-01-19 05:01:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 05:01:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 05:01:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 876 transitions. [2022-01-19 05:01:07,226 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2022-01-19 05:01:07,226 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 876 transitions. [2022-01-19 05:01:07,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 876 transitions. [2022-01-19 05:01:07,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:07,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 876 transitions. [2022-01-19 05:01:07,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 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-01-19 05:01:07,229 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-01-19 05:01:07,230 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-01-19 05:01:07,230 INFO L186 Difference]: Start difference. First operand has 120 places, 97 transitions, 269 flow. Second operand 9 states and 876 transitions. [2022-01-19 05:01:07,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 135 transitions, 531 flow [2022-01-19 05:01:07,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 135 transitions, 500 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-01-19 05:01:07,235 INFO L242 Difference]: Finished difference. Result has 125 places, 97 transitions, 281 flow [2022-01-19 05:01:07,235 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=125, PETRI_TRANSITIONS=97} [2022-01-19 05:01:07,236 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2022-01-19 05:01:07,236 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 97 transitions, 281 flow [2022-01-19 05:01:07,236 INFO L471 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-01-19 05:01:07,236 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:07,236 INFO L254 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] [2022-01-19 05:01:07,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 05:01:07,236 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:07,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:07,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1187014733, now seen corresponding path program 1 times [2022-01-19 05:01:07,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:07,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391418126] [2022-01-19 05:01:07,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:07,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:07,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391418126] [2022-01-19 05:01:07,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391418126] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:07,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:07,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 05:01:07,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52680664] [2022-01-19 05:01:07,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:07,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 05:01:07,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:07,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 05:01:07,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-19 05:01:07,431 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-01-19 05:01:07,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 97 transitions, 281 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 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-01-19 05:01:07,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:07,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-01-19 05:01:07,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:07,756 INFO L129 PetriNetUnfolder]: 443/1241 cut-off events. [2022-01-19 05:01:07,756 INFO L130 PetriNetUnfolder]: For 3457/3505 co-relation queries the response was YES. [2022-01-19 05:01:07,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3493 conditions, 1241 events. 443/1241 cut-off events. For 3457/3505 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8582 event pairs, 228 based on Foata normal form. 36/1182 useless extension candidates. Maximal degree in co-relation 3424. Up to 428 conditions per place. [2022-01-19 05:01:07,765 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 16 selfloop transitions, 10 changer transitions 34/139 dead transitions. [2022-01-19 05:01:07,765 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 139 transitions, 547 flow [2022-01-19 05:01:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 05:01:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 05:01:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1398 transitions. [2022-01-19 05:01:07,768 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8321428571428572 [2022-01-19 05:01:07,768 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1398 transitions. [2022-01-19 05:01:07,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1398 transitions. [2022-01-19 05:01:07,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:07,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1398 transitions. [2022-01-19 05:01:07,772 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-01-19 05:01:07,773 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-01-19 05:01:07,774 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-01-19 05:01:07,774 INFO L186 Difference]: Start difference. First operand has 125 places, 97 transitions, 281 flow. Second operand 15 states and 1398 transitions. [2022-01-19 05:01:07,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 139 transitions, 547 flow [2022-01-19 05:01:07,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 139 transitions, 502 flow, removed 21 selfloop flow, removed 7 redundant places. [2022-01-19 05:01:07,782 INFO L242 Difference]: Finished difference. Result has 137 places, 103 transitions, 350 flow [2022-01-19 05:01:07,782 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=350, PETRI_PLACES=137, PETRI_TRANSITIONS=103} [2022-01-19 05:01:07,784 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 20 predicate places. [2022-01-19 05:01:07,784 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 103 transitions, 350 flow [2022-01-19 05:01:07,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 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-01-19 05:01:07,784 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:07,785 INFO L254 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-01-19 05:01:07,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 05:01:07,785 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:07,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:07,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1460208508, now seen corresponding path program 1 times [2022-01-19 05:01:07,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:07,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221339917] [2022-01-19 05:01:07,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:07,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:07,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:07,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221339917] [2022-01-19 05:01:07,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221339917] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:07,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:07,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 05:01:07,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804482225] [2022-01-19 05:01:07,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:07,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 05:01:07,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:07,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 05:01:07,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-19 05:01:07,952 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-01-19 05:01:07,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 103 transitions, 350 flow. Second operand has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 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-01-19 05:01:07,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:07,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-01-19 05:01:07,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:08,289 INFO L129 PetriNetUnfolder]: 371/1042 cut-off events. [2022-01-19 05:01:08,290 INFO L130 PetriNetUnfolder]: For 4485/4579 co-relation queries the response was YES. [2022-01-19 05:01:08,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3780 conditions, 1042 events. 371/1042 cut-off events. For 4485/4579 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6636 event pairs, 119 based on Foata normal form. 29/992 useless extension candidates. Maximal degree in co-relation 3701. Up to 368 conditions per place. [2022-01-19 05:01:08,298 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 23 selfloop transitions, 9 changer transitions 29/140 dead transitions. [2022-01-19 05:01:08,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 716 flow [2022-01-19 05:01:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 05:01:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 05:01:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1484 transitions. [2022-01-19 05:01:08,302 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.828125 [2022-01-19 05:01:08,302 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1484 transitions. [2022-01-19 05:01:08,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1484 transitions. [2022-01-19 05:01:08,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:08,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1484 transitions. [2022-01-19 05:01:08,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 92.75) internal successors, (1484), 16 states have internal predecessors, (1484), 0 states have call successors, (0), 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-01-19 05:01:08,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 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-01-19 05:01:08,308 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 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-01-19 05:01:08,308 INFO L186 Difference]: Start difference. First operand has 137 places, 103 transitions, 350 flow. Second operand 16 states and 1484 transitions. [2022-01-19 05:01:08,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 716 flow [2022-01-19 05:01:08,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 140 transitions, 678 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-01-19 05:01:08,315 INFO L242 Difference]: Finished difference. Result has 149 places, 106 transitions, 409 flow [2022-01-19 05:01:08,315 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=409, PETRI_PLACES=149, PETRI_TRANSITIONS=106} [2022-01-19 05:01:08,317 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2022-01-19 05:01:08,317 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 106 transitions, 409 flow [2022-01-19 05:01:08,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 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-01-19 05:01:08,317 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:08,318 INFO L254 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-01-19 05:01:08,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 05:01:08,318 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:08,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:08,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1918933345, now seen corresponding path program 1 times [2022-01-19 05:01:08,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:08,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745131312] [2022-01-19 05:01:08,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:08,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:08,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:08,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745131312] [2022-01-19 05:01:08,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745131312] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:08,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:08,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 05:01:08,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770152168] [2022-01-19 05:01:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:08,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 05:01:08,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:08,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 05:01:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-19 05:01:08,485 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2022-01-19 05:01:08,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 106 transitions, 409 flow. Second operand has 10 states, 10 states have (on average 88.7) internal successors, (887), 10 states have internal predecessors, (887), 0 states have call successors, (0), 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-01-19 05:01:08,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:08,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2022-01-19 05:01:08,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:08,859 INFO L129 PetriNetUnfolder]: 410/1103 cut-off events. [2022-01-19 05:01:08,859 INFO L130 PetriNetUnfolder]: For 8171/8576 co-relation queries the response was YES. [2022-01-19 05:01:08,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4900 conditions, 1103 events. 410/1103 cut-off events. For 8171/8576 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7159 event pairs, 129 based on Foata normal form. 40/1050 useless extension candidates. Maximal degree in co-relation 4809. Up to 387 conditions per place. [2022-01-19 05:01:08,870 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 28 selfloop transitions, 12 changer transitions 32/149 dead transitions. [2022-01-19 05:01:08,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 149 transitions, 937 flow [2022-01-19 05:01:08,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 05:01:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 05:01:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1457 transitions. [2022-01-19 05:01:08,873 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8130580357142857 [2022-01-19 05:01:08,873 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1457 transitions. [2022-01-19 05:01:08,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1457 transitions. [2022-01-19 05:01:08,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:08,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1457 transitions. [2022-01-19 05:01:08,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 91.0625) internal successors, (1457), 16 states have internal predecessors, (1457), 0 states have call successors, (0), 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-01-19 05:01:08,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 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-01-19 05:01:08,878 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 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-01-19 05:01:08,878 INFO L186 Difference]: Start difference. First operand has 149 places, 106 transitions, 409 flow. Second operand 16 states and 1457 transitions. [2022-01-19 05:01:08,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 149 transitions, 937 flow [2022-01-19 05:01:08,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 149 transitions, 855 flow, removed 34 selfloop flow, removed 13 redundant places. [2022-01-19 05:01:08,889 INFO L242 Difference]: Finished difference. Result has 154 places, 115 transitions, 516 flow [2022-01-19 05:01:08,889 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=516, PETRI_PLACES=154, PETRI_TRANSITIONS=115} [2022-01-19 05:01:08,890 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2022-01-19 05:01:08,890 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 115 transitions, 516 flow [2022-01-19 05:01:08,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.7) internal successors, (887), 10 states have internal predecessors, (887), 0 states have call successors, (0), 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-01-19 05:01:08,890 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:08,903 INFO L254 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-01-19 05:01:08,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 05:01:08,903 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:08,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:08,904 INFO L85 PathProgramCache]: Analyzing trace with hash 553289085, now seen corresponding path program 2 times [2022-01-19 05:01:08,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:08,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867316464] [2022-01-19 05:01:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:08,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:08,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:08,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867316464] [2022-01-19 05:01:08,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867316464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:08,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:08,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 05:01:08,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958810721] [2022-01-19 05:01:08,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:08,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 05:01:08,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:08,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 05:01:08,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 05:01:08,963 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2022-01-19 05:01:08,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 115 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 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-01-19 05:01:08,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:08,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2022-01-19 05:01:08,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:09,278 INFO L129 PetriNetUnfolder]: 520/1547 cut-off events. [2022-01-19 05:01:09,279 INFO L130 PetriNetUnfolder]: For 14860/15832 co-relation queries the response was YES. [2022-01-19 05:01:09,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7571 conditions, 1547 events. 520/1547 cut-off events. For 14860/15832 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11391 event pairs, 134 based on Foata normal form. 46/1499 useless extension candidates. Maximal degree in co-relation 7482. Up to 317 conditions per place. [2022-01-19 05:01:09,294 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 41 selfloop transitions, 3 changer transitions 23/151 dead transitions. [2022-01-19 05:01:09,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 151 transitions, 1106 flow [2022-01-19 05:01:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 05:01:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 05:01:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 867 transitions. [2022-01-19 05:01:09,296 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8601190476190477 [2022-01-19 05:01:09,296 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 867 transitions. [2022-01-19 05:01:09,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 867 transitions. [2022-01-19 05:01:09,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:09,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 867 transitions. [2022-01-19 05:01:09,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.33333333333333) internal successors, (867), 9 states have internal predecessors, (867), 0 states have call successors, (0), 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-01-19 05:01:09,299 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-01-19 05:01:09,299 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-01-19 05:01:09,299 INFO L186 Difference]: Start difference. First operand has 154 places, 115 transitions, 516 flow. Second operand 9 states and 867 transitions. [2022-01-19 05:01:09,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 151 transitions, 1106 flow [2022-01-19 05:01:09,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 151 transitions, 966 flow, removed 68 selfloop flow, removed 8 redundant places. [2022-01-19 05:01:09,314 INFO L242 Difference]: Finished difference. Result has 152 places, 115 transitions, 495 flow [2022-01-19 05:01:09,314 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=495, PETRI_PLACES=152, PETRI_TRANSITIONS=115} [2022-01-19 05:01:09,315 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 35 predicate places. [2022-01-19 05:01:09,316 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 115 transitions, 495 flow [2022-01-19 05:01:09,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 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-01-19 05:01:09,316 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:09,316 INFO L254 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-01-19 05:01:09,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 05:01:09,316 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1997325553, now seen corresponding path program 1 times [2022-01-19 05:01:09,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:09,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387776739] [2022-01-19 05:01:09,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:09,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:09,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:09,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387776739] [2022-01-19 05:01:09,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387776739] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:09,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:09,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 05:01:09,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794819512] [2022-01-19 05:01:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:09,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 05:01:09,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:09,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 05:01:09,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-19 05:01:09,495 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2022-01-19 05:01:09,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 115 transitions, 495 flow. Second operand has 12 states, 12 states have (on average 88.41666666666667) internal successors, (1061), 12 states have internal predecessors, (1061), 0 states have call successors, (0), 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-01-19 05:01:09,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:09,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2022-01-19 05:01:09,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:09,775 INFO L129 PetriNetUnfolder]: 367/1195 cut-off events. [2022-01-19 05:01:09,775 INFO L130 PetriNetUnfolder]: For 10936/11329 co-relation queries the response was YES. [2022-01-19 05:01:09,781 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 1195 events. 367/1195 cut-off events. For 10936/11329 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8975 event pairs, 142 based on Foata normal form. 59/1145 useless extension candidates. Maximal degree in co-relation 5554. Up to 372 conditions per place. [2022-01-19 05:01:09,785 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 23 selfloop transitions, 15 changer transitions 22/137 dead transitions. [2022-01-19 05:01:09,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 137 transitions, 867 flow [2022-01-19 05:01:09,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 05:01:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 05:01:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1269 transitions. [2022-01-19 05:01:09,788 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8093112244897959 [2022-01-19 05:01:09,788 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1269 transitions. [2022-01-19 05:01:09,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1269 transitions. [2022-01-19 05:01:09,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:09,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1269 transitions. [2022-01-19 05:01:09,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.64285714285714) internal successors, (1269), 14 states have internal predecessors, (1269), 0 states have call successors, (0), 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-01-19 05:01:09,792 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-01-19 05:01:09,792 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-01-19 05:01:09,792 INFO L186 Difference]: Start difference. First operand has 152 places, 115 transitions, 495 flow. Second operand 14 states and 1269 transitions. [2022-01-19 05:01:09,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 137 transitions, 867 flow [2022-01-19 05:01:09,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 137 transitions, 830 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-01-19 05:01:09,805 INFO L242 Difference]: Finished difference. Result has 158 places, 114 transitions, 515 flow [2022-01-19 05:01:09,805 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=515, PETRI_PLACES=158, PETRI_TRANSITIONS=114} [2022-01-19 05:01:09,805 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 41 predicate places. [2022-01-19 05:01:09,806 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 114 transitions, 515 flow [2022-01-19 05:01:09,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 88.41666666666667) internal successors, (1061), 12 states have internal predecessors, (1061), 0 states have call successors, (0), 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-01-19 05:01:09,806 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:09,806 INFO L254 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-01-19 05:01:09,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 05:01:09,806 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:09,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:09,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1530405304, now seen corresponding path program 1 times [2022-01-19 05:01:09,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:09,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983791489] [2022-01-19 05:01:09,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:09,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:09,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:09,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983791489] [2022-01-19 05:01:09,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983791489] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:09,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:09,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 05:01:09,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573229295] [2022-01-19 05:01:09,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:09,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 05:01:09,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:09,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 05:01:09,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 05:01:09,900 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112 [2022-01-19 05:01:09,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 114 transitions, 515 flow. Second operand has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 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-01-19 05:01:09,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:09,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112 [2022-01-19 05:01:09,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:10,172 INFO L129 PetriNetUnfolder]: 327/1086 cut-off events. [2022-01-19 05:01:10,172 INFO L130 PetriNetUnfolder]: For 11546/11765 co-relation queries the response was YES. [2022-01-19 05:01:10,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5490 conditions, 1086 events. 327/1086 cut-off events. For 11546/11765 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7710 event pairs, 114 based on Foata normal form. 40/1025 useless extension candidates. Maximal degree in co-relation 5394. Up to 385 conditions per place. [2022-01-19 05:01:10,183 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 30 selfloop transitions, 18 changer transitions 19/147 dead transitions. [2022-01-19 05:01:10,184 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 147 transitions, 1085 flow [2022-01-19 05:01:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 05:01:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 05:01:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1041 transitions. [2022-01-19 05:01:10,187 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8449675324675324 [2022-01-19 05:01:10,187 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1041 transitions. [2022-01-19 05:01:10,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1041 transitions. [2022-01-19 05:01:10,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:10,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1041 transitions. [2022-01-19 05:01:10,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.63636363636364) internal successors, (1041), 11 states have internal predecessors, (1041), 0 states have call successors, (0), 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-01-19 05:01:10,192 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-01-19 05:01:10,192 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-01-19 05:01:10,192 INFO L186 Difference]: Start difference. First operand has 158 places, 114 transitions, 515 flow. Second operand 11 states and 1041 transitions. [2022-01-19 05:01:10,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 147 transitions, 1085 flow [2022-01-19 05:01:10,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 147 transitions, 943 flow, removed 60 selfloop flow, removed 15 redundant places. [2022-01-19 05:01:10,206 INFO L242 Difference]: Finished difference. Result has 155 places, 122 transitions, 635 flow [2022-01-19 05:01:10,206 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=635, PETRI_PLACES=155, PETRI_TRANSITIONS=122} [2022-01-19 05:01:10,207 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 38 predicate places. [2022-01-19 05:01:10,207 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 122 transitions, 635 flow [2022-01-19 05:01:10,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 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-01-19 05:01:10,207 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:10,207 INFO L254 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-01-19 05:01:10,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 05:01:10,207 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash -126403070, now seen corresponding path program 2 times [2022-01-19 05:01:10,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:10,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643794400] [2022-01-19 05:01:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:10,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:10,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:10,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643794400] [2022-01-19 05:01:10,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643794400] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:10,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:10,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 05:01:10,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418342012] [2022-01-19 05:01:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:10,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 05:01:10,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:10,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 05:01:10,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-19 05:01:10,366 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-01-19 05:01:10,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 122 transitions, 635 flow. Second operand has 11 states, 11 states have (on average 89.54545454545455) internal successors, (985), 11 states have internal predecessors, (985), 0 states have call successors, (0), 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-01-19 05:01:10,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:10,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-01-19 05:01:10,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:10,695 INFO L129 PetriNetUnfolder]: 352/1135 cut-off events. [2022-01-19 05:01:10,695 INFO L130 PetriNetUnfolder]: For 10682/11596 co-relation queries the response was YES. [2022-01-19 05:01:10,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5741 conditions, 1135 events. 352/1135 cut-off events. For 10682/11596 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8247 event pairs, 112 based on Foata normal form. 56/1079 useless extension candidates. Maximal degree in co-relation 5648. Up to 363 conditions per place. [2022-01-19 05:01:10,706 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 31 selfloop transitions, 23 changer transitions 19/151 dead transitions. [2022-01-19 05:01:10,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 151 transitions, 1145 flow [2022-01-19 05:01:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 05:01:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 05:01:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1289 transitions. [2022-01-19 05:01:10,708 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8220663265306123 [2022-01-19 05:01:10,708 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1289 transitions. [2022-01-19 05:01:10,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1289 transitions. [2022-01-19 05:01:10,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:10,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1289 transitions. [2022-01-19 05:01:10,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 92.07142857142857) internal successors, (1289), 14 states have internal predecessors, (1289), 0 states have call successors, (0), 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-01-19 05:01:10,711 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-01-19 05:01:10,712 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-01-19 05:01:10,712 INFO L186 Difference]: Start difference. First operand has 155 places, 122 transitions, 635 flow. Second operand 14 states and 1289 transitions. [2022-01-19 05:01:10,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 151 transitions, 1145 flow [2022-01-19 05:01:10,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 151 transitions, 1072 flow, removed 36 selfloop flow, removed 7 redundant places. [2022-01-19 05:01:10,727 INFO L242 Difference]: Finished difference. Result has 162 places, 124 transitions, 700 flow [2022-01-19 05:01:10,727 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=700, PETRI_PLACES=162, PETRI_TRANSITIONS=124} [2022-01-19 05:01:10,727 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 45 predicate places. [2022-01-19 05:01:10,727 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 124 transitions, 700 flow [2022-01-19 05:01:10,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.54545454545455) internal successors, (985), 11 states have internal predecessors, (985), 0 states have call successors, (0), 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-01-19 05:01:10,728 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:10,728 INFO L254 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-01-19 05:01:10,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 05:01:10,728 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:10,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:10,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1835443644, now seen corresponding path program 3 times [2022-01-19 05:01:10,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:10,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001777237] [2022-01-19 05:01:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:10,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:10,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:10,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001777237] [2022-01-19 05:01:10,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001777237] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:10,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:10,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 05:01:10,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471947679] [2022-01-19 05:01:10,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:10,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 05:01:10,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:10,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 05:01:10,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 05:01:10,853 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-01-19 05:01:10,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 124 transitions, 700 flow. Second operand has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 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-01-19 05:01:10,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:10,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-01-19 05:01:10,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:11,204 INFO L129 PetriNetUnfolder]: 269/978 cut-off events. [2022-01-19 05:01:11,204 INFO L130 PetriNetUnfolder]: For 12108/12813 co-relation queries the response was YES. [2022-01-19 05:01:11,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5352 conditions, 978 events. 269/978 cut-off events. For 12108/12813 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7061 event pairs, 74 based on Foata normal form. 52/940 useless extension candidates. Maximal degree in co-relation 5256. Up to 240 conditions per place. [2022-01-19 05:01:11,214 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 29 selfloop transitions, 24 changer transitions 20/152 dead transitions. [2022-01-19 05:01:11,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 152 transitions, 1310 flow [2022-01-19 05:01:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 05:01:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 05:01:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1298 transitions. [2022-01-19 05:01:11,216 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8278061224489796 [2022-01-19 05:01:11,216 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1298 transitions. [2022-01-19 05:01:11,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1298 transitions. [2022-01-19 05:01:11,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:11,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1298 transitions. [2022-01-19 05:01:11,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 92.71428571428571) internal successors, (1298), 14 states have internal predecessors, (1298), 0 states have call successors, (0), 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-01-19 05:01:11,219 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-01-19 05:01:11,220 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-01-19 05:01:11,220 INFO L186 Difference]: Start difference. First operand has 162 places, 124 transitions, 700 flow. Second operand 14 states and 1298 transitions. [2022-01-19 05:01:11,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 152 transitions, 1310 flow [2022-01-19 05:01:11,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 152 transitions, 1230 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-01-19 05:01:11,236 INFO L242 Difference]: Finished difference. Result has 167 places, 124 transitions, 735 flow [2022-01-19 05:01:11,237 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=735, PETRI_PLACES=167, PETRI_TRANSITIONS=124} [2022-01-19 05:01:11,237 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 50 predicate places. [2022-01-19 05:01:11,237 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 124 transitions, 735 flow [2022-01-19 05:01:11,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 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-01-19 05:01:11,238 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:11,238 INFO L254 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-01-19 05:01:11,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 05:01:11,238 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:11,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash 410291034, now seen corresponding path program 1 times [2022-01-19 05:01:11,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:11,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922791801] [2022-01-19 05:01:11,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:11,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:11,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:11,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922791801] [2022-01-19 05:01:11,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922791801] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:11,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:11,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 05:01:11,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431613751] [2022-01-19 05:01:11,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:11,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 05:01:11,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:11,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 05:01:11,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-19 05:01:11,411 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 112 [2022-01-19 05:01:11,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 124 transitions, 735 flow. Second operand has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 0 states have call successors, (0), 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-01-19 05:01:11,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:11,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 112 [2022-01-19 05:01:11,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:11,711 INFO L129 PetriNetUnfolder]: 198/804 cut-off events. [2022-01-19 05:01:11,711 INFO L130 PetriNetUnfolder]: For 11824/12532 co-relation queries the response was YES. [2022-01-19 05:01:11,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4518 conditions, 804 events. 198/804 cut-off events. For 11824/12532 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5486 event pairs, 75 based on Foata normal form. 29/757 useless extension candidates. Maximal degree in co-relation 4415. Up to 300 conditions per place. [2022-01-19 05:01:11,719 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 40 selfloop transitions, 13 changer transitions 10/139 dead transitions. [2022-01-19 05:01:11,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 139 transitions, 1123 flow [2022-01-19 05:01:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 05:01:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 05:01:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1161 transitions. [2022-01-19 05:01:11,721 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7973901098901099 [2022-01-19 05:01:11,721 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1161 transitions. [2022-01-19 05:01:11,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1161 transitions. [2022-01-19 05:01:11,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:11,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1161 transitions. [2022-01-19 05:01:11,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 89.3076923076923) internal successors, (1161), 13 states have internal predecessors, (1161), 0 states have call successors, (0), 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-01-19 05:01:11,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 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-01-19 05:01:11,725 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 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-01-19 05:01:11,725 INFO L186 Difference]: Start difference. First operand has 167 places, 124 transitions, 735 flow. Second operand 13 states and 1161 transitions. [2022-01-19 05:01:11,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 139 transitions, 1123 flow [2022-01-19 05:01:11,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 139 transitions, 1012 flow, removed 40 selfloop flow, removed 12 redundant places. [2022-01-19 05:01:11,743 INFO L242 Difference]: Finished difference. Result has 168 places, 125 transitions, 747 flow [2022-01-19 05:01:11,743 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=747, PETRI_PLACES=168, PETRI_TRANSITIONS=125} [2022-01-19 05:01:11,744 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 51 predicate places. [2022-01-19 05:01:11,744 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 125 transitions, 747 flow [2022-01-19 05:01:11,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 0 states have call successors, (0), 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-01-19 05:01:11,745 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:11,745 INFO L254 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-01-19 05:01:11,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 05:01:11,745 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:11,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:11,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1381626304, now seen corresponding path program 2 times [2022-01-19 05:01:11,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:11,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927997149] [2022-01-19 05:01:11,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:11,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:11,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:11,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927997149] [2022-01-19 05:01:11,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927997149] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:11,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:11,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 05:01:11,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756682425] [2022-01-19 05:01:11,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:11,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 05:01:11,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:11,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 05:01:11,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-19 05:01:11,952 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 112 [2022-01-19 05:01:11,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 125 transitions, 747 flow. Second operand has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 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-01-19 05:01:11,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:11,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 112 [2022-01-19 05:01:11,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:12,193 INFO L129 PetriNetUnfolder]: 204/830 cut-off events. [2022-01-19 05:01:12,193 INFO L130 PetriNetUnfolder]: For 11863/12149 co-relation queries the response was YES. [2022-01-19 05:01:12,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4615 conditions, 830 events. 204/830 cut-off events. For 11863/12149 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5541 event pairs, 73 based on Foata normal form. 25/777 useless extension candidates. Maximal degree in co-relation 4512. Up to 309 conditions per place. [2022-01-19 05:01:12,201 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 43 selfloop transitions, 15 changer transitions 7/141 dead transitions. [2022-01-19 05:01:12,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 141 transitions, 1166 flow [2022-01-19 05:01:12,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 05:01:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 05:01:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 984 transitions. [2022-01-19 05:01:12,204 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7987012987012987 [2022-01-19 05:01:12,204 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 984 transitions. [2022-01-19 05:01:12,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 984 transitions. [2022-01-19 05:01:12,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:12,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 984 transitions. [2022-01-19 05:01:12,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 89.45454545454545) internal successors, (984), 11 states have internal predecessors, (984), 0 states have call successors, (0), 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-01-19 05:01:12,207 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-01-19 05:01:12,208 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-01-19 05:01:12,208 INFO L186 Difference]: Start difference. First operand has 168 places, 125 transitions, 747 flow. Second operand 11 states and 984 transitions. [2022-01-19 05:01:12,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 141 transitions, 1166 flow [2022-01-19 05:01:12,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 141 transitions, 1063 flow, removed 39 selfloop flow, removed 11 redundant places. [2022-01-19 05:01:12,227 INFO L242 Difference]: Finished difference. Result has 165 places, 130 transitions, 815 flow [2022-01-19 05:01:12,227 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=815, PETRI_PLACES=165, PETRI_TRANSITIONS=130} [2022-01-19 05:01:12,227 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 48 predicate places. [2022-01-19 05:01:12,227 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 130 transitions, 815 flow [2022-01-19 05:01:12,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 87.53846153846153) internal successors, (1138), 13 states have internal predecessors, (1138), 0 states have call successors, (0), 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-01-19 05:01:12,228 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:12,228 INFO L254 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-01-19 05:01:12,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 05:01:12,228 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:12,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:12,229 INFO L85 PathProgramCache]: Analyzing trace with hash -767177424, now seen corresponding path program 3 times [2022-01-19 05:01:12,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:12,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707583778] [2022-01-19 05:01:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:12,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:12,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:12,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707583778] [2022-01-19 05:01:12,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707583778] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:12,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:12,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 05:01:12,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400165651] [2022-01-19 05:01:12,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:12,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 05:01:12,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:12,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 05:01:12,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-19 05:01:12,362 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2022-01-19 05:01:12,363 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 130 transitions, 815 flow. Second operand has 11 states, 11 states have (on average 89.63636363636364) internal successors, (986), 11 states have internal predecessors, (986), 0 states have call successors, (0), 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-01-19 05:01:12,363 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:12,363 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2022-01-19 05:01:12,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:12,636 INFO L129 PetriNetUnfolder]: 162/750 cut-off events. [2022-01-19 05:01:12,636 INFO L130 PetriNetUnfolder]: For 7986/9059 co-relation queries the response was YES. [2022-01-19 05:01:12,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 750 events. 162/750 cut-off events. For 7986/9059 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5117 event pairs, 51 based on Foata normal form. 32/714 useless extension candidates. Maximal degree in co-relation 3730. Up to 158 conditions per place. [2022-01-19 05:01:12,643 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 44 selfloop transitions, 14 changer transitions 11/147 dead transitions. [2022-01-19 05:01:12,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 147 transitions, 1211 flow [2022-01-19 05:01:12,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 05:01:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 05:01:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1097 transitions. [2022-01-19 05:01:12,645 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8162202380952381 [2022-01-19 05:01:12,645 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1097 transitions. [2022-01-19 05:01:12,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1097 transitions. [2022-01-19 05:01:12,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:12,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1097 transitions. [2022-01-19 05:01:12,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.41666666666667) internal successors, (1097), 12 states have internal predecessors, (1097), 0 states have call successors, (0), 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-01-19 05:01:12,648 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-01-19 05:01:12,648 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-01-19 05:01:12,648 INFO L186 Difference]: Start difference. First operand has 165 places, 130 transitions, 815 flow. Second operand 12 states and 1097 transitions. [2022-01-19 05:01:12,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 147 transitions, 1211 flow [2022-01-19 05:01:12,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 147 transitions, 1120 flow, removed 34 selfloop flow, removed 9 redundant places. [2022-01-19 05:01:12,665 INFO L242 Difference]: Finished difference. Result has 171 places, 129 transitions, 775 flow [2022-01-19 05:01:12,666 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=775, PETRI_PLACES=171, PETRI_TRANSITIONS=129} [2022-01-19 05:01:12,666 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 54 predicate places. [2022-01-19 05:01:12,666 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 129 transitions, 775 flow [2022-01-19 05:01:12,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.63636363636364) internal successors, (986), 11 states have internal predecessors, (986), 0 states have call successors, (0), 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-01-19 05:01:12,666 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:12,666 INFO L254 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-01-19 05:01:12,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 05:01:12,667 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash -260464144, now seen corresponding path program 1 times [2022-01-19 05:01:12,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:12,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139420529] [2022-01-19 05:01:12,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:12,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:12,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:12,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139420529] [2022-01-19 05:01:12,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139420529] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:12,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:12,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 05:01:12,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236911706] [2022-01-19 05:01:12,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:12,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 05:01:12,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:12,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 05:01:12,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 05:01:12,729 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-01-19 05:01:12,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 129 transitions, 775 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 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-01-19 05:01:12,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:12,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-01-19 05:01:12,730 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:13,479 INFO L129 PetriNetUnfolder]: 3092/6011 cut-off events. [2022-01-19 05:01:13,480 INFO L130 PetriNetUnfolder]: For 47549/48135 co-relation queries the response was YES. [2022-01-19 05:01:13,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23600 conditions, 6011 events. 3092/6011 cut-off events. For 47549/48135 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 49224 event pairs, 121 based on Foata normal form. 457/6072 useless extension candidates. Maximal degree in co-relation 23502. Up to 2112 conditions per place. [2022-01-19 05:01:13,512 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 54 selfloop transitions, 6 changer transitions 118/259 dead transitions. [2022-01-19 05:01:13,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 259 transitions, 2539 flow [2022-01-19 05:01:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 05:01:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 05:01:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 964 transitions. [2022-01-19 05:01:13,514 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858 [2022-01-19 05:01:13,514 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 964 transitions. [2022-01-19 05:01:13,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 964 transitions. [2022-01-19 05:01:13,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:13,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 964 transitions. [2022-01-19 05:01:13,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:01:13,516 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-01-19 05:01:13,517 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-01-19 05:01:13,517 INFO L186 Difference]: Start difference. First operand has 171 places, 129 transitions, 775 flow. Second operand 10 states and 964 transitions. [2022-01-19 05:01:13,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 259 transitions, 2539 flow [2022-01-19 05:01:13,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 259 transitions, 2290 flow, removed 73 selfloop flow, removed 14 redundant places. [2022-01-19 05:01:13,578 INFO L242 Difference]: Finished difference. Result has 166 places, 121 transitions, 652 flow [2022-01-19 05:01:13,578 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=652, PETRI_PLACES=166, PETRI_TRANSITIONS=121} [2022-01-19 05:01:13,578 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 49 predicate places. [2022-01-19 05:01:13,578 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 121 transitions, 652 flow [2022-01-19 05:01:13,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 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-01-19 05:01:13,579 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:13,579 INFO L254 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-01-19 05:01:13,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 05:01:13,579 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:13,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:13,579 INFO L85 PathProgramCache]: Analyzing trace with hash -607762605, now seen corresponding path program 1 times [2022-01-19 05:01:13,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:13,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241615004] [2022-01-19 05:01:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:13,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:13,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:13,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241615004] [2022-01-19 05:01:13,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241615004] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:13,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:13,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 05:01:13,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294479354] [2022-01-19 05:01:13,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:13,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 05:01:13,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:13,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 05:01:13,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 05:01:13,644 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-01-19 05:01:13,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 121 transitions, 652 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 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-01-19 05:01:13,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:13,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-01-19 05:01:13,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:14,051 INFO L129 PetriNetUnfolder]: 1184/2851 cut-off events. [2022-01-19 05:01:14,051 INFO L130 PetriNetUnfolder]: For 17044/17320 co-relation queries the response was YES. [2022-01-19 05:01:14,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12768 conditions, 2851 events. 1184/2851 cut-off events. For 17044/17320 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 23252 event pairs, 11 based on Foata normal form. 298/3077 useless extension candidates. Maximal degree in co-relation 12674. Up to 965 conditions per place. [2022-01-19 05:01:14,067 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 42 selfloop transitions, 9 changer transitions 80/210 dead transitions. [2022-01-19 05:01:14,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 210 transitions, 1863 flow [2022-01-19 05:01:14,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 05:01:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 05:01:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2022-01-19 05:01:14,069 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2022-01-19 05:01:14,069 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2022-01-19 05:01:14,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2022-01-19 05:01:14,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:14,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2022-01-19 05:01:14,071 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-01-19 05:01:14,072 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-01-19 05:01:14,072 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-01-19 05:01:14,072 INFO L186 Difference]: Start difference. First operand has 166 places, 121 transitions, 652 flow. Second operand 10 states and 962 transitions. [2022-01-19 05:01:14,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 210 transitions, 1863 flow [2022-01-19 05:01:14,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 210 transitions, 1753 flow, removed 31 selfloop flow, removed 12 redundant places. [2022-01-19 05:01:14,092 INFO L242 Difference]: Finished difference. Result has 163 places, 114 transitions, 601 flow [2022-01-19 05:01:14,092 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=601, PETRI_PLACES=163, PETRI_TRANSITIONS=114} [2022-01-19 05:01:14,093 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 46 predicate places. [2022-01-19 05:01:14,093 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 114 transitions, 601 flow [2022-01-19 05:01:14,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 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-01-19 05:01:14,093 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:14,093 INFO L254 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-01-19 05:01:14,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 05:01:14,093 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:14,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:14,094 INFO L85 PathProgramCache]: Analyzing trace with hash 547691252, now seen corresponding path program 1 times [2022-01-19 05:01:14,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:14,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480032660] [2022-01-19 05:01:14,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:14,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:01:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:01:14,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:01:14,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480032660] [2022-01-19 05:01:14,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480032660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:01:14,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:01:14,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 05:01:14,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431363271] [2022-01-19 05:01:14,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:01:14,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 05:01:14,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:01:14,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 05:01:14,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 05:01:14,161 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2022-01-19 05:01:14,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 114 transitions, 601 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 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-01-19 05:01:14,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:01:14,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2022-01-19 05:01:14,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:01:14,367 INFO L129 PetriNetUnfolder]: 188/768 cut-off events. [2022-01-19 05:01:14,368 INFO L130 PetriNetUnfolder]: For 4050/4145 co-relation queries the response was YES. [2022-01-19 05:01:14,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3216 conditions, 768 events. 188/768 cut-off events. For 4050/4145 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5127 event pairs, 3 based on Foata normal form. 67/816 useless extension candidates. Maximal degree in co-relation 3124. Up to 213 conditions per place. [2022-01-19 05:01:14,372 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 20 selfloop transitions, 12 changer transitions 56/162 dead transitions. [2022-01-19 05:01:14,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 1281 flow [2022-01-19 05:01:14,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 05:01:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 05:01:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1033 transitions. [2022-01-19 05:01:14,374 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.838474025974026 [2022-01-19 05:01:14,374 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1033 transitions. [2022-01-19 05:01:14,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1033 transitions. [2022-01-19 05:01:14,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:01:14,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1033 transitions. [2022-01-19 05:01:14,376 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-01-19 05:01:14,377 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-01-19 05:01:14,377 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-01-19 05:01:14,377 INFO L186 Difference]: Start difference. First operand has 163 places, 114 transitions, 601 flow. Second operand 11 states and 1033 transitions. [2022-01-19 05:01:14,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 1281 flow [2022-01-19 05:01:14,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 162 transitions, 1008 flow, removed 99 selfloop flow, removed 24 redundant places. [2022-01-19 05:01:14,388 INFO L242 Difference]: Finished difference. Result has 151 places, 100 transitions, 385 flow [2022-01-19 05:01:14,388 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=385, PETRI_PLACES=151, PETRI_TRANSITIONS=100} [2022-01-19 05:01:14,389 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 34 predicate places. [2022-01-19 05:01:14,389 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 100 transitions, 385 flow [2022-01-19 05:01:14,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 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-01-19 05:01:14,389 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:01:14,389 INFO L254 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-01-19 05:01:14,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 05:01:14,389 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 05:01:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:01:14,390 INFO L85 PathProgramCache]: Analyzing trace with hash 364523768, now seen corresponding path program 1 times [2022-01-19 05:01:14,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:01:14,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220676150] [2022-01-19 05:01:14,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:01:14,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:01:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:01:14,415 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 05:01:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 05:01:14,462 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 05:01:14,462 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 05:01:14,463 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 05:01:14,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-19 05:01:14,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 05:01:14,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-19 05:01:14,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-19 05:01:14,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 05:01:14,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 05:01:14,467 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 05:01:14,471 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 05:01:14,471 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 05:01:14,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 05:01:14 BasicIcfg [2022-01-19 05:01:14,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 05:01:14,540 INFO L158 Benchmark]: Toolchain (without parser) took 10675.00ms. Allocated memory was 505.4MB in the beginning and 1.1GB in the end (delta: 553.6MB). Free memory was 448.7MB in the beginning and 458.6MB in the end (delta: -10.0MB). Peak memory consumption was 545.3MB. Max. memory is 16.0GB. [2022-01-19 05:01:14,540 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 505.4MB. Free memory is still 466.8MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 05:01:14,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.22ms. Allocated memory was 505.4MB in the beginning and 765.5MB in the end (delta: 260.0MB). Free memory was 448.5MB in the beginning and 724.4MB in the end (delta: -275.9MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. [2022-01-19 05:01:14,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.04ms. Allocated memory is still 765.5MB. Free memory was 724.4MB in the beginning and 721.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 05:01:14,540 INFO L158 Benchmark]: Boogie Preprocessor took 50.65ms. Allocated memory is still 765.5MB. Free memory was 721.1MB in the beginning and 719.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 05:01:14,541 INFO L158 Benchmark]: RCFGBuilder took 661.55ms. Allocated memory is still 765.5MB. Free memory was 719.0MB in the beginning and 645.6MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. [2022-01-19 05:01:14,541 INFO L158 Benchmark]: TraceAbstraction took 9434.08ms. Allocated memory was 765.5MB in the beginning and 1.1GB in the end (delta: 293.6MB). Free memory was 644.6MB in the beginning and 458.6MB in the end (delta: 185.9MB). Peak memory consumption was 482.7MB. Max. memory is 16.0GB. [2022-01-19 05:01:14,542 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.15ms. Allocated memory is still 505.4MB. Free memory is still 466.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 468.22ms. Allocated memory was 505.4MB in the beginning and 765.5MB in the end (delta: 260.0MB). Free memory was 448.5MB in the beginning and 724.4MB in the end (delta: -275.9MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.04ms. Allocated memory is still 765.5MB. Free memory was 724.4MB in the beginning and 721.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.65ms. Allocated memory is still 765.5MB. Free memory was 721.1MB in the beginning and 719.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 661.55ms. Allocated memory is still 765.5MB. Free memory was 719.0MB in the beginning and 645.6MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. * TraceAbstraction took 9434.08ms. Allocated memory was 765.5MB in the beginning and 1.1GB in the end (delta: 293.6MB). Free memory was 644.6MB in the beginning and 458.6MB in the end (delta: 185.9MB). Peak memory consumption was 482.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=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] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=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] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=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] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=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] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L733] 0 int z = 0; VAL [__unbuffered_cnt=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, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, z=0] [L811] 0 pthread_t t2492; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492={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, z=0] [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={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, z=0] [L813] 0 pthread_t t2493; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={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=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, z=0] [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={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=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, z=0] [L815] 0 pthread_t t2494; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3: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, z=0] [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3: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, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] 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) [L789] 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) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 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 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 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 [L760] 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) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] 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) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L833] 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) [L834] 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)) [L834] EXPR 0 !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) [L834] 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)) [L834] 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)) [L835] 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)) [L835] EXPR 0 !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) [L835] 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)) [L835] 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)) [L836] 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)) [L836] EXPR 0 !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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] EXPR 0 !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) [L837] 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)) [L837] 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)) [L838] 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)) [L838] EXPR 0 !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) [L838] 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)) [L838] 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)) [L839] 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)) [L839] EXPR 0 !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) [L839] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, 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=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - 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: 812]: 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: 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: 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: 9.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 781 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 781 mSDsluCounter, 824 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1232 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2062 IncrementalHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 166 mSDtfsCounter, 2062 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=815occurred in iteration=14, InterpolantAutomatonStates: 206, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1470 NumberOfCodeBlocks, 1470 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1366 ConstructedInterpolants, 0 QuantifiedInterpolants, 7561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-01-19 05:01:14,572 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...