/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:45:15,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:45:15,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:45:15,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:45:15,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:45:15,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:45:15,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:45:15,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:45:15,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:45:15,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:45:15,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:45:15,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:45:15,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:45:15,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:45:15,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:45:15,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:45:15,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:45:15,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:45:15,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:45:15,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:45:15,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:45:15,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:45:15,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:45:15,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:45:15,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:45:15,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:45:15,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:45:15,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:45:15,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:45:15,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:45:15,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:45:15,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:45:15,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:45:15,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:45:15,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:45:15,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:45:15,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:45:15,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:45:15,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:45:15,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:45:15,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:45:15,370 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-RepeatedVariableLbe.epf [2021-03-25 04:45:15,398 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:45:15,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:45:15,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:45:15,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:45:15,400 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:45:15,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:45:15,400 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:45:15,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:45:15,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:45:15,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:45:15,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:45:15,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:45:15,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:45:15,400 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:45:15,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:45:15,401 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:45:15,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:45:15,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:45:15,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:45:15,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:45:15,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:45:15,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:45:15,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:45:15,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:45:15,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:45:15,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:45:15,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:45:15,402 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:45:15,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:45:15,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:45:15,402 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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 [2021-03-25 04:45:15,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:45:15,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:45:15,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:45:15,704 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:45:15,706 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:45:15,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2021-03-25 04:45:15,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28032e3e7/5e80b97041254f2ebf138d6169f1895e/FLAG4851101eb [2021-03-25 04:45:16,201 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:45:16,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2021-03-25 04:45:16,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28032e3e7/5e80b97041254f2ebf138d6169f1895e/FLAG4851101eb [2021-03-25 04:45:16,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28032e3e7/5e80b97041254f2ebf138d6169f1895e [2021-03-25 04:45:16,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:45:16,231 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:45:16,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:45:16,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:45:16,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:45:16,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:45:16" (1/1) ... [2021-03-25 04:45:16,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c769b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16, skipping insertion in model container [2021-03-25 04:45:16,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:45:16" (1/1) ... [2021-03-25 04:45:16,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:45:16,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:45:16,377 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i[948,961] [2021-03-25 04:45:16,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:45:16,556 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:45:16,565 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i[948,961] [2021-03-25 04:45:16,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:45:16,673 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:45:16,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16 WrapperNode [2021-03-25 04:45:16,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:45:16,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:45:16,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:45:16,676 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:45:16,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16" (1/1) ... [2021-03-25 04:45:16,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16" (1/1) ... [2021-03-25 04:45:16,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:45:16,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:45:16,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:45:16,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:45:16,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16" (1/1) ... [2021-03-25 04:45:16,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16" (1/1) ... [2021-03-25 04:45:16,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16" (1/1) ... [2021-03-25 04:45:16,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16" (1/1) ... [2021-03-25 04:45:16,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16" (1/1) ... [2021-03-25 04:45:16,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16" (1/1) ... [2021-03-25 04:45:16,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16" (1/1) ... [2021-03-25 04:45:16,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:45:16,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:45:16,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:45:16,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:45:16,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:45:16,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:45:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:45:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:45:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:45:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:45:16,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:45:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:45:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:45:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:45:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:45:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:45:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:45:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:45:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:45:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:45:16,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:45:16,861 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:45:18,416 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:45:18,416 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:45:18,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:45:18 BoogieIcfgContainer [2021-03-25 04:45:18,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:45:18,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:45:18,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:45:18,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:45:18,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:45:16" (1/3) ... [2021-03-25 04:45:18,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64eadbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:45:18, skipping insertion in model container [2021-03-25 04:45:18,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:16" (2/3) ... [2021-03-25 04:45:18,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64eadbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:45:18, skipping insertion in model container [2021-03-25 04:45:18,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:45:18" (3/3) ... [2021-03-25 04:45:18,427 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_pso.opt.i [2021-03-25 04:45:18,433 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:45:18,437 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:45:18,438 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:45:18,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,480 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,480 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,480 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,480 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,484 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,484 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,490 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,490 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,490 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,490 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,490 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,490 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,491 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,491 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,496 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,496 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,497 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,498 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,500 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,500 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,512 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,512 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,513 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:18,514 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:45:18,530 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:45:18,555 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:45:18,555 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:45:18,555 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:45:18,555 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:45:18,555 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:45:18,555 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:45:18,556 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:45:18,556 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:45:18,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow [2021-03-25 04:45:18,624 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-25 04:45:18,624 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:18,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 04:45:18,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 118 transitions, 256 flow [2021-03-25 04:45:18,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 114 transitions, 240 flow [2021-03-25 04:45:18,631 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:18,636 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-25 04:45:18,638 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-25 04:45:18,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 240 flow [2021-03-25 04:45:18,653 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-25 04:45:18,653 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:18,654 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 04:45:18,656 INFO L142 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-25 04:45:19,711 WARN L205 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-25 04:45:20,227 WARN L205 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-25 04:45:21,286 WARN L205 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-25 04:45:21,802 WARN L205 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:45:22,398 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:45:22,738 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-25 04:45:22,850 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 04:45:23,778 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 04:45:24,025 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 04:45:24,572 WARN L205 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:45:25,146 WARN L205 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:45:25,377 INFO L154 LiptonReduction]: Checked pairs total: 4482 [2021-03-25 04:45:25,378 INFO L156 LiptonReduction]: Total number of compositions: 78 [2021-03-25 04:45:25,379 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6749 [2021-03-25 04:45:25,392 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-25 04:45:25,393 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:25,393 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:25,393 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:25,393 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:25,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:25,397 INFO L82 PathProgramCache]: Analyzing trace with hash 778215304, now seen corresponding path program 1 times [2021-03-25 04:45:25,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:25,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521828399] [2021-03-25 04:45:25,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:25,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:25,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:25,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:25,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:25,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521828399] [2021-03-25 04:45:25,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:25,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:45:25,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122094538] [2021-03-25 04:45:25,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:45:25,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:25,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:45:25,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:45:25,610 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 196 [2021-03-25 04:45:25,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:25,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:25,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 196 [2021-03-25 04:45:25,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:25,657 INFO L129 PetriNetUnfolder]: 23/107 cut-off events. [2021-03-25 04:45:25,658 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:25,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 107 events. 23/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 353 event pairs, 9 based on Foata normal form. 5/102 useless extension candidates. Maximal degree in co-relation 146. Up to 37 conditions per place. [2021-03-25 04:45:25,660 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 7 selfloop transitions, 2 changer transitions 5/47 dead transitions. [2021-03-25 04:45:25,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 128 flow [2021-03-25 04:45:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:45:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:45:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2021-03-25 04:45:25,674 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9064625850340136 [2021-03-25 04:45:25,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 533 transitions. [2021-03-25 04:45:25,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 533 transitions. [2021-03-25 04:45:25,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:25,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 533 transitions. [2021-03-25 04:45:25,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:25,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:25,690 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:25,691 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 533 transitions. [2021-03-25 04:45:25,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 128 flow [2021-03-25 04:45:25,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 47 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:45:25,695 INFO L241 Difference]: Finished difference. Result has 54 places, 39 transitions, 90 flow [2021-03-25 04:45:25,696 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2021-03-25 04:45:25,697 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-25 04:45:25,697 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:25,697 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 39 transitions, 90 flow [2021-03-25 04:45:25,698 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 39 transitions, 90 flow [2021-03-25 04:45:25,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 90 flow [2021-03-25 04:45:25,711 INFO L129 PetriNetUnfolder]: 0/39 cut-off events. [2021-03-25 04:45:25,711 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:25,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:45:25,711 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-25 04:45:26,113 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:45:26,415 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:45:27,049 WARN L205 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-25 04:45:27,624 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-25 04:45:28,198 INFO L154 LiptonReduction]: Checked pairs total: 1820 [2021-03-25 04:45:28,198 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-25 04:45:28,198 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2501 [2021-03-25 04:45:28,199 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-25 04:45:28,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:28,199 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:28,200 INFO L263 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] [2021-03-25 04:45:28,200 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:45:28,201 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:28,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:28,205 INFO L82 PathProgramCache]: Analyzing trace with hash -418335220, now seen corresponding path program 1 times [2021-03-25 04:45:28,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:28,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219322984] [2021-03-25 04:45:28,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:28,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:28,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:28,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:28,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:28,329 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:45:28,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:45:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:28,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219322984] [2021-03-25 04:45:28,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:28,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:28,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625885815] [2021-03-25 04:45:28,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:45:28,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:28,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:45:28,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:45:28,335 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 206 [2021-03-25 04:45:28,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 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) [2021-03-25 04:45:28,335 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:28,335 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 206 [2021-03-25 04:45:28,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:28,346 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-25 04:45:28,346 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:28,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:45:28,346 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 1 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2021-03-25 04:45:28,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 76 flow [2021-03-25 04:45:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:45:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:45:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2021-03-25 04:45:28,348 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8948220064724919 [2021-03-25 04:45:28,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 553 transitions. [2021-03-25 04:45:28,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 553 transitions. [2021-03-25 04:45:28,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:28,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 553 transitions. [2021-03-25 04:45:28,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:28,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:28,350 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:28,350 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 553 transitions. [2021-03-25 04:45:28,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 76 flow [2021-03-25 04:45:28,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:45:28,351 INFO L241 Difference]: Finished difference. Result has 41 places, 28 transitions, 72 flow [2021-03-25 04:45:28,351 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2021-03-25 04:45:28,352 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -17 predicate places. [2021-03-25 04:45:28,352 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:28,352 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 72 flow [2021-03-25 04:45:28,352 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 72 flow [2021-03-25 04:45:28,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2021-03-25 04:45:28,355 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-25 04:45:28,355 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:45:28,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:45:28,355 INFO L142 LiptonReduction]: Number of co-enabled transitions 328 [2021-03-25 04:45:29,184 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 04:45:29,329 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 04:45:29,648 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 04:45:29,797 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 04:45:29,800 INFO L154 LiptonReduction]: Checked pairs total: 1088 [2021-03-25 04:45:29,800 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:45:29,800 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1448 [2021-03-25 04:45:29,801 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2021-03-25 04:45:29,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 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) [2021-03-25 04:45:29,801 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:29,801 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:29,801 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:45:29,801 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:29,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:29,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2113504574, now seen corresponding path program 1 times [2021-03-25 04:45:29,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:29,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224422155] [2021-03-25 04:45:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:29,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:29,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:29,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:29,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:45:29,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:29,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:45:29,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:29,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:45:29,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:29,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:45:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:29,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224422155] [2021-03-25 04:45:29,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:29,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:45:29,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229965940] [2021-03-25 04:45:29,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:45:29,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:29,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:45:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:45:29,967 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 209 [2021-03-25 04:45:29,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:29,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:29,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 209 [2021-03-25 04:45:29,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:30,021 INFO L129 PetriNetUnfolder]: 21/72 cut-off events. [2021-03-25 04:45:30,022 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-25 04:45:30,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 72 events. 21/72 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 207 event pairs, 8 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 136. Up to 40 conditions per place. [2021-03-25 04:45:30,023 INFO L132 encePairwiseOnDemand]: 204/209 looper letters, 8 selfloop transitions, 5 changer transitions 0/31 dead transitions. [2021-03-25 04:45:30,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 107 flow [2021-03-25 04:45:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:45:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:45:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 670 transitions. [2021-03-25 04:45:30,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8014354066985646 [2021-03-25 04:45:30,027 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 670 transitions. [2021-03-25 04:45:30,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 670 transitions. [2021-03-25 04:45:30,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:30,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 670 transitions. [2021-03-25 04:45:30,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.5) internal successors, (670), 4 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,031 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,032 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 4 states and 670 transitions. [2021-03-25 04:45:30,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 107 flow [2021-03-25 04:45:30,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 101 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:45:30,033 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 95 flow [2021-03-25 04:45:30,033 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-25 04:45:30,033 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -18 predicate places. [2021-03-25 04:45:30,033 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:30,033 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 95 flow [2021-03-25 04:45:30,034 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 95 flow [2021-03-25 04:45:30,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 95 flow [2021-03-25 04:45:30,038 INFO L129 PetriNetUnfolder]: 2/35 cut-off events. [2021-03-25 04:45:30,038 INFO L130 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2021-03-25 04:45:30,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 35 events. 2/35 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 57. Up to 7 conditions per place. [2021-03-25 04:45:30,039 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-25 04:45:30,040 INFO L154 LiptonReduction]: Checked pairs total: 393 [2021-03-25 04:45:30,040 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:30,041 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-25 04:45:30,041 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 95 flow [2021-03-25 04:45:30,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:30,042 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:30,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:45:30,042 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:30,042 INFO L82 PathProgramCache]: Analyzing trace with hash -597919760, now seen corresponding path program 1 times [2021-03-25 04:45:30,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:30,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057439837] [2021-03-25 04:45:30,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:30,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:30,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:45:30,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:30,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 04:45:30,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:30,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 04:45:30,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:30,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 04:45:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:30,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057439837] [2021-03-25 04:45:30,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:30,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:30,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366674394] [2021-03-25 04:45:30,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:45:30,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:30,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:45:30,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:45:30,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 209 [2021-03-25 04:45:30,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:30,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 209 [2021-03-25 04:45:30,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:30,260 INFO L129 PetriNetUnfolder]: 25/75 cut-off events. [2021-03-25 04:45:30,261 INFO L130 PetriNetUnfolder]: For 29/31 co-relation queries the response was YES. [2021-03-25 04:45:30,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 75 events. 25/75 cut-off events. For 29/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 210 event pairs, 4 based on Foata normal form. 3/77 useless extension candidates. Maximal degree in co-relation 178. Up to 41 conditions per place. [2021-03-25 04:45:30,261 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 9 selfloop transitions, 10 changer transitions 0/37 dead transitions. [2021-03-25 04:45:30,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 154 flow [2021-03-25 04:45:30,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:45:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:45:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions. [2021-03-25 04:45:30,267 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8248803827751197 [2021-03-25 04:45:30,267 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 862 transitions. [2021-03-25 04:45:30,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions. [2021-03-25 04:45:30,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:30,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions. [2021-03-25 04:45:30,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.4) internal successors, (862), 5 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,274 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,274 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 95 flow. Second operand 5 states and 862 transitions. [2021-03-25 04:45:30,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 154 flow [2021-03-25 04:45:30,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:45:30,277 INFO L241 Difference]: Finished difference. Result has 46 places, 35 transitions, 152 flow [2021-03-25 04:45:30,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2021-03-25 04:45:30,277 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -12 predicate places. [2021-03-25 04:45:30,277 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:30,277 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 152 flow [2021-03-25 04:45:30,277 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 152 flow [2021-03-25 04:45:30,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 152 flow [2021-03-25 04:45:30,290 INFO L129 PetriNetUnfolder]: 22/73 cut-off events. [2021-03-25 04:45:30,290 INFO L130 PetriNetUnfolder]: For 53/64 co-relation queries the response was YES. [2021-03-25 04:45:30,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 73 events. 22/73 cut-off events. For 53/64 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 229 event pairs, 4 based on Foata normal form. 2/69 useless extension candidates. Maximal degree in co-relation 185. Up to 33 conditions per place. [2021-03-25 04:45:30,292 INFO L142 LiptonReduction]: Number of co-enabled transitions 436 [2021-03-25 04:45:30,481 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 04:45:30,867 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 04:45:30,997 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 04:45:31,002 INFO L154 LiptonReduction]: Checked pairs total: 831 [2021-03-25 04:45:31,002 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:45:31,002 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 725 [2021-03-25 04:45:31,002 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 156 flow [2021-03-25 04:45:31,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,003 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:31,003 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:31,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:45:31,003 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:31,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:31,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1629789170, now seen corresponding path program 2 times [2021-03-25 04:45:31,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:31,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914067721] [2021-03-25 04:45:31,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:31,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:45:31,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:45:31,076 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 04:45:31,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 04:45:31,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:45:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:31,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914067721] [2021-03-25 04:45:31,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:31,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:45:31,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013373399] [2021-03-25 04:45:31,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:45:31,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:31,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:45:31,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:45:31,106 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 210 [2021-03-25 04:45:31,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:31,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 210 [2021-03-25 04:45:31,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:31,171 INFO L129 PetriNetUnfolder]: 26/79 cut-off events. [2021-03-25 04:45:31,171 INFO L130 PetriNetUnfolder]: For 96/119 co-relation queries the response was YES. [2021-03-25 04:45:31,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 79 events. 26/79 cut-off events. For 96/119 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 233 event pairs, 6 based on Foata normal form. 7/83 useless extension candidates. Maximal degree in co-relation 260. Up to 42 conditions per place. [2021-03-25 04:45:31,173 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 11 selfloop transitions, 10 changer transitions 0/39 dead transitions. [2021-03-25 04:45:31,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 222 flow [2021-03-25 04:45:31,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:45:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:45:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 832 transitions. [2021-03-25 04:45:31,176 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7923809523809524 [2021-03-25 04:45:31,176 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 832 transitions. [2021-03-25 04:45:31,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 832 transitions. [2021-03-25 04:45:31,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:31,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 832 transitions. [2021-03-25 04:45:31,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,181 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,181 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 156 flow. Second operand 5 states and 832 transitions. [2021-03-25 04:45:31,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 222 flow [2021-03-25 04:45:31,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 210 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 04:45:31,185 INFO L241 Difference]: Finished difference. Result has 50 places, 37 transitions, 187 flow [2021-03-25 04:45:31,185 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2021-03-25 04:45:31,185 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2021-03-25 04:45:31,185 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:31,186 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 37 transitions, 187 flow [2021-03-25 04:45:31,186 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 37 transitions, 187 flow [2021-03-25 04:45:31,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 187 flow [2021-03-25 04:45:31,196 INFO L129 PetriNetUnfolder]: 22/74 cut-off events. [2021-03-25 04:45:31,196 INFO L130 PetriNetUnfolder]: For 119/134 co-relation queries the response was YES. [2021-03-25 04:45:31,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 74 events. 22/74 cut-off events. For 119/134 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 242 event pairs, 4 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 220. Up to 33 conditions per place. [2021-03-25 04:45:31,197 INFO L142 LiptonReduction]: Number of co-enabled transitions 462 [2021-03-25 04:45:31,213 INFO L154 LiptonReduction]: Checked pairs total: 441 [2021-03-25 04:45:31,213 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:31,213 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-25 04:45:31,214 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 187 flow [2021-03-25 04:45:31,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,214 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:31,214 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:31,214 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:45:31,214 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:31,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1244470832, now seen corresponding path program 3 times [2021-03-25 04:45:31,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:31,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828200533] [2021-03-25 04:45:31,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:31,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:45:31,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:45:31,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 04:45:31,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:45:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:31,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828200533] [2021-03-25 04:45:31,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:31,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:45:31,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296226448] [2021-03-25 04:45:31,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:45:31,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:31,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:45:31,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:45:31,299 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 210 [2021-03-25 04:45:31,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:31,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 210 [2021-03-25 04:45:31,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:31,377 INFO L129 PetriNetUnfolder]: 25/85 cut-off events. [2021-03-25 04:45:31,378 INFO L130 PetriNetUnfolder]: For 170/186 co-relation queries the response was YES. [2021-03-25 04:45:31,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 85 events. 25/85 cut-off events. For 170/186 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 283 event pairs, 1 based on Foata normal form. 8/92 useless extension candidates. Maximal degree in co-relation 288. Up to 34 conditions per place. [2021-03-25 04:45:31,379 INFO L132 encePairwiseOnDemand]: 204/210 looper letters, 11 selfloop transitions, 14 changer transitions 0/43 dead transitions. [2021-03-25 04:45:31,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 281 flow [2021-03-25 04:45:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:45:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:45:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 838 transitions. [2021-03-25 04:45:31,381 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7980952380952381 [2021-03-25 04:45:31,381 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 838 transitions. [2021-03-25 04:45:31,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 838 transitions. [2021-03-25 04:45:31,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:31,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 838 transitions. [2021-03-25 04:45:31,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,384 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,384 INFO L185 Difference]: Start difference. First operand has 50 places, 37 transitions, 187 flow. Second operand 5 states and 838 transitions. [2021-03-25 04:45:31,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 281 flow [2021-03-25 04:45:31,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 260 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 04:45:31,388 INFO L241 Difference]: Finished difference. Result has 52 places, 41 transitions, 243 flow [2021-03-25 04:45:31,388 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2021-03-25 04:45:31,388 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2021-03-25 04:45:31,389 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:31,389 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 243 flow [2021-03-25 04:45:31,389 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 243 flow [2021-03-25 04:45:31,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 243 flow [2021-03-25 04:45:31,403 INFO L129 PetriNetUnfolder]: 21/76 cut-off events. [2021-03-25 04:45:31,403 INFO L130 PetriNetUnfolder]: For 178/190 co-relation queries the response was YES. [2021-03-25 04:45:31,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 76 events. 21/76 cut-off events. For 178/190 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 250 event pairs, 2 based on Foata normal form. 7/79 useless extension candidates. Maximal degree in co-relation 255. Up to 33 conditions per place. [2021-03-25 04:45:31,404 INFO L142 LiptonReduction]: Number of co-enabled transitions 514 [2021-03-25 04:45:31,407 INFO L154 LiptonReduction]: Checked pairs total: 573 [2021-03-25 04:45:31,407 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:31,407 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-25 04:45:31,408 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 243 flow [2021-03-25 04:45:31,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:31,408 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:31,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:45:31,409 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:31,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:31,409 INFO L82 PathProgramCache]: Analyzing trace with hash -596453491, now seen corresponding path program 1 times [2021-03-25 04:45:31,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:31,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437961892] [2021-03-25 04:45:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:31,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:31,471 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:45:31,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:45:31,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:31,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437961892] [2021-03-25 04:45:31,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:31,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:31,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832357522] [2021-03-25 04:45:31,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:45:31,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:31,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:45:31,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:45:31,478 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 210 [2021-03-25 04:45:31,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:31,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 210 [2021-03-25 04:45:31,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:31,551 INFO L129 PetriNetUnfolder]: 225/431 cut-off events. [2021-03-25 04:45:31,551 INFO L130 PetriNetUnfolder]: For 740/901 co-relation queries the response was YES. [2021-03-25 04:45:31,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 431 events. 225/431 cut-off events. For 740/901 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 2416 event pairs, 96 based on Foata normal form. 58/444 useless extension candidates. Maximal degree in co-relation 1302. Up to 240 conditions per place. [2021-03-25 04:45:31,556 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 12 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2021-03-25 04:45:31,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 313 flow [2021-03-25 04:45:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:45:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:45:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 897 transitions. [2021-03-25 04:45:31,558 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8542857142857143 [2021-03-25 04:45:31,558 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 897 transitions. [2021-03-25 04:45:31,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 897 transitions. [2021-03-25 04:45:31,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:31,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 897 transitions. [2021-03-25 04:45:31,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,561 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,561 INFO L185 Difference]: Start difference. First operand has 52 places, 41 transitions, 243 flow. Second operand 5 states and 897 transitions. [2021-03-25 04:45:31,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 313 flow [2021-03-25 04:45:31,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 303 flow, removed 5 selfloop flow, removed 0 redundant places. [2021-03-25 04:45:31,566 INFO L241 Difference]: Finished difference. Result has 59 places, 50 transitions, 316 flow [2021-03-25 04:45:31,566 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2021-03-25 04:45:31,566 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2021-03-25 04:45:31,566 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:31,566 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 50 transitions, 316 flow [2021-03-25 04:45:31,567 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 50 transitions, 316 flow [2021-03-25 04:45:31,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 50 transitions, 316 flow [2021-03-25 04:45:31,602 INFO L129 PetriNetUnfolder]: 208/400 cut-off events. [2021-03-25 04:45:31,602 INFO L130 PetriNetUnfolder]: For 780/922 co-relation queries the response was YES. [2021-03-25 04:45:31,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 400 events. 208/400 cut-off events. For 780/922 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2203 event pairs, 81 based on Foata normal form. 13/376 useless extension candidates. Maximal degree in co-relation 1442. Up to 230 conditions per place. [2021-03-25 04:45:31,607 INFO L142 LiptonReduction]: Number of co-enabled transitions 742 [2021-03-25 04:45:31,618 INFO L154 LiptonReduction]: Checked pairs total: 564 [2021-03-25 04:45:31,618 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:31,618 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-03-25 04:45:31,619 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 316 flow [2021-03-25 04:45:31,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,620 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:31,620 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:31,620 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:45:31,620 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:31,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:31,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1747881383, now seen corresponding path program 1 times [2021-03-25 04:45:31,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:31,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861995786] [2021-03-25 04:45:31,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:31,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:31,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:31,673 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:45:31,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:45:31,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:31,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861995786] [2021-03-25 04:45:31,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:31,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:45:31,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623811031] [2021-03-25 04:45:31,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:45:31,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:31,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:45:31,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:45:31,681 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 210 [2021-03-25 04:45:31,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,683 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:31,683 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 210 [2021-03-25 04:45:31,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:31,756 INFO L129 PetriNetUnfolder]: 170/353 cut-off events. [2021-03-25 04:45:31,756 INFO L130 PetriNetUnfolder]: For 1021/1720 co-relation queries the response was YES. [2021-03-25 04:45:31,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 353 events. 170/353 cut-off events. For 1021/1720 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 1877 event pairs, 28 based on Foata normal form. 103/419 useless extension candidates. Maximal degree in co-relation 1444. Up to 237 conditions per place. [2021-03-25 04:45:31,759 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 12 selfloop transitions, 19 changer transitions 0/63 dead transitions. [2021-03-25 04:45:31,759 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 454 flow [2021-03-25 04:45:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:45:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:45:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1256 transitions. [2021-03-25 04:45:31,762 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.854421768707483 [2021-03-25 04:45:31,762 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1256 transitions. [2021-03-25 04:45:31,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1256 transitions. [2021-03-25 04:45:31,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:31,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1256 transitions. [2021-03-25 04:45:31,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 179.42857142857142) internal successors, (1256), 7 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 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) [2021-03-25 04:45:31,766 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 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) [2021-03-25 04:45:31,766 INFO L185 Difference]: Start difference. First operand has 59 places, 50 transitions, 316 flow. Second operand 7 states and 1256 transitions. [2021-03-25 04:45:31,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 454 flow [2021-03-25 04:45:31,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 449 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:45:31,770 INFO L241 Difference]: Finished difference. Result has 67 places, 59 transitions, 453 flow [2021-03-25 04:45:31,770 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=453, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2021-03-25 04:45:31,770 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2021-03-25 04:45:31,770 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:31,771 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 59 transitions, 453 flow [2021-03-25 04:45:31,771 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 59 transitions, 453 flow [2021-03-25 04:45:31,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 59 transitions, 453 flow [2021-03-25 04:45:31,798 INFO L129 PetriNetUnfolder]: 152/318 cut-off events. [2021-03-25 04:45:31,798 INFO L130 PetriNetUnfolder]: For 1238/1702 co-relation queries the response was YES. [2021-03-25 04:45:31,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 318 events. 152/318 cut-off events. For 1238/1702 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1677 event pairs, 25 based on Foata normal form. 12/301 useless extension candidates. Maximal degree in co-relation 1500. Up to 205 conditions per place. [2021-03-25 04:45:31,802 INFO L142 LiptonReduction]: Number of co-enabled transitions 898 [2021-03-25 04:45:31,808 INFO L154 LiptonReduction]: Checked pairs total: 642 [2021-03-25 04:45:31,808 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:31,808 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-25 04:45:31,808 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 453 flow [2021-03-25 04:45:31,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,809 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:31,809 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:31,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:45:31,809 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:31,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:31,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1378011776, now seen corresponding path program 1 times [2021-03-25 04:45:31,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:31,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142573467] [2021-03-25 04:45:31,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:31,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:31,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:31,850 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-25 04:45:31,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 04:45:31,862 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-25 04:45:31,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 04:45:31,874 INFO L142 QuantifierPusher]: treesize reduction 14, result has 39.1 percent of original size [2021-03-25 04:45:31,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:45:31,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:31,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:45:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:31,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142573467] [2021-03-25 04:45:31,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:31,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:45:31,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518535702] [2021-03-25 04:45:31,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:45:31,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:31,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:45:31,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:45:31,887 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 210 [2021-03-25 04:45:31,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 453 flow. Second operand has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:31,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:31,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 210 [2021-03-25 04:45:31,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:32,125 INFO L129 PetriNetUnfolder]: 583/1163 cut-off events. [2021-03-25 04:45:32,125 INFO L130 PetriNetUnfolder]: For 6118/7723 co-relation queries the response was YES. [2021-03-25 04:45:32,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5803 conditions, 1163 events. 583/1163 cut-off events. For 6118/7723 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 8426 event pairs, 67 based on Foata normal form. 102/1168 useless extension candidates. Maximal degree in co-relation 5775. Up to 789 conditions per place. [2021-03-25 04:45:32,134 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 41 selfloop transitions, 18 changer transitions 2/98 dead transitions. [2021-03-25 04:45:32,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 98 transitions, 962 flow [2021-03-25 04:45:32,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:45:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:45:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1191 transitions. [2021-03-25 04:45:32,136 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.810204081632653 [2021-03-25 04:45:32,136 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1191 transitions. [2021-03-25 04:45:32,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1191 transitions. [2021-03-25 04:45:32,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:32,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1191 transitions. [2021-03-25 04:45:32,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 170.14285714285714) internal successors, (1191), 7 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:32,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 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) [2021-03-25 04:45:32,141 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 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) [2021-03-25 04:45:32,141 INFO L185 Difference]: Start difference. First operand has 67 places, 59 transitions, 453 flow. Second operand 7 states and 1191 transitions. [2021-03-25 04:45:32,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 98 transitions, 962 flow [2021-03-25 04:45:32,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 98 transitions, 912 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-25 04:45:32,154 INFO L241 Difference]: Finished difference. Result has 75 places, 74 transitions, 658 flow [2021-03-25 04:45:32,155 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=658, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2021-03-25 04:45:32,155 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2021-03-25 04:45:32,156 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:32,156 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 74 transitions, 658 flow [2021-03-25 04:45:32,156 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 74 transitions, 658 flow [2021-03-25 04:45:32,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 74 transitions, 658 flow [2021-03-25 04:45:32,227 INFO L129 PetriNetUnfolder]: 452/881 cut-off events. [2021-03-25 04:45:32,227 INFO L130 PetriNetUnfolder]: For 5412/5818 co-relation queries the response was YES. [2021-03-25 04:45:32,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4109 conditions, 881 events. 452/881 cut-off events. For 5412/5818 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 5890 event pairs, 71 based on Foata normal form. 33/817 useless extension candidates. Maximal degree in co-relation 4079. Up to 546 conditions per place. [2021-03-25 04:45:32,237 INFO L142 LiptonReduction]: Number of co-enabled transitions 1252 [2021-03-25 04:45:32,500 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:45:32,836 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 04:45:32,947 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:45:32,982 INFO L154 LiptonReduction]: Checked pairs total: 1083 [2021-03-25 04:45:32,982 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:45:32,982 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 826 [2021-03-25 04:45:32,982 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 660 flow [2021-03-25 04:45:32,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:32,983 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:32,983 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:32,983 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:45:32,983 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash 334627750, now seen corresponding path program 2 times [2021-03-25 04:45:32,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:32,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25842750] [2021-03-25 04:45:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:33,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:33,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:33,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:33,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:33,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:33,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:33,022 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:45:33,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:45:33,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:33,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:33,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25842750] [2021-03-25 04:45:33,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:33,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:45:33,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672030633] [2021-03-25 04:45:33,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:45:33,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:33,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:45:33,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:45:33,030 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 211 [2021-03-25 04:45:33,031 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 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) [2021-03-25 04:45:33,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:33,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 211 [2021-03-25 04:45:33,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:33,174 INFO L129 PetriNetUnfolder]: 385/818 cut-off events. [2021-03-25 04:45:33,174 INFO L130 PetriNetUnfolder]: For 8084/10354 co-relation queries the response was YES. [2021-03-25 04:45:33,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4118 conditions, 818 events. 385/818 cut-off events. For 8084/10354 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 5670 event pairs, 9 based on Foata normal form. 473/1206 useless extension candidates. Maximal degree in co-relation 4086. Up to 519 conditions per place. [2021-03-25 04:45:33,181 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 6 selfloop transitions, 28 changer transitions 6/80 dead transitions. [2021-03-25 04:45:33,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 80 transitions, 776 flow [2021-03-25 04:45:33,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 04:45:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 04:45:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1624 transitions. [2021-03-25 04:45:33,184 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8551869404949973 [2021-03-25 04:45:33,184 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1624 transitions. [2021-03-25 04:45:33,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1624 transitions. [2021-03-25 04:45:33,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:33,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1624 transitions. [2021-03-25 04:45:33,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 180.44444444444446) internal successors, (1624), 9 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:33,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:33,190 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:33,190 INFO L185 Difference]: Start difference. First operand has 75 places, 74 transitions, 660 flow. Second operand 9 states and 1624 transitions. [2021-03-25 04:45:33,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 80 transitions, 776 flow [2021-03-25 04:45:33,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 80 transitions, 725 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 04:45:33,197 INFO L241 Difference]: Finished difference. Result has 82 places, 74 transitions, 665 flow [2021-03-25 04:45:33,198 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=665, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2021-03-25 04:45:33,198 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 24 predicate places. [2021-03-25 04:45:33,198 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:33,198 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 74 transitions, 665 flow [2021-03-25 04:45:33,198 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 74 transitions, 665 flow [2021-03-25 04:45:33,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 74 transitions, 665 flow [2021-03-25 04:45:33,250 INFO L129 PetriNetUnfolder]: 313/684 cut-off events. [2021-03-25 04:45:33,251 INFO L130 PetriNetUnfolder]: For 4706/5002 co-relation queries the response was YES. [2021-03-25 04:45:33,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3646 conditions, 684 events. 313/684 cut-off events. For 4706/5002 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 4775 event pairs, 9 based on Foata normal form. 12/623 useless extension candidates. Maximal degree in co-relation 3613. Up to 418 conditions per place. [2021-03-25 04:45:33,259 INFO L142 LiptonReduction]: Number of co-enabled transitions 1324 [2021-03-25 04:45:33,445 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:45:33,791 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:45:33,892 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:45:34,059 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:45:34,479 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:45:34,598 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:45:34,612 INFO L154 LiptonReduction]: Checked pairs total: 1234 [2021-03-25 04:45:34,612 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 04:45:34,613 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1415 [2021-03-25 04:45:34,613 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 643 flow [2021-03-25 04:45:34,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 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) [2021-03-25 04:45:34,613 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:34,613 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:34,614 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:45:34,614 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:34,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:34,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2038151015, now seen corresponding path program 1 times [2021-03-25 04:45:34,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:34,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298640848] [2021-03-25 04:45:34,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:34,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:34,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:34,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:34,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:34,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:34,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:34,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:34,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:34,665 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:45:34,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:45:34,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:34,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:34,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298640848] [2021-03-25 04:45:34,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:34,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:45:34,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695058459] [2021-03-25 04:45:34,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:45:34,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:34,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:45:34,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:45:34,675 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 213 [2021-03-25 04:45:34,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 71 transitions, 643 flow. Second operand has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:34,676 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:34,676 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 213 [2021-03-25 04:45:34,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:34,759 INFO L129 PetriNetUnfolder]: 114/279 cut-off events. [2021-03-25 04:45:34,759 INFO L130 PetriNetUnfolder]: For 2524/2867 co-relation queries the response was YES. [2021-03-25 04:45:34,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1505 conditions, 279 events. 114/279 cut-off events. For 2524/2867 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1458 event pairs, 0 based on Foata normal form. 98/359 useless extension candidates. Maximal degree in co-relation 1470. Up to 184 conditions per place. [2021-03-25 04:45:34,762 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 2 selfloop transitions, 18 changer transitions 4/64 dead transitions. [2021-03-25 04:45:34,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 64 transitions, 615 flow [2021-03-25 04:45:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:45:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:45:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1450 transitions. [2021-03-25 04:45:34,765 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8509389671361502 [2021-03-25 04:45:34,765 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1450 transitions. [2021-03-25 04:45:34,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1450 transitions. [2021-03-25 04:45:34,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:34,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1450 transitions. [2021-03-25 04:45:34,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 181.25) internal successors, (1450), 8 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:34,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:34,770 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:34,770 INFO L185 Difference]: Start difference. First operand has 82 places, 71 transitions, 643 flow. Second operand 8 states and 1450 transitions. [2021-03-25 04:45:34,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 64 transitions, 615 flow [2021-03-25 04:45:34,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 525 flow, removed 35 selfloop flow, removed 8 redundant places. [2021-03-25 04:45:34,778 INFO L241 Difference]: Finished difference. Result has 76 places, 60 transitions, 489 flow [2021-03-25 04:45:34,778 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=489, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2021-03-25 04:45:34,778 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2021-03-25 04:45:34,778 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:34,778 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 60 transitions, 489 flow [2021-03-25 04:45:34,778 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 60 transitions, 489 flow [2021-03-25 04:45:34,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 60 transitions, 489 flow [2021-03-25 04:45:34,799 INFO L129 PetriNetUnfolder]: 93/240 cut-off events. [2021-03-25 04:45:34,800 INFO L130 PetriNetUnfolder]: For 681/728 co-relation queries the response was YES. [2021-03-25 04:45:34,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 240 events. 93/240 cut-off events. For 681/728 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1208 event pairs, 0 based on Foata normal form. 3/226 useless extension candidates. Maximal degree in co-relation 999. Up to 95 conditions per place. [2021-03-25 04:45:34,803 INFO L142 LiptonReduction]: Number of co-enabled transitions 728 [2021-03-25 04:45:35,421 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-25 04:45:35,639 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 04:45:37,060 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 338 DAG size of output: 264 [2021-03-25 04:45:37,580 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-25 04:45:37,841 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 04:45:38,078 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 04:45:38,576 WARN L205 SmtUtils]: Spent 495.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 04:45:39,074 WARN L205 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 04:45:39,082 INFO L154 LiptonReduction]: Checked pairs total: 1253 [2021-03-25 04:45:39,082 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:45:39,082 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4304 [2021-03-25 04:45:39,083 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 473 flow [2021-03-25 04:45:39,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:39,083 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:39,083 INFO L263 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] [2021-03-25 04:45:39,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:45:39,083 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:39,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:39,084 INFO L82 PathProgramCache]: Analyzing trace with hash -370089508, now seen corresponding path program 1 times [2021-03-25 04:45:39,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:39,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939003615] [2021-03-25 04:45:39,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:39,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:39,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:39,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:39,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:39,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:39,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:39,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939003615] [2021-03-25 04:45:39,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:39,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:39,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131915076] [2021-03-25 04:45:39,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:45:39,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:45:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:45:39,116 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 215 [2021-03-25 04:45:39,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 473 flow. Second operand has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:39,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:39,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 215 [2021-03-25 04:45:39,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:39,160 INFO L129 PetriNetUnfolder]: 194/423 cut-off events. [2021-03-25 04:45:39,161 INFO L130 PetriNetUnfolder]: For 4558/4863 co-relation queries the response was YES. [2021-03-25 04:45:39,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 423 events. 194/423 cut-off events. For 4558/4863 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2534 event pairs, 0 based on Foata normal form. 33/390 useless extension candidates. Maximal degree in co-relation 1689. Up to 174 conditions per place. [2021-03-25 04:45:39,164 INFO L132 encePairwiseOnDemand]: 212/215 looper letters, 3 selfloop transitions, 2 changer transitions 11/58 dead transitions. [2021-03-25 04:45:39,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 58 transitions, 485 flow [2021-03-25 04:45:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:45:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:45:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 746 transitions. [2021-03-25 04:45:39,165 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8674418604651163 [2021-03-25 04:45:39,166 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 746 transitions. [2021-03-25 04:45:39,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 746 transitions. [2021-03-25 04:45:39,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:39,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 746 transitions. [2021-03-25 04:45:39,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.5) internal successors, (746), 4 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:39,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:39,168 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:39,168 INFO L185 Difference]: Start difference. First operand has 72 places, 57 transitions, 473 flow. Second operand 4 states and 746 transitions. [2021-03-25 04:45:39,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 58 transitions, 485 flow [2021-03-25 04:45:39,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 58 transitions, 416 flow, removed 19 selfloop flow, removed 8 redundant places. [2021-03-25 04:45:39,174 INFO L241 Difference]: Finished difference. Result has 69 places, 47 transitions, 295 flow [2021-03-25 04:45:39,174 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=69, PETRI_TRANSITIONS=47} [2021-03-25 04:45:39,174 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2021-03-25 04:45:39,174 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:39,174 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 47 transitions, 295 flow [2021-03-25 04:45:39,175 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 47 transitions, 295 flow [2021-03-25 04:45:39,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 47 transitions, 295 flow [2021-03-25 04:45:39,192 INFO L129 PetriNetUnfolder]: 122/295 cut-off events. [2021-03-25 04:45:39,193 INFO L130 PetriNetUnfolder]: For 531/549 co-relation queries the response was YES. [2021-03-25 04:45:39,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 295 events. 122/295 cut-off events. For 531/549 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1702 event pairs, 0 based on Foata normal form. 4/266 useless extension candidates. Maximal degree in co-relation 857. Up to 100 conditions per place. [2021-03-25 04:45:39,195 INFO L142 LiptonReduction]: Number of co-enabled transitions 550 [2021-03-25 04:45:39,198 INFO L154 LiptonReduction]: Checked pairs total: 156 [2021-03-25 04:45:39,198 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:39,198 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-25 04:45:39,198 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 295 flow [2021-03-25 04:45:39,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:39,199 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:39,199 INFO L263 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] [2021-03-25 04:45:39,199 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:45:39,199 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:39,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1912512441, now seen corresponding path program 1 times [2021-03-25 04:45:39,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:39,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166894645] [2021-03-25 04:45:39,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:39,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:39,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:39,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:39,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:39,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:39,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:39,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166894645] [2021-03-25 04:45:39,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:39,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:39,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443356640] [2021-03-25 04:45:39,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:45:39,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:39,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:45:39,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:45:39,230 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 215 [2021-03-25 04:45:39,231 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:39,231 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:39,231 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 215 [2021-03-25 04:45:39,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:39,293 INFO L129 PetriNetUnfolder]: 266/593 cut-off events. [2021-03-25 04:45:39,293 INFO L130 PetriNetUnfolder]: For 2907/3079 co-relation queries the response was YES. [2021-03-25 04:45:39,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1800 conditions, 593 events. 266/593 cut-off events. For 2907/3079 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 3867 event pairs, 0 based on Foata normal form. 35/556 useless extension candidates. Maximal degree in co-relation 1770. Up to 210 conditions per place. [2021-03-25 04:45:39,296 INFO L132 encePairwiseOnDemand]: 212/215 looper letters, 3 selfloop transitions, 2 changer transitions 8/48 dead transitions. [2021-03-25 04:45:39,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 48 transitions, 307 flow [2021-03-25 04:45:39,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:45:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:45:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 746 transitions. [2021-03-25 04:45:39,297 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8674418604651163 [2021-03-25 04:45:39,298 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 746 transitions. [2021-03-25 04:45:39,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 746 transitions. [2021-03-25 04:45:39,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:39,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 746 transitions. [2021-03-25 04:45:39,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.5) internal successors, (746), 4 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:39,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:39,300 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:39,300 INFO L185 Difference]: Start difference. First operand has 66 places, 47 transitions, 295 flow. Second operand 4 states and 746 transitions. [2021-03-25 04:45:39,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 48 transitions, 307 flow [2021-03-25 04:45:39,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 48 transitions, 288 flow, removed 9 selfloop flow, removed 3 redundant places. [2021-03-25 04:45:39,307 INFO L241 Difference]: Finished difference. Result has 68 places, 40 transitions, 231 flow [2021-03-25 04:45:39,307 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=68, PETRI_TRANSITIONS=40} [2021-03-25 04:45:39,307 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2021-03-25 04:45:39,307 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:39,307 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 40 transitions, 231 flow [2021-03-25 04:45:39,307 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 40 transitions, 231 flow [2021-03-25 04:45:39,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 40 transitions, 231 flow [2021-03-25 04:45:39,319 INFO L129 PetriNetUnfolder]: 70/184 cut-off events. [2021-03-25 04:45:39,319 INFO L130 PetriNetUnfolder]: For 556/593 co-relation queries the response was YES. [2021-03-25 04:45:39,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 184 events. 70/184 cut-off events. For 556/593 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 848 event pairs, 0 based on Foata normal form. 8/166 useless extension candidates. Maximal degree in co-relation 534. Up to 62 conditions per place. [2021-03-25 04:45:39,321 INFO L142 LiptonReduction]: Number of co-enabled transitions 360 [2021-03-25 04:45:39,661 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 74 [2021-03-25 04:45:39,952 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 93 [2021-03-25 04:45:40,013 INFO L154 LiptonReduction]: Checked pairs total: 172 [2021-03-25 04:45:40,013 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 04:45:40,013 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 706 [2021-03-25 04:45:40,014 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 234 flow [2021-03-25 04:45:40,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:40,014 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:40,014 INFO L263 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] [2021-03-25 04:45:40,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:45:40,014 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:40,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:40,014 INFO L82 PathProgramCache]: Analyzing trace with hash 228611528, now seen corresponding path program 1 times [2021-03-25 04:45:40,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:40,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73228723] [2021-03-25 04:45:40,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:45:40,030 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:45:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:45:40,045 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:45:40,065 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:45:40,065 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:45:40,066 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 04:45:40,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:45:40 BasicIcfg [2021-03-25 04:45:40,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:45:40,178 INFO L168 Benchmark]: Toolchain (without parser) took 23946.52 ms. Allocated memory was 417.3 MB in the beginning and 1.0 GB in the end (delta: 597.7 MB). Free memory was 380.7 MB in the beginning and 985.3 MB in the end (delta: -604.6 MB). Peak memory consumption was 587.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:45:40,178 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 417.3 MB. Free memory is still 398.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:45:40,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.14 ms. Allocated memory is still 417.3 MB. Free memory was 380.5 MB in the beginning and 376.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB. [2021-03-25 04:45:40,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.74 ms. Allocated memory is still 417.3 MB. Free memory was 376.8 MB in the beginning and 373.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:45:40,179 INFO L168 Benchmark]: Boogie Preprocessor took 47.67 ms. Allocated memory is still 417.3 MB. Free memory was 373.6 MB in the beginning and 371.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:45:40,179 INFO L168 Benchmark]: RCFGBuilder took 1623.26 ms. Allocated memory is still 417.3 MB. Free memory was 371.0 MB in the beginning and 337.2 MB in the end (delta: 33.8 MB). Peak memory consumption was 159.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:45:40,179 INFO L168 Benchmark]: TraceAbstraction took 21755.59 ms. Allocated memory was 417.3 MB in the beginning and 1.0 GB in the end (delta: 597.7 MB). Free memory was 337.2 MB in the beginning and 985.3 MB in the end (delta: -648.2 MB). Peak memory consumption was 542.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:45:40,180 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.49 ms. Allocated memory is still 417.3 MB. Free memory is still 398.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 442.14 ms. Allocated memory is still 417.3 MB. Free memory was 380.5 MB in the beginning and 376.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 71.74 ms. Allocated memory is still 417.3 MB. Free memory was 376.8 MB in the beginning and 373.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 47.67 ms. Allocated memory is still 417.3 MB. Free memory was 373.6 MB in the beginning and 371.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1623.26 ms. Allocated memory is still 417.3 MB. Free memory was 371.0 MB in the beginning and 337.2 MB in the end (delta: 33.8 MB). Peak memory consumption was 159.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21755.59 ms. Allocated memory was 417.3 MB in the beginning and 1.0 GB in the end (delta: 597.7 MB). Free memory was 337.2 MB in the beginning and 985.3 MB in the end (delta: -648.2 MB). Peak memory consumption was 542.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6739.6ms, 125 PlacesBefore, 58 PlacesAfterwards, 114 TransitionsBefore, 46 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 4482 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2352, positive: 2252, positive conditional: 0, positive unconditional: 2252, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1290, positive: 1259, positive conditional: 0, positive unconditional: 1259, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1290, positive: 1259, positive conditional: 0, positive unconditional: 1259, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2352, positive: 993, positive conditional: 0, positive unconditional: 993, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 1290, unknown conditional: 0, unknown unconditional: 1290] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2500.1ms, 54 PlacesBefore, 40 PlacesAfterwards, 39 TransitionsBefore, 29 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 1820 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 529, positive: 424, positive conditional: 0, positive unconditional: 424, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 36, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 529, positive: 395, positive conditional: 0, positive unconditional: 395, negative: 98, negative conditional: 0, negative unconditional: 98, unknown: 36, unknown conditional: 0, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1447.9ms, 41 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1088 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 334, positive: 267, positive conditional: 0, positive unconditional: 267, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 334, positive: 263, positive conditional: 0, positive unconditional: 263, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 139, Positive conditional cache size: 0, Positive unconditional cache size: 139, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6ms, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 393 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 135, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 135, positive: 108, positive conditional: 0, positive unconditional: 108, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 724.7ms, 46 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 831 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 326, positive: 286, positive conditional: 0, positive unconditional: 286, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 326, positive: 278, positive conditional: 0, positive unconditional: 278, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.4ms, 50 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 441 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 146, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 146, positive: 122, positive conditional: 0, positive unconditional: 122, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.8ms, 52 PlacesBefore, 52 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 573 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 201, positive: 175, positive conditional: 0, positive unconditional: 175, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 201, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.0ms, 59 PlacesBefore, 59 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 742 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 564 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 192, positive: 174, positive conditional: 0, positive unconditional: 174, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 192, positive: 173, positive conditional: 0, positive unconditional: 173, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.1ms, 67 PlacesBefore, 67 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 898 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 642 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 250, positive: 232, positive conditional: 0, positive unconditional: 232, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 250, positive: 231, positive conditional: 0, positive unconditional: 231, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 825.4ms, 75 PlacesBefore, 75 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1252 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1083 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 386, positive: 362, positive conditional: 0, positive unconditional: 362, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 386, positive: 358, positive conditional: 0, positive unconditional: 358, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 159, Positive conditional cache size: 0, Positive unconditional cache size: 159, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1414.0ms, 82 PlacesBefore, 82 PlacesAfterwards, 74 TransitionsBefore, 71 TransitionsAfterwards, 1324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 1234 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 616, positive: 594, positive conditional: 0, positive unconditional: 594, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 616, positive: 586, positive conditional: 0, positive unconditional: 586, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4304.1ms, 76 PlacesBefore, 72 PlacesAfterwards, 60 TransitionsBefore, 57 TransitionsAfterwards, 728 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1253 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 833, positive: 800, positive conditional: 0, positive unconditional: 800, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 833, positive: 791, positive conditional: 0, positive unconditional: 791, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.3ms, 69 PlacesBefore, 66 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 156 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 105, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 105, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 705.9ms, 68 PlacesBefore, 61 PlacesAfterwards, 40 TransitionsBefore, 37 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 172 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 109, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 109, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1141; [L849] FCALL, FORK 0 pthread_create(&t1141, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1142; [L851] FCALL, FORK 0 pthread_create(&t1142, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1143; [L853] FCALL, FORK 0 pthread_create(&t1143, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 pthread_t t1144; [L855] FCALL, FORK 0 pthread_create(&t1144, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L861] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L865] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L873] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L875] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L877] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L877] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L878] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 10.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21519.4ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1310.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6826.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 56 SDtfs, 39 SDslu, 42 SDs, 0 SdLazy, 371 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 335.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 290.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=665occurred in iteration=10, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 32.9ms SsaConstructionTime, 317.7ms SatisfiabilityAnalysisTime, 715.5ms InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...