/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/safe004_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:58:55,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:58:55,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:58:55,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:58:55,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:58:55,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:58:55,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:58:55,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:58:55,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:58:55,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:58:55,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:58:55,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:58:55,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:58:55,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:58:55,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:58:55,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:58:55,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:58:55,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:58:55,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:58:55,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:58:55,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:58:55,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:58:55,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:58:55,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:58:55,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:58:55,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:58:55,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:58:55,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:58:55,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:58:55,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:58:55,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:58:55,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:58:55,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:58:55,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:58:55,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:58:55,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:58:55,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:58:55,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:58:55,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:58:55,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:58:55,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:58:55,865 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:58:55,890 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:58:55,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:58:55,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:58:55,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:58:55,893 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:58:55,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:58:55,894 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:58:55,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:58:55,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:58:55,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:58:55,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:58:55,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:58:55,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:58:55,895 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:58:55,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:58:55,895 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:58:55,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:58:55,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:58:55,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:58:55,896 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:58:55,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:58:55,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:58:55,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:58:55,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:58:55,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:58:55,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:58:55,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:58:55,896 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:58:55,896 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:58:55,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:58:55,897 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:58:56,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:58:56,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:58:56,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:58:56,202 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:58:56,203 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:58:56,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.oepc.i [2021-03-25 04:58:56,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d40066f/d11f86d020c14ade814b903fee868730/FLAG7fa1c8838 [2021-03-25 04:58:56,675 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:58:56,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_pso.oepc.i [2021-03-25 04:58:56,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d40066f/d11f86d020c14ade814b903fee868730/FLAG7fa1c8838 [2021-03-25 04:58:56,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d40066f/d11f86d020c14ade814b903fee868730 [2021-03-25 04:58:56,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:58:57,000 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:58:57,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:58:57,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:58:57,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:58:57,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:58:56" (1/1) ... [2021-03-25 04:58:57,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a9852f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:58:57, skipping insertion in model container [2021-03-25 04:58:57,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:58:56" (1/1) ... [2021-03-25 04:58:57,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:58:57,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:58:57,169 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/safe004_pso.oepc.i[950,963] [2021-03-25 04:58:57,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:58:57,350 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:58:57,358 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/safe004_pso.oepc.i[950,963] [2021-03-25 04:58:57,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:58:57,486 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:58:57,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:58:57 WrapperNode [2021-03-25 04:58:57,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:58:57,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:58:57,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:58:57,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:58:57,494 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:58:57" (1/1) ... [2021-03-25 04:58:57,508 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:58:57" (1/1) ... [2021-03-25 04:58:57,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:58:57,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:58:57,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:58:57,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:58:57,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:58:57" (1/1) ... [2021-03-25 04:58:57,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:58:57" (1/1) ... [2021-03-25 04:58:57,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:58:57" (1/1) ... [2021-03-25 04:58:57,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:58:57" (1/1) ... [2021-03-25 04:58:57,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:58:57" (1/1) ... [2021-03-25 04:58:57,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:58:57" (1/1) ... [2021-03-25 04:58:57,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:58:57" (1/1) ... [2021-03-25 04:58:57,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:58:57,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:58:57,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:58:57,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:58:57,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:58:57" (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:58:57,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:58:57,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:58:57,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:58:57,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:58:57,657 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:58:57,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:58:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:58:57,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:58:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:58:57,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:58:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:58:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:58:57,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:58:57,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:58:57,660 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:58:59,906 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:58:59,907 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:58:59,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:58:59 BoogieIcfgContainer [2021-03-25 04:58:59,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:58:59,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:58:59,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:58:59,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:58:59,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:58:56" (1/3) ... [2021-03-25 04:58:59,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157c57f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:58:59, skipping insertion in model container [2021-03-25 04:58:59,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:58:57" (2/3) ... [2021-03-25 04:58:59,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157c57f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:58:59, skipping insertion in model container [2021-03-25 04:58:59,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:58:59" (3/3) ... [2021-03-25 04:58:59,913 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_pso.oepc.i [2021-03-25 04:58:59,929 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:58:59,935 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:58:59,935 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:58:59,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,986 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,986 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,986 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,986 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,986 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,986 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,987 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,987 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,990 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,990 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,990 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,990 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,992 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,993 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,993 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,993 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:58:59,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,018 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,018 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,019 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:59:00,029 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:59:00,041 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 04:59:00,053 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:59:00,053 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:59:00,053 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:59:00,053 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:59:00,053 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:59:00,053 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:59:00,053 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:59:00,053 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:59:00,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-25 04:59:00,082 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-25 04:59:00,082 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:59:00,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 04:59:00,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-25 04:59:00,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-25 04:59:00,089 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:00,095 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-25 04:59:00,096 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-25 04:59:00,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-25 04:59:00,110 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-25 04:59:00,110 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:59:00,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 04:59:00,112 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-25 04:59:01,269 WARN L205 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 175 [2021-03-25 04:59:01,542 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-25 04:59:02,779 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 299 DAG size of output: 255 [2021-03-25 04:59:03,300 WARN L205 SmtUtils]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 04:59:03,519 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:59:03,883 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 04:59:04,038 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:59:04,862 WARN L205 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-25 04:59:05,329 WARN L205 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-25 04:59:06,764 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 04:59:07,317 WARN L205 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 04:59:07,768 INFO L154 LiptonReduction]: Checked pairs total: 3074 [2021-03-25 04:59:07,768 INFO L156 LiptonReduction]: Total number of compositions: 61 [2021-03-25 04:59:07,769 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7681 [2021-03-25 04:59:07,782 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-25 04:59:07,782 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:59:07,782 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:07,783 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:07,783 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:07,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:07,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1884620492, now seen corresponding path program 1 times [2021-03-25 04:59:07,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:07,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209934720] [2021-03-25 04:59:07,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:07,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:07,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:59:07,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:07,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:07,988 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:59:07,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209934720] [2021-03-25 04:59:07,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:07,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:59:07,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795645151] [2021-03-25 04:59:07,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:59:07,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:08,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:59:08,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:59:08,005 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 158 [2021-03-25 04:59:08,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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:59:08,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:08,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 158 [2021-03-25 04:59:08,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:08,113 INFO L129 PetriNetUnfolder]: 115/347 cut-off events. [2021-03-25 04:59:08,113 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:59:08,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 347 events. 115/347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2009 event pairs, 92 based on Foata normal form. 21/336 useless extension candidates. Maximal degree in co-relation 526. Up to 141 conditions per place. [2021-03-25 04:59:08,119 INFO L132 encePairwiseOnDemand]: 154/158 looper letters, 13 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2021-03-25 04:59:08,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 123 flow [2021-03-25 04:59:08,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:59:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:59:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2021-03-25 04:59:08,134 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8860759493670886 [2021-03-25 04:59:08,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2021-03-25 04:59:08,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2021-03-25 04:59:08,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:08,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2021-03-25 04:59:08,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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:59:08,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:08,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:08,152 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 420 transitions. [2021-03-25 04:59:08,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 123 flow [2021-03-25 04:59:08,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 04:59:08,155 INFO L241 Difference]: Finished difference. Result has 45 places, 36 transitions, 82 flow [2021-03-25 04:59:08,156 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2021-03-25 04:59:08,157 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-25 04:59:08,157 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:08,157 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 82 flow [2021-03-25 04:59:08,158 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 82 flow [2021-03-25 04:59:08,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 82 flow [2021-03-25 04:59:08,163 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-25 04:59:08,163 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:59:08,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:59:08,165 INFO L142 LiptonReduction]: Number of co-enabled transitions 360 [2021-03-25 04:59:08,411 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 04:59:08,552 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 04:59:08,856 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:59:09,121 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:59:10,276 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 268 DAG size of output: 267 [2021-03-25 04:59:10,826 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:59:11,419 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-03-25 04:59:11,704 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-03-25 04:59:12,352 WARN L205 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-03-25 04:59:12,974 WARN L205 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-03-25 04:59:13,298 INFO L154 LiptonReduction]: Checked pairs total: 1020 [2021-03-25 04:59:13,298 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 04:59:13,298 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5141 [2021-03-25 04:59:13,299 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-25 04:59:13,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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:59:13,299 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:13,299 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:59:13,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:59:13,299 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:13,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:13,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1189168933, now seen corresponding path program 1 times [2021-03-25 04:59:13,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:13,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494376444] [2021-03-25 04:59:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:13,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:13,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:59:13,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:13,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:13,457 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:59:13,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:59:13,460 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:59:13,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494376444] [2021-03-25 04:59:13,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:13,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:59:13,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088847626] [2021-03-25 04:59:13,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:59:13,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:13,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:59:13,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:59:13,463 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 170 [2021-03-25 04:59:13,464 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 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:59:13,464 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:13,464 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 170 [2021-03-25 04:59:13,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:13,515 INFO L129 PetriNetUnfolder]: 1/28 cut-off events. [2021-03-25 04:59:13,515 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:59:13,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 34. Up to 3 conditions per place. [2021-03-25 04:59:13,516 INFO L132 encePairwiseOnDemand]: 166/170 looper letters, 1 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2021-03-25 04:59:13,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 76 flow [2021-03-25 04:59:13,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:59:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:59:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2021-03-25 04:59:13,518 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8670588235294118 [2021-03-25 04:59:13,518 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2021-03-25 04:59:13,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2021-03-25 04:59:13,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:13,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2021-03-25 04:59:13,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 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:59:13,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:13,522 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:13,522 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 5 states and 737 transitions. [2021-03-25 04:59:13,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 76 flow [2021-03-25 04:59:13,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:59:13,522 INFO L241 Difference]: Finished difference. Result has 37 places, 23 transitions, 60 flow [2021-03-25 04:59:13,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2021-03-25 04:59:13,523 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2021-03-25 04:59:13,523 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:13,523 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 60 flow [2021-03-25 04:59:13,523 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 60 flow [2021-03-25 04:59:13,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-25 04:59:13,526 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 04:59:13,526 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:59:13,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:59:13,527 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-25 04:59:14,031 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 04:59:14,169 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 04:59:14,464 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 04:59:14,605 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 04:59:14,607 INFO L154 LiptonReduction]: Checked pairs total: 777 [2021-03-25 04:59:14,608 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:59:14,608 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1085 [2021-03-25 04:59:14,608 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-25 04:59:14,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 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:59:14,609 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:14,609 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:14,609 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:59:14,609 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash 938114414, now seen corresponding path program 1 times [2021-03-25 04:59:14,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:14,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831716562] [2021-03-25 04:59:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:14,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:14,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:59:14,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:14,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:59:14,765 INFO L142 QuantifierPusher]: treesize reduction 19, result has 42.4 percent of original size [2021-03-25 04:59:14,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:59:14,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:14,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:59:14,791 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:59:14,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831716562] [2021-03-25 04:59:14,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:14,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:59:14,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411969409] [2021-03-25 04:59:14,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:59:14,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:14,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:59:14,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:59:14,795 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 172 [2021-03-25 04:59:14,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 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:59:14,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:14,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 172 [2021-03-25 04:59:14,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:14,928 INFO L129 PetriNetUnfolder]: 326/552 cut-off events. [2021-03-25 04:59:14,928 INFO L130 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2021-03-25 04:59:14,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 552 events. 326/552 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2504 event pairs, 168 based on Foata normal form. 9/548 useless extension candidates. Maximal degree in co-relation 1161. Up to 462 conditions per place. [2021-03-25 04:59:14,932 INFO L132 encePairwiseOnDemand]: 164/172 looper letters, 17 selfloop transitions, 8 changer transitions 0/34 dead transitions. [2021-03-25 04:59:14,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 138 flow [2021-03-25 04:59:14,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:59:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:59:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2021-03-25 04:59:14,934 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7892441860465116 [2021-03-25 04:59:14,934 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2021-03-25 04:59:14,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2021-03-25 04:59:14,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:14,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2021-03-25 04:59:14,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 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:59:14,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 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:59:14,937 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 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:59:14,937 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 543 transitions. [2021-03-25 04:59:14,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 138 flow [2021-03-25 04:59:14,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:59:14,938 INFO L241 Difference]: Finished difference. Result has 34 places, 28 transitions, 108 flow [2021-03-25 04:59:14,938 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2021-03-25 04:59:14,939 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-25 04:59:14,939 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:14,939 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 108 flow [2021-03-25 04:59:14,940 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 108 flow [2021-03-25 04:59:14,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 108 flow [2021-03-25 04:59:14,952 INFO L129 PetriNetUnfolder]: 39/110 cut-off events. [2021-03-25 04:59:14,952 INFO L130 PetriNetUnfolder]: For 50/54 co-relation queries the response was YES. [2021-03-25 04:59:14,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 110 events. 39/110 cut-off events. For 50/54 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 494 event pairs, 20 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 243. Up to 67 conditions per place. [2021-03-25 04:59:14,953 INFO L142 LiptonReduction]: Number of co-enabled transitions 256 [2021-03-25 04:59:14,955 INFO L154 LiptonReduction]: Checked pairs total: 146 [2021-03-25 04:59:14,955 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:59:14,955 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-25 04:59:14,955 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 108 flow [2021-03-25 04:59:14,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 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:59:14,956 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:14,956 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:14,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:59:14,956 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:14,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:14,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1413989524, now seen corresponding path program 1 times [2021-03-25 04:59:14,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:14,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962189073] [2021-03-25 04:59:14,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:15,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:15,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:15,065 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:59:15,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962189073] [2021-03-25 04:59:15,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:15,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:59:15,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318533273] [2021-03-25 04:59:15,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:59:15,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:15,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:59:15,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:59:15,066 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 172 [2021-03-25 04:59:15,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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:59:15,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:15,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 172 [2021-03-25 04:59:15,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:15,086 INFO L129 PetriNetUnfolder]: 29/89 cut-off events. [2021-03-25 04:59:15,087 INFO L130 PetriNetUnfolder]: For 88/100 co-relation queries the response was YES. [2021-03-25 04:59:15,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 89 events. 29/89 cut-off events. For 88/100 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 16 based on Foata normal form. 5/93 useless extension candidates. Maximal degree in co-relation 210. Up to 52 conditions per place. [2021-03-25 04:59:15,087 INFO L132 encePairwiseOnDemand]: 169/172 looper letters, 1 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-25 04:59:15,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 116 flow [2021-03-25 04:59:15,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:59:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:59:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2021-03-25 04:59:15,089 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9031007751937985 [2021-03-25 04:59:15,089 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2021-03-25 04:59:15,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2021-03-25 04:59:15,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:15,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2021-03-25 04:59:15,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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:59:15,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:15,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:15,092 INFO L185 Difference]: Start difference. First operand has 34 places, 28 transitions, 108 flow. Second operand 3 states and 466 transitions. [2021-03-25 04:59:15,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 116 flow [2021-03-25 04:59:15,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:59:15,094 INFO L241 Difference]: Finished difference. Result has 37 places, 28 transitions, 119 flow [2021-03-25 04:59:15,094 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2021-03-25 04:59:15,094 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2021-03-25 04:59:15,094 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:15,094 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 119 flow [2021-03-25 04:59:15,095 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 119 flow [2021-03-25 04:59:15,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 119 flow [2021-03-25 04:59:15,106 INFO L129 PetriNetUnfolder]: 35/101 cut-off events. [2021-03-25 04:59:15,106 INFO L130 PetriNetUnfolder]: For 72/76 co-relation queries the response was YES. [2021-03-25 04:59:15,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 101 events. 35/101 cut-off events. For 72/76 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 408 event pairs, 15 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 239. Up to 55 conditions per place. [2021-03-25 04:59:15,108 INFO L142 LiptonReduction]: Number of co-enabled transitions 256 [2021-03-25 04:59:15,109 INFO L154 LiptonReduction]: Checked pairs total: 146 [2021-03-25 04:59:15,110 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:59:15,110 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-25 04:59:15,111 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 119 flow [2021-03-25 04:59:15,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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:59:15,111 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:15,111 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:15,111 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:59:15,111 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:15,112 INFO L82 PathProgramCache]: Analyzing trace with hash 860640059, now seen corresponding path program 1 times [2021-03-25 04:59:15,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:15,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437099320] [2021-03-25 04:59:15,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:15,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:15,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:59:15,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:15,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:15,227 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:59:15,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437099320] [2021-03-25 04:59:15,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:15,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:59:15,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172458077] [2021-03-25 04:59:15,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:59:15,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:15,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:59:15,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:59:15,228 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 172 [2021-03-25 04:59:15,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 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:59:15,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:15,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 172 [2021-03-25 04:59:15,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:15,335 INFO L129 PetriNetUnfolder]: 338/638 cut-off events. [2021-03-25 04:59:15,335 INFO L130 PetriNetUnfolder]: For 498/511 co-relation queries the response was YES. [2021-03-25 04:59:15,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1752 conditions, 638 events. 338/638 cut-off events. For 498/511 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3569 event pairs, 70 based on Foata normal form. 29/655 useless extension candidates. Maximal degree in co-relation 1737. Up to 286 conditions per place. [2021-03-25 04:59:15,339 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 17 selfloop transitions, 6 changer transitions 7/44 dead transitions. [2021-03-25 04:59:15,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 242 flow [2021-03-25 04:59:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:59:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:59:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2021-03-25 04:59:15,341 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7616279069767442 [2021-03-25 04:59:15,341 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2021-03-25 04:59:15,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2021-03-25 04:59:15,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:15,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2021-03-25 04:59:15,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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:59:15,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 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:59:15,345 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 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:59:15,345 INFO L185 Difference]: Start difference. First operand has 37 places, 28 transitions, 119 flow. Second operand 4 states and 524 transitions. [2021-03-25 04:59:15,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 242 flow [2021-03-25 04:59:15,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 224 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 04:59:15,349 INFO L241 Difference]: Finished difference. Result has 39 places, 31 transitions, 143 flow [2021-03-25 04:59:15,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2021-03-25 04:59:15,349 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2021-03-25 04:59:15,349 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:15,349 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 143 flow [2021-03-25 04:59:15,349 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 143 flow [2021-03-25 04:59:15,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 143 flow [2021-03-25 04:59:15,364 INFO L129 PetriNetUnfolder]: 42/135 cut-off events. [2021-03-25 04:59:15,364 INFO L130 PetriNetUnfolder]: For 96/102 co-relation queries the response was YES. [2021-03-25 04:59:15,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 135 events. 42/135 cut-off events. For 96/102 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 670 event pairs, 25 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 324. Up to 70 conditions per place. [2021-03-25 04:59:15,365 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-25 04:59:15,367 INFO L154 LiptonReduction]: Checked pairs total: 62 [2021-03-25 04:59:15,367 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:59:15,367 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-25 04:59:15,369 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 143 flow [2021-03-25 04:59:15,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 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:59:15,369 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:15,370 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:15,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:59:15,370 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:15,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1122954413, now seen corresponding path program 2 times [2021-03-25 04:59:15,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:15,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630958790] [2021-03-25 04:59:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:15,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:15,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:59:15,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:15,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:59:15,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:15,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 04:59:15,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:15,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 04:59:15,527 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:59:15,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630958790] [2021-03-25 04:59:15,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:15,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:59:15,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852932915] [2021-03-25 04:59:15,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:59:15,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:15,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:59:15,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:59:15,529 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 172 [2021-03-25 04:59:15,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 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:59:15,529 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:15,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 172 [2021-03-25 04:59:15,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:15,695 INFO L129 PetriNetUnfolder]: 249/492 cut-off events. [2021-03-25 04:59:15,695 INFO L130 PetriNetUnfolder]: For 595/618 co-relation queries the response was YES. [2021-03-25 04:59:15,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 492 events. 249/492 cut-off events. For 595/618 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2577 event pairs, 33 based on Foata normal form. 31/517 useless extension candidates. Maximal degree in co-relation 1471. Up to 288 conditions per place. [2021-03-25 04:59:15,698 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 19 selfloop transitions, 9 changer transitions 4/46 dead transitions. [2021-03-25 04:59:15,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 274 flow [2021-03-25 04:59:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:59:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:59:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 497 transitions. [2021-03-25 04:59:15,700 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7223837209302325 [2021-03-25 04:59:15,700 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 497 transitions. [2021-03-25 04:59:15,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 497 transitions. [2021-03-25 04:59:15,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:15,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 497 transitions. [2021-03-25 04:59:15,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 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:59:15,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 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:59:15,703 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 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:59:15,703 INFO L185 Difference]: Start difference. First operand has 39 places, 31 transitions, 143 flow. Second operand 4 states and 497 transitions. [2021-03-25 04:59:15,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 274 flow [2021-03-25 04:59:15,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 262 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:59:15,705 INFO L241 Difference]: Finished difference. Result has 42 places, 36 transitions, 202 flow [2021-03-25 04:59:15,705 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2021-03-25 04:59:15,705 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2021-03-25 04:59:15,705 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:15,706 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 202 flow [2021-03-25 04:59:15,706 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 202 flow [2021-03-25 04:59:15,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 202 flow [2021-03-25 04:59:15,733 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1669] L860-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= 0 (mod v_~y$w_buff1_used~0_636 256))) (.cse19 (= (mod v_~y$r_buff1_thd0~0_207 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd0~0_260 256) 0))) (let ((.cse10 (not .cse9)) (.cse6 (and .cse9 .cse19)) (.cse7 (and .cse18 .cse9)) (.cse17 (= (mod v_~y$w_buff0_used~0_806 256) 0)) (.cse0 (= (mod v_~weak$$choice2~0_262 256) 0))) (let ((.cse1 (not .cse0)) (.cse12 (or .cse6 .cse7 .cse17)) (.cse3 (or (not .cse19) .cse10)) (.cse4 (or (not .cse18) .cse10)) (.cse11 (not .cse17))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_146 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_42 1) (= v_~__unbuffered_p2_EAX~0_44 1) (= v_~x~0_37 2) (= v_~y~0_329 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_36) (or (and .cse0 (= v_~y~0_327 v_~y~0_329)) (and .cse1 (= v_~y~0_327 v_~y$mem_tmp~0_90))) (let ((.cse5 (= |v_ULTIMATE.start_main_#t~ite91_68| |v_ULTIMATE.start_main_#t~ite91_67|))) (or (and (= v_~y$w_buff1_used~0_635 |v_ULTIMATE.start_main_#t~ite92_58|) (let ((.cse2 (= (mod v_~y$w_buff0_used~0_805 256) 0))) (or (and (not .cse2) (= |v_ULTIMATE.start_main_#t~ite92_58| |v_ULTIMATE.start_main_#t~ite91_68|) .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite91_68| 0)) (and .cse5 (= v_~y$w_buff1_used~0_636 |v_ULTIMATE.start_main_#t~ite92_58|) (or .cse6 .cse7 .cse2)))) .cse0) (and .cse5 .cse1 (= |v_ULTIMATE.start_main_#t~ite92_58| |v_ULTIMATE.start_main_#t~ite92_57|) (= v_~y$w_buff1_used~0_636 v_~y$w_buff1_used~0_635)))) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite88_56| |v_ULTIMATE.start_main_#t~ite88_55|))) (or (and .cse8 (= |v_ULTIMATE.start_main_#t~ite89_54| |v_ULTIMATE.start_main_#t~ite89_53|) .cse1 (= v_~y$w_buff0_used~0_806 v_~y$w_buff0_used~0_805)) (and .cse0 (= v_~y$w_buff0_used~0_805 |v_ULTIMATE.start_main_#t~ite89_54|) (or (and .cse3 .cse4 (or (and .cse9 (= v_~y$w_buff0_used~0_806 |v_ULTIMATE.start_main_#t~ite88_56|)) (and (= |v_ULTIMATE.start_main_#t~ite88_56| 0) .cse10)) (= |v_ULTIMATE.start_main_#t~ite88_56| |v_ULTIMATE.start_main_#t~ite89_54|) .cse11) (and .cse8 (= v_~y$w_buff0_used~0_806 |v_ULTIMATE.start_main_#t~ite89_54|) .cse12))))) (= |v_ULTIMATE.start_main_#t~nondet78_47| v_~weak$$choice0~0_57) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite82_64| |v_ULTIMATE.start_main_#t~ite82_63|))) (or (and (= v_~y$w_buff0~0_271 v_~y$w_buff0~0_270) .cse1 (= |v_ULTIMATE.start_main_#t~ite83_58| |v_ULTIMATE.start_main_#t~ite83_57|) .cse13) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite83_58| v_~y$w_buff0~0_270) (or (and .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite83_58| |v_ULTIMATE.start_main_#t~ite82_64|) (= |v_ULTIMATE.start_main_#t~ite82_64| v_~y$w_buff0~0_271) .cse11) (and (= |v_ULTIMATE.start_main_#t~ite83_58| v_~y$w_buff0~0_271) .cse12 .cse13))))) (= v_~y~0_328 v_~y$mem_tmp~0_90) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite85_56| |v_ULTIMATE.start_main_#t~ite85_55|))) (or (and .cse1 (= v_~y$w_buff1~0_262 v_~y$w_buff1~0_261) (= |v_ULTIMATE.start_main_#t~ite86_49| |v_ULTIMATE.start_main_#t~ite86_50|) .cse14) (and (or (and .cse3 .cse4 (= v_~y$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite85_56|) .cse11 (= |v_ULTIMATE.start_main_#t~ite85_56| |v_ULTIMATE.start_main_#t~ite86_50|)) (and .cse12 (= v_~y$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite86_50|) .cse14)) .cse0 (= v_~y$w_buff1~0_261 |v_ULTIMATE.start_main_#t~ite86_50|)))) (let ((.cse15 (= |v_ULTIMATE.start_main_#t~ite97_82| |v_ULTIMATE.start_main_#t~ite97_81|))) (or (and .cse0 (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite98_78|) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite98_78|) .cse15) (and (= v_~y$r_buff1_thd0~0_207 v_~y$r_buff1_thd0~0_206) .cse1 (= |v_ULTIMATE.start_main_#t~ite98_78| |v_ULTIMATE.start_main_#t~ite98_77|) .cse15))) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~weak$$choice2~0_262 |v_ULTIMATE.start_main_#t~nondet79_53|) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite94_68| |v_ULTIMATE.start_main_#t~ite94_67|))) (or (and (= |v_ULTIMATE.start_main_#t~ite95_64| |v_ULTIMATE.start_main_#t~ite95_63|) .cse16 (= v_~y$r_buff0_thd0~0_260 v_~y$r_buff0_thd0~0_259) .cse1) (and .cse0 .cse16 (= v_~y$r_buff0_thd0~0_260 |v_ULTIMATE.start_main_#t~ite95_64|) (= v_~y$r_buff0_thd0~0_259 |v_ULTIMATE.start_main_#t~ite95_64|)))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite80_59| |v_ULTIMATE.start_main_#t~ite80_60|) (= v_~y~0_329 v_~y~0_328)) (and .cse3 .cse4 (= v_~y~0_329 |v_ULTIMATE.start_main_#t~ite80_60|) (or (and (= v_~y$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite80_60|) .cse9) (and (= |v_ULTIMATE.start_main_#t~ite80_60| v_~y$w_buff0~0_271) .cse10)) .cse11)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_806, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_53|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_47|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_53|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_55|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_49|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_63|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_67|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_57|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_67|, ~y$w_buff0~0=v_~y$w_buff0~0_271, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~y~0=v_~y~0_328, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_77|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_55|, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_57|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_63|, ~y$w_buff1~0=v_~y$w_buff1~0_262, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_59|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_260, ~x~0=v_~x~0_37, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_636} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_805, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_52|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_52|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_54|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_38|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_48|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_44|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_62|, ~y$mem_tmp~0=v_~y$mem_tmp~0_90, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_66|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_40|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_56|, ULTIMATE.start_main_#t~ite100=|v_ULTIMATE.start_main_#t~ite100_38|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_66|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_46|, ~y$w_buff0~0=v_~y$w_buff0~0_270, ~y$flush_delayed~0=v_~y$flush_delayed~0_146, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~y~0=v_~y~0_327, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_42|, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_76|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_80|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_54|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_36|, ~weak$$choice0~0=v_~weak$$choice0~0_57, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_56|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_62|, ~y$w_buff1~0=v_~y$w_buff1~0_261, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_34|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_58|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_259, ~weak$$choice2~0=v_~weak$$choice2~0_262, ~x~0=v_~x~0_37, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_635} AuxVars[|v_ULTIMATE.start_main_#t~ite85_56|, |v_ULTIMATE.start_main_#t~ite82_64|, |v_ULTIMATE.start_main_#t~ite89_54|, |v_ULTIMATE.start_main_#t~ite83_58|, v_~y~0_329, |v_ULTIMATE.start_main_#t~ite97_82|, |v_ULTIMATE.start_main_#t~ite98_78|, |v_ULTIMATE.start_main_#t~ite95_64|, |v_ULTIMATE.start_main_#t~ite94_68|, |v_ULTIMATE.start_main_#t~ite92_58|, |v_ULTIMATE.start_main_#t~ite91_68|, |v_ULTIMATE.start_main_#t~ite86_50|, |v_ULTIMATE.start_main_#t~ite80_60|, |v_ULTIMATE.start_main_#t~ite88_56|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet79, ULTIMATE.start_main_#t~nondet78, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite94, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite100, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_#t~ite90, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite99, ULTIMATE.start_main_#t~ite98, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][5], [Black: 124#(and (= ~y$r_buff1_thd0~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0)), 33#L754true, Black: 126#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~y~0 ~x~0)) (not (= 2 ~y~0))) (= ~y$r_buff0_thd0~0 0)), 99#L827true, Black: 132#(<= ~__unbuffered_p2_EBX~0 0), P0Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 140#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0)), 47#L771true, 144#true, 49#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 149#(or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0)), 121#true, Black: 151#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0)) (= ~y$w_buff0~0 0) (= ~y~0 0) (= ~y$w_buff1_used~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0))]) [2021-03-25 04:59:15,734 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-03-25 04:59:15,734 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-25 04:59:15,734 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-25 04:59:15,734 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-25 04:59:15,736 INFO L129 PetriNetUnfolder]: 93/259 cut-off events. [2021-03-25 04:59:15,736 INFO L130 PetriNetUnfolder]: For 383/405 co-relation queries the response was YES. [2021-03-25 04:59:15,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 259 events. 93/259 cut-off events. For 383/405 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1525 event pairs, 37 based on Foata normal form. 2/239 useless extension candidates. Maximal degree in co-relation 732. Up to 138 conditions per place. [2021-03-25 04:59:15,738 INFO L142 LiptonReduction]: Number of co-enabled transitions 288 [2021-03-25 04:59:15,901 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:59:16,279 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:59:16,390 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:59:16,397 INFO L154 LiptonReduction]: Checked pairs total: 193 [2021-03-25 04:59:16,397 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:59:16,398 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 693 [2021-03-25 04:59:16,398 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 204 flow [2021-03-25 04:59:16,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 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:59:16,398 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:16,398 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:16,398 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:59:16,398 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:16,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:16,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1388039868, now seen corresponding path program 1 times [2021-03-25 04:59:16,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:16,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374315376] [2021-03-25 04:59:16,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:16,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:16,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:59:16,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:16,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:16,481 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:59:16,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374315376] [2021-03-25 04:59:16,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:16,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:59:16,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955399110] [2021-03-25 04:59:16,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:59:16,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:16,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:59:16,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:59:16,483 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 173 [2021-03-25 04:59:16,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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:59:16,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:16,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 173 [2021-03-25 04:59:16,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:16,523 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1669] L860-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= 0 (mod v_~y$w_buff1_used~0_636 256))) (.cse19 (= (mod v_~y$r_buff1_thd0~0_207 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd0~0_260 256) 0))) (let ((.cse10 (not .cse9)) (.cse6 (and .cse9 .cse19)) (.cse7 (and .cse18 .cse9)) (.cse17 (= (mod v_~y$w_buff0_used~0_806 256) 0)) (.cse0 (= (mod v_~weak$$choice2~0_262 256) 0))) (let ((.cse1 (not .cse0)) (.cse12 (or .cse6 .cse7 .cse17)) (.cse3 (or (not .cse19) .cse10)) (.cse4 (or (not .cse18) .cse10)) (.cse11 (not .cse17))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_146 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_42 1) (= v_~__unbuffered_p2_EAX~0_44 1) (= v_~x~0_37 2) (= v_~y~0_329 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_36) (or (and .cse0 (= v_~y~0_327 v_~y~0_329)) (and .cse1 (= v_~y~0_327 v_~y$mem_tmp~0_90))) (let ((.cse5 (= |v_ULTIMATE.start_main_#t~ite91_68| |v_ULTIMATE.start_main_#t~ite91_67|))) (or (and (= v_~y$w_buff1_used~0_635 |v_ULTIMATE.start_main_#t~ite92_58|) (let ((.cse2 (= (mod v_~y$w_buff0_used~0_805 256) 0))) (or (and (not .cse2) (= |v_ULTIMATE.start_main_#t~ite92_58| |v_ULTIMATE.start_main_#t~ite91_68|) .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite91_68| 0)) (and .cse5 (= v_~y$w_buff1_used~0_636 |v_ULTIMATE.start_main_#t~ite92_58|) (or .cse6 .cse7 .cse2)))) .cse0) (and .cse5 .cse1 (= |v_ULTIMATE.start_main_#t~ite92_58| |v_ULTIMATE.start_main_#t~ite92_57|) (= v_~y$w_buff1_used~0_636 v_~y$w_buff1_used~0_635)))) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite88_56| |v_ULTIMATE.start_main_#t~ite88_55|))) (or (and .cse8 (= |v_ULTIMATE.start_main_#t~ite89_54| |v_ULTIMATE.start_main_#t~ite89_53|) .cse1 (= v_~y$w_buff0_used~0_806 v_~y$w_buff0_used~0_805)) (and .cse0 (= v_~y$w_buff0_used~0_805 |v_ULTIMATE.start_main_#t~ite89_54|) (or (and .cse3 .cse4 (or (and .cse9 (= v_~y$w_buff0_used~0_806 |v_ULTIMATE.start_main_#t~ite88_56|)) (and (= |v_ULTIMATE.start_main_#t~ite88_56| 0) .cse10)) (= |v_ULTIMATE.start_main_#t~ite88_56| |v_ULTIMATE.start_main_#t~ite89_54|) .cse11) (and .cse8 (= v_~y$w_buff0_used~0_806 |v_ULTIMATE.start_main_#t~ite89_54|) .cse12))))) (= |v_ULTIMATE.start_main_#t~nondet78_47| v_~weak$$choice0~0_57) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite82_64| |v_ULTIMATE.start_main_#t~ite82_63|))) (or (and (= v_~y$w_buff0~0_271 v_~y$w_buff0~0_270) .cse1 (= |v_ULTIMATE.start_main_#t~ite83_58| |v_ULTIMATE.start_main_#t~ite83_57|) .cse13) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite83_58| v_~y$w_buff0~0_270) (or (and .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite83_58| |v_ULTIMATE.start_main_#t~ite82_64|) (= |v_ULTIMATE.start_main_#t~ite82_64| v_~y$w_buff0~0_271) .cse11) (and (= |v_ULTIMATE.start_main_#t~ite83_58| v_~y$w_buff0~0_271) .cse12 .cse13))))) (= v_~y~0_328 v_~y$mem_tmp~0_90) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite85_56| |v_ULTIMATE.start_main_#t~ite85_55|))) (or (and .cse1 (= v_~y$w_buff1~0_262 v_~y$w_buff1~0_261) (= |v_ULTIMATE.start_main_#t~ite86_49| |v_ULTIMATE.start_main_#t~ite86_50|) .cse14) (and (or (and .cse3 .cse4 (= v_~y$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite85_56|) .cse11 (= |v_ULTIMATE.start_main_#t~ite85_56| |v_ULTIMATE.start_main_#t~ite86_50|)) (and .cse12 (= v_~y$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite86_50|) .cse14)) .cse0 (= v_~y$w_buff1~0_261 |v_ULTIMATE.start_main_#t~ite86_50|)))) (let ((.cse15 (= |v_ULTIMATE.start_main_#t~ite97_82| |v_ULTIMATE.start_main_#t~ite97_81|))) (or (and .cse0 (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite98_78|) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite98_78|) .cse15) (and (= v_~y$r_buff1_thd0~0_207 v_~y$r_buff1_thd0~0_206) .cse1 (= |v_ULTIMATE.start_main_#t~ite98_78| |v_ULTIMATE.start_main_#t~ite98_77|) .cse15))) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~weak$$choice2~0_262 |v_ULTIMATE.start_main_#t~nondet79_53|) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite94_68| |v_ULTIMATE.start_main_#t~ite94_67|))) (or (and (= |v_ULTIMATE.start_main_#t~ite95_64| |v_ULTIMATE.start_main_#t~ite95_63|) .cse16 (= v_~y$r_buff0_thd0~0_260 v_~y$r_buff0_thd0~0_259) .cse1) (and .cse0 .cse16 (= v_~y$r_buff0_thd0~0_260 |v_ULTIMATE.start_main_#t~ite95_64|) (= v_~y$r_buff0_thd0~0_259 |v_ULTIMATE.start_main_#t~ite95_64|)))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite80_59| |v_ULTIMATE.start_main_#t~ite80_60|) (= v_~y~0_329 v_~y~0_328)) (and .cse3 .cse4 (= v_~y~0_329 |v_ULTIMATE.start_main_#t~ite80_60|) (or (and (= v_~y$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite80_60|) .cse9) (and (= |v_ULTIMATE.start_main_#t~ite80_60| v_~y$w_buff0~0_271) .cse10)) .cse11)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_806, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_53|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_47|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_53|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_55|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_49|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_63|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_67|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_57|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_67|, ~y$w_buff0~0=v_~y$w_buff0~0_271, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~y~0=v_~y~0_328, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_77|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_55|, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_57|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_63|, ~y$w_buff1~0=v_~y$w_buff1~0_262, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_59|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_260, ~x~0=v_~x~0_37, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_636} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_805, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_52|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_52|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_54|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_38|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_48|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_44|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_62|, ~y$mem_tmp~0=v_~y$mem_tmp~0_90, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_66|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_40|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_56|, ULTIMATE.start_main_#t~ite100=|v_ULTIMATE.start_main_#t~ite100_38|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_66|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_46|, ~y$w_buff0~0=v_~y$w_buff0~0_270, ~y$flush_delayed~0=v_~y$flush_delayed~0_146, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~y~0=v_~y~0_327, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_42|, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_76|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_80|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_54|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_36|, ~weak$$choice0~0=v_~weak$$choice0~0_57, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_56|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_62|, ~y$w_buff1~0=v_~y$w_buff1~0_261, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_34|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_58|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_259, ~weak$$choice2~0=v_~weak$$choice2~0_262, ~x~0=v_~x~0_37, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_635} AuxVars[|v_ULTIMATE.start_main_#t~ite85_56|, |v_ULTIMATE.start_main_#t~ite82_64|, |v_ULTIMATE.start_main_#t~ite89_54|, |v_ULTIMATE.start_main_#t~ite83_58|, v_~y~0_329, |v_ULTIMATE.start_main_#t~ite97_82|, |v_ULTIMATE.start_main_#t~ite98_78|, |v_ULTIMATE.start_main_#t~ite95_64|, |v_ULTIMATE.start_main_#t~ite94_68|, |v_ULTIMATE.start_main_#t~ite92_58|, |v_ULTIMATE.start_main_#t~ite91_68|, |v_ULTIMATE.start_main_#t~ite86_50|, |v_ULTIMATE.start_main_#t~ite80_60|, |v_ULTIMATE.start_main_#t~ite88_56|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet79, ULTIMATE.start_main_#t~nondet78, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite94, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite100, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_#t~ite90, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite99, ULTIMATE.start_main_#t~ite98, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][31], [Black: 124#(and (= ~y$r_buff1_thd0~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0)), 33#L754true, Black: 126#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~y~0 ~x~0)) (not (= 2 ~y~0))) (= ~y$r_buff0_thd0~0 0)), 99#L827true, Black: 132#(<= ~__unbuffered_p2_EBX~0 0), P0Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 47#L771true, Black: 140#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0)), 144#true, 49#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 121#true, Black: 149#(or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0)), Black: 151#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0)) (= ~y$w_buff0~0 0) (= ~y~0 0) (= ~y$w_buff1_used~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), 155#true]) [2021-03-25 04:59:16,523 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-03-25 04:59:16,523 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-25 04:59:16,523 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-25 04:59:16,523 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-25 04:59:16,525 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1669] L860-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= 0 (mod v_~y$w_buff1_used~0_636 256))) (.cse19 (= (mod v_~y$r_buff1_thd0~0_207 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd0~0_260 256) 0))) (let ((.cse10 (not .cse9)) (.cse6 (and .cse9 .cse19)) (.cse7 (and .cse18 .cse9)) (.cse17 (= (mod v_~y$w_buff0_used~0_806 256) 0)) (.cse0 (= (mod v_~weak$$choice2~0_262 256) 0))) (let ((.cse1 (not .cse0)) (.cse12 (or .cse6 .cse7 .cse17)) (.cse3 (or (not .cse19) .cse10)) (.cse4 (or (not .cse18) .cse10)) (.cse11 (not .cse17))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_146 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_42 1) (= v_~__unbuffered_p2_EAX~0_44 1) (= v_~x~0_37 2) (= v_~y~0_329 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_36) (or (and .cse0 (= v_~y~0_327 v_~y~0_329)) (and .cse1 (= v_~y~0_327 v_~y$mem_tmp~0_90))) (let ((.cse5 (= |v_ULTIMATE.start_main_#t~ite91_68| |v_ULTIMATE.start_main_#t~ite91_67|))) (or (and (= v_~y$w_buff1_used~0_635 |v_ULTIMATE.start_main_#t~ite92_58|) (let ((.cse2 (= (mod v_~y$w_buff0_used~0_805 256) 0))) (or (and (not .cse2) (= |v_ULTIMATE.start_main_#t~ite92_58| |v_ULTIMATE.start_main_#t~ite91_68|) .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite91_68| 0)) (and .cse5 (= v_~y$w_buff1_used~0_636 |v_ULTIMATE.start_main_#t~ite92_58|) (or .cse6 .cse7 .cse2)))) .cse0) (and .cse5 .cse1 (= |v_ULTIMATE.start_main_#t~ite92_58| |v_ULTIMATE.start_main_#t~ite92_57|) (= v_~y$w_buff1_used~0_636 v_~y$w_buff1_used~0_635)))) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite88_56| |v_ULTIMATE.start_main_#t~ite88_55|))) (or (and .cse8 (= |v_ULTIMATE.start_main_#t~ite89_54| |v_ULTIMATE.start_main_#t~ite89_53|) .cse1 (= v_~y$w_buff0_used~0_806 v_~y$w_buff0_used~0_805)) (and .cse0 (= v_~y$w_buff0_used~0_805 |v_ULTIMATE.start_main_#t~ite89_54|) (or (and .cse3 .cse4 (or (and .cse9 (= v_~y$w_buff0_used~0_806 |v_ULTIMATE.start_main_#t~ite88_56|)) (and (= |v_ULTIMATE.start_main_#t~ite88_56| 0) .cse10)) (= |v_ULTIMATE.start_main_#t~ite88_56| |v_ULTIMATE.start_main_#t~ite89_54|) .cse11) (and .cse8 (= v_~y$w_buff0_used~0_806 |v_ULTIMATE.start_main_#t~ite89_54|) .cse12))))) (= |v_ULTIMATE.start_main_#t~nondet78_47| v_~weak$$choice0~0_57) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite82_64| |v_ULTIMATE.start_main_#t~ite82_63|))) (or (and (= v_~y$w_buff0~0_271 v_~y$w_buff0~0_270) .cse1 (= |v_ULTIMATE.start_main_#t~ite83_58| |v_ULTIMATE.start_main_#t~ite83_57|) .cse13) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite83_58| v_~y$w_buff0~0_270) (or (and .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite83_58| |v_ULTIMATE.start_main_#t~ite82_64|) (= |v_ULTIMATE.start_main_#t~ite82_64| v_~y$w_buff0~0_271) .cse11) (and (= |v_ULTIMATE.start_main_#t~ite83_58| v_~y$w_buff0~0_271) .cse12 .cse13))))) (= v_~y~0_328 v_~y$mem_tmp~0_90) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite85_56| |v_ULTIMATE.start_main_#t~ite85_55|))) (or (and .cse1 (= v_~y$w_buff1~0_262 v_~y$w_buff1~0_261) (= |v_ULTIMATE.start_main_#t~ite86_49| |v_ULTIMATE.start_main_#t~ite86_50|) .cse14) (and (or (and .cse3 .cse4 (= v_~y$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite85_56|) .cse11 (= |v_ULTIMATE.start_main_#t~ite85_56| |v_ULTIMATE.start_main_#t~ite86_50|)) (and .cse12 (= v_~y$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite86_50|) .cse14)) .cse0 (= v_~y$w_buff1~0_261 |v_ULTIMATE.start_main_#t~ite86_50|)))) (let ((.cse15 (= |v_ULTIMATE.start_main_#t~ite97_82| |v_ULTIMATE.start_main_#t~ite97_81|))) (or (and .cse0 (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite98_78|) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite98_78|) .cse15) (and (= v_~y$r_buff1_thd0~0_207 v_~y$r_buff1_thd0~0_206) .cse1 (= |v_ULTIMATE.start_main_#t~ite98_78| |v_ULTIMATE.start_main_#t~ite98_77|) .cse15))) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~weak$$choice2~0_262 |v_ULTIMATE.start_main_#t~nondet79_53|) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite94_68| |v_ULTIMATE.start_main_#t~ite94_67|))) (or (and (= |v_ULTIMATE.start_main_#t~ite95_64| |v_ULTIMATE.start_main_#t~ite95_63|) .cse16 (= v_~y$r_buff0_thd0~0_260 v_~y$r_buff0_thd0~0_259) .cse1) (and .cse0 .cse16 (= v_~y$r_buff0_thd0~0_260 |v_ULTIMATE.start_main_#t~ite95_64|) (= v_~y$r_buff0_thd0~0_259 |v_ULTIMATE.start_main_#t~ite95_64|)))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite80_59| |v_ULTIMATE.start_main_#t~ite80_60|) (= v_~y~0_329 v_~y~0_328)) (and .cse3 .cse4 (= v_~y~0_329 |v_ULTIMATE.start_main_#t~ite80_60|) (or (and (= v_~y$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite80_60|) .cse9) (and (= |v_ULTIMATE.start_main_#t~ite80_60| v_~y$w_buff0~0_271) .cse10)) .cse11)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_806, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_53|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_47|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_53|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_55|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_49|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_63|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_67|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_57|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_67|, ~y$w_buff0~0=v_~y$w_buff0~0_271, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~y~0=v_~y~0_328, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_77|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_55|, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_57|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_63|, ~y$w_buff1~0=v_~y$w_buff1~0_262, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_59|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_260, ~x~0=v_~x~0_37, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_636} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_805, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_52|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_52|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_54|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_38|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_48|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_44|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_62|, ~y$mem_tmp~0=v_~y$mem_tmp~0_90, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_66|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_40|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_56|, ULTIMATE.start_main_#t~ite100=|v_ULTIMATE.start_main_#t~ite100_38|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_66|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_46|, ~y$w_buff0~0=v_~y$w_buff0~0_270, ~y$flush_delayed~0=v_~y$flush_delayed~0_146, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~y~0=v_~y~0_327, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_42|, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_76|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_80|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_54|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_36|, ~weak$$choice0~0=v_~weak$$choice0~0_57, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_56|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_62|, ~y$w_buff1~0=v_~y$w_buff1~0_261, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_34|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_58|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_259, ~weak$$choice2~0=v_~weak$$choice2~0_262, ~x~0=v_~x~0_37, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_635} AuxVars[|v_ULTIMATE.start_main_#t~ite85_56|, |v_ULTIMATE.start_main_#t~ite82_64|, |v_ULTIMATE.start_main_#t~ite89_54|, |v_ULTIMATE.start_main_#t~ite83_58|, v_~y~0_329, |v_ULTIMATE.start_main_#t~ite97_82|, |v_ULTIMATE.start_main_#t~ite98_78|, |v_ULTIMATE.start_main_#t~ite95_64|, |v_ULTIMATE.start_main_#t~ite94_68|, |v_ULTIMATE.start_main_#t~ite92_58|, |v_ULTIMATE.start_main_#t~ite91_68|, |v_ULTIMATE.start_main_#t~ite86_50|, |v_ULTIMATE.start_main_#t~ite80_60|, |v_ULTIMATE.start_main_#t~ite88_56|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet79, ULTIMATE.start_main_#t~nondet78, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite94, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite100, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_#t~ite90, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite99, ULTIMATE.start_main_#t~ite98, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][31], [Black: 124#(and (= ~y$r_buff1_thd0~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 126#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~y~0 ~x~0)) (not (= 2 ~y~0))) (= ~y$r_buff0_thd0~0 0)), 99#L827true, Black: 132#(<= ~__unbuffered_p2_EBX~0 0), P0Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 47#L771true, Black: 140#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0)), 144#true, 49#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 83#L761true, 121#true, Black: 149#(or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0)), Black: 151#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0)) (= ~y$w_buff0~0 0) (= ~y~0 0) (= ~y$w_buff1_used~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), 155#true]) [2021-03-25 04:59:16,525 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 04:59:16,525 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 04:59:16,525 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 04:59:16,525 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 04:59:16,526 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1669] L860-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= 0 (mod v_~y$w_buff1_used~0_636 256))) (.cse19 (= (mod v_~y$r_buff1_thd0~0_207 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd0~0_260 256) 0))) (let ((.cse10 (not .cse9)) (.cse6 (and .cse9 .cse19)) (.cse7 (and .cse18 .cse9)) (.cse17 (= (mod v_~y$w_buff0_used~0_806 256) 0)) (.cse0 (= (mod v_~weak$$choice2~0_262 256) 0))) (let ((.cse1 (not .cse0)) (.cse12 (or .cse6 .cse7 .cse17)) (.cse3 (or (not .cse19) .cse10)) (.cse4 (or (not .cse18) .cse10)) (.cse11 (not .cse17))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_146 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_42 1) (= v_~__unbuffered_p2_EAX~0_44 1) (= v_~x~0_37 2) (= v_~y~0_329 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_36) (or (and .cse0 (= v_~y~0_327 v_~y~0_329)) (and .cse1 (= v_~y~0_327 v_~y$mem_tmp~0_90))) (let ((.cse5 (= |v_ULTIMATE.start_main_#t~ite91_68| |v_ULTIMATE.start_main_#t~ite91_67|))) (or (and (= v_~y$w_buff1_used~0_635 |v_ULTIMATE.start_main_#t~ite92_58|) (let ((.cse2 (= (mod v_~y$w_buff0_used~0_805 256) 0))) (or (and (not .cse2) (= |v_ULTIMATE.start_main_#t~ite92_58| |v_ULTIMATE.start_main_#t~ite91_68|) .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite91_68| 0)) (and .cse5 (= v_~y$w_buff1_used~0_636 |v_ULTIMATE.start_main_#t~ite92_58|) (or .cse6 .cse7 .cse2)))) .cse0) (and .cse5 .cse1 (= |v_ULTIMATE.start_main_#t~ite92_58| |v_ULTIMATE.start_main_#t~ite92_57|) (= v_~y$w_buff1_used~0_636 v_~y$w_buff1_used~0_635)))) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite88_56| |v_ULTIMATE.start_main_#t~ite88_55|))) (or (and .cse8 (= |v_ULTIMATE.start_main_#t~ite89_54| |v_ULTIMATE.start_main_#t~ite89_53|) .cse1 (= v_~y$w_buff0_used~0_806 v_~y$w_buff0_used~0_805)) (and .cse0 (= v_~y$w_buff0_used~0_805 |v_ULTIMATE.start_main_#t~ite89_54|) (or (and .cse3 .cse4 (or (and .cse9 (= v_~y$w_buff0_used~0_806 |v_ULTIMATE.start_main_#t~ite88_56|)) (and (= |v_ULTIMATE.start_main_#t~ite88_56| 0) .cse10)) (= |v_ULTIMATE.start_main_#t~ite88_56| |v_ULTIMATE.start_main_#t~ite89_54|) .cse11) (and .cse8 (= v_~y$w_buff0_used~0_806 |v_ULTIMATE.start_main_#t~ite89_54|) .cse12))))) (= |v_ULTIMATE.start_main_#t~nondet78_47| v_~weak$$choice0~0_57) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite82_64| |v_ULTIMATE.start_main_#t~ite82_63|))) (or (and (= v_~y$w_buff0~0_271 v_~y$w_buff0~0_270) .cse1 (= |v_ULTIMATE.start_main_#t~ite83_58| |v_ULTIMATE.start_main_#t~ite83_57|) .cse13) (and .cse0 (= |v_ULTIMATE.start_main_#t~ite83_58| v_~y$w_buff0~0_270) (or (and .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite83_58| |v_ULTIMATE.start_main_#t~ite82_64|) (= |v_ULTIMATE.start_main_#t~ite82_64| v_~y$w_buff0~0_271) .cse11) (and (= |v_ULTIMATE.start_main_#t~ite83_58| v_~y$w_buff0~0_271) .cse12 .cse13))))) (= v_~y~0_328 v_~y$mem_tmp~0_90) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite85_56| |v_ULTIMATE.start_main_#t~ite85_55|))) (or (and .cse1 (= v_~y$w_buff1~0_262 v_~y$w_buff1~0_261) (= |v_ULTIMATE.start_main_#t~ite86_49| |v_ULTIMATE.start_main_#t~ite86_50|) .cse14) (and (or (and .cse3 .cse4 (= v_~y$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite85_56|) .cse11 (= |v_ULTIMATE.start_main_#t~ite85_56| |v_ULTIMATE.start_main_#t~ite86_50|)) (and .cse12 (= v_~y$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite86_50|) .cse14)) .cse0 (= v_~y$w_buff1~0_261 |v_ULTIMATE.start_main_#t~ite86_50|)))) (let ((.cse15 (= |v_ULTIMATE.start_main_#t~ite97_82| |v_ULTIMATE.start_main_#t~ite97_81|))) (or (and .cse0 (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite98_78|) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite98_78|) .cse15) (and (= v_~y$r_buff1_thd0~0_207 v_~y$r_buff1_thd0~0_206) .cse1 (= |v_ULTIMATE.start_main_#t~ite98_78| |v_ULTIMATE.start_main_#t~ite98_77|) .cse15))) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~weak$$choice2~0_262 |v_ULTIMATE.start_main_#t~nondet79_53|) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite94_68| |v_ULTIMATE.start_main_#t~ite94_67|))) (or (and (= |v_ULTIMATE.start_main_#t~ite95_64| |v_ULTIMATE.start_main_#t~ite95_63|) .cse16 (= v_~y$r_buff0_thd0~0_260 v_~y$r_buff0_thd0~0_259) .cse1) (and .cse0 .cse16 (= v_~y$r_buff0_thd0~0_260 |v_ULTIMATE.start_main_#t~ite95_64|) (= v_~y$r_buff0_thd0~0_259 |v_ULTIMATE.start_main_#t~ite95_64|)))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite80_59| |v_ULTIMATE.start_main_#t~ite80_60|) (= v_~y~0_329 v_~y~0_328)) (and .cse3 .cse4 (= v_~y~0_329 |v_ULTIMATE.start_main_#t~ite80_60|) (or (and (= v_~y$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite80_60|) .cse9) (and (= |v_ULTIMATE.start_main_#t~ite80_60| v_~y$w_buff0~0_271) .cse10)) .cse11)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_806, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_53|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_47|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_53|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_55|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_49|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_63|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_67|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_57|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_67|, ~y$w_buff0~0=v_~y$w_buff0~0_271, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~y~0=v_~y~0_328, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_77|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_55|, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_57|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_63|, ~y$w_buff1~0=v_~y$w_buff1~0_262, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_59|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_260, ~x~0=v_~x~0_37, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_636} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_805, ULTIMATE.start_main_#t~nondet79=|v_ULTIMATE.start_main_#t~nondet79_52|, ULTIMATE.start_main_#t~nondet78=|v_ULTIMATE.start_main_#t~nondet78_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_52|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_54|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_38|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_48|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_44|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_62|, ~y$mem_tmp~0=v_~y$mem_tmp~0_90, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_66|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_40|, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_56|, ULTIMATE.start_main_#t~ite100=|v_ULTIMATE.start_main_#t~ite100_38|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_66|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_46|, ~y$w_buff0~0=v_~y$w_buff0~0_270, ~y$flush_delayed~0=v_~y$flush_delayed~0_146, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~y~0=v_~y~0_327, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_42|, ULTIMATE.start_main_#t~ite98=|v_ULTIMATE.start_main_#t~ite98_76|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_80|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_54|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_36|, ~weak$$choice0~0=v_~weak$$choice0~0_57, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_56|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_62|, ~y$w_buff1~0=v_~y$w_buff1~0_261, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_34|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_58|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_259, ~weak$$choice2~0=v_~weak$$choice2~0_262, ~x~0=v_~x~0_37, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_635} AuxVars[|v_ULTIMATE.start_main_#t~ite85_56|, |v_ULTIMATE.start_main_#t~ite82_64|, |v_ULTIMATE.start_main_#t~ite89_54|, |v_ULTIMATE.start_main_#t~ite83_58|, v_~y~0_329, |v_ULTIMATE.start_main_#t~ite97_82|, |v_ULTIMATE.start_main_#t~ite98_78|, |v_ULTIMATE.start_main_#t~ite95_64|, |v_ULTIMATE.start_main_#t~ite94_68|, |v_ULTIMATE.start_main_#t~ite92_58|, |v_ULTIMATE.start_main_#t~ite91_68|, |v_ULTIMATE.start_main_#t~ite86_50|, |v_ULTIMATE.start_main_#t~ite80_60|, |v_ULTIMATE.start_main_#t~ite88_56|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet79, ULTIMATE.start_main_#t~nondet78, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite94, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite100, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_#t~ite90, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite99, ULTIMATE.start_main_#t~ite98, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][31], [Black: 124#(and (= ~y$r_buff1_thd0~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 126#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~y~0 ~x~0)) (not (= 2 ~y~0))) (= ~y$r_buff0_thd0~0 0)), 99#L827true, Black: 132#(<= ~__unbuffered_p2_EBX~0 0), P0Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 140#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0) (= ~y$r_buff0_thd3~0 0) (= ~y$w_buff1_used~0 0)), 144#true, 49#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 83#L761true, Black: 149#(or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0)), 121#true, Black: 151#(and (= ~y$r_buff1_thd0~0 0) (or (not (= ~__unbuffered_p2_EAX~0 ~__unbuffered_p2_EBX~0)) (= ~__unbuffered_p2_EBX~0 0)) (= ~y$w_buff0~0 0) (= ~y~0 0) (= ~y$w_buff1_used~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), 155#true, 59#L774true]) [2021-03-25 04:59:16,526 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 04:59:16,526 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 04:59:16,526 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 04:59:16,526 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 04:59:16,528 INFO L129 PetriNetUnfolder]: 90/286 cut-off events. [2021-03-25 04:59:16,528 INFO L130 PetriNetUnfolder]: For 991/1118 co-relation queries the response was YES. [2021-03-25 04:59:16,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 286 events. 90/286 cut-off events. For 991/1118 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1758 event pairs, 37 based on Foata normal form. 24/282 useless extension candidates. Maximal degree in co-relation 865. Up to 134 conditions per place. [2021-03-25 04:59:16,530 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 3 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2021-03-25 04:59:16,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 220 flow [2021-03-25 04:59:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:59:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:59:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-03-25 04:59:16,533 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8805394990366089 [2021-03-25 04:59:16,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-03-25 04:59:16,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-03-25 04:59:16,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:16,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-03-25 04:59:16,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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:59:16,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 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:59:16,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 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:59:16,536 INFO L185 Difference]: Start difference. First operand has 42 places, 36 transitions, 204 flow. Second operand 3 states and 457 transitions. [2021-03-25 04:59:16,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 220 flow [2021-03-25 04:59:16,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:59:16,539 INFO L241 Difference]: Finished difference. Result has 44 places, 36 transitions, 216 flow [2021-03-25 04:59:16,539 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2021-03-25 04:59:16,540 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2021-03-25 04:59:16,540 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:16,540 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 216 flow [2021-03-25 04:59:16,540 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 216 flow [2021-03-25 04:59:16,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 216 flow [2021-03-25 04:59:16,572 INFO L129 PetriNetUnfolder]: 91/306 cut-off events. [2021-03-25 04:59:16,572 INFO L130 PetriNetUnfolder]: For 438/460 co-relation queries the response was YES. [2021-03-25 04:59:16,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 306 events. 91/306 cut-off events. For 438/460 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1985 event pairs, 45 based on Foata normal form. 2/280 useless extension candidates. Maximal degree in co-relation 850. Up to 133 conditions per place. [2021-03-25 04:59:16,574 INFO L142 LiptonReduction]: Number of co-enabled transitions 286 [2021-03-25 04:59:16,585 INFO L154 LiptonReduction]: Checked pairs total: 63 [2021-03-25 04:59:16,585 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:59:16,585 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-03-25 04:59:16,588 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 216 flow [2021-03-25 04:59:16,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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:59:16,588 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:16,588 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:16,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:59:16,588 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:16,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:16,589 INFO L82 PathProgramCache]: Analyzing trace with hash 129122395, now seen corresponding path program 1 times [2021-03-25 04:59:16,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:16,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016492072] [2021-03-25 04:59:16,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:16,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:16,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:59:16,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:16,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:59:16,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:16,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:59:16,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:16,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:59:16,714 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:59:16,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016492072] [2021-03-25 04:59:16,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:16,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:59:16,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516630574] [2021-03-25 04:59:16,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:59:16,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:16,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:59:16,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:59:16,716 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 173 [2021-03-25 04:59:16,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:16,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:16,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 173 [2021-03-25 04:59:16,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:16,917 INFO L129 PetriNetUnfolder]: 398/815 cut-off events. [2021-03-25 04:59:16,917 INFO L130 PetriNetUnfolder]: For 1488/1536 co-relation queries the response was YES. [2021-03-25 04:59:16,919 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2689 conditions, 815 events. 398/815 cut-off events. For 1488/1536 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5058 event pairs, 84 based on Foata normal form. 33/842 useless extension candidates. Maximal degree in co-relation 2670. Up to 388 conditions per place. [2021-03-25 04:59:16,921 INFO L132 encePairwiseOnDemand]: 165/173 looper letters, 24 selfloop transitions, 10 changer transitions 8/56 dead transitions. [2021-03-25 04:59:16,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 422 flow [2021-03-25 04:59:16,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:59:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:59:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2021-03-25 04:59:16,923 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7294797687861272 [2021-03-25 04:59:16,923 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 631 transitions. [2021-03-25 04:59:16,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 631 transitions. [2021-03-25 04:59:16,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:16,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 631 transitions. [2021-03-25 04:59:16,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:16,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 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:59:16,926 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 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:59:16,926 INFO L185 Difference]: Start difference. First operand has 44 places, 36 transitions, 216 flow. Second operand 5 states and 631 transitions. [2021-03-25 04:59:16,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 422 flow [2021-03-25 04:59:16,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:59:16,930 INFO L241 Difference]: Finished difference. Result has 49 places, 39 transitions, 272 flow [2021-03-25 04:59:16,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2021-03-25 04:59:16,930 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2021-03-25 04:59:16,930 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:16,930 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 39 transitions, 272 flow [2021-03-25 04:59:16,931 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 272 flow [2021-03-25 04:59:16,931 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 272 flow [2021-03-25 04:59:16,960 INFO L129 PetriNetUnfolder]: 85/321 cut-off events. [2021-03-25 04:59:16,960 INFO L130 PetriNetUnfolder]: For 773/807 co-relation queries the response was YES. [2021-03-25 04:59:16,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 321 events. 85/321 cut-off events. For 773/807 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2233 event pairs, 37 based on Foata normal form. 4/299 useless extension candidates. Maximal degree in co-relation 977. Up to 148 conditions per place. [2021-03-25 04:59:16,962 INFO L142 LiptonReduction]: Number of co-enabled transitions 288 [2021-03-25 04:59:16,968 INFO L154 LiptonReduction]: Checked pairs total: 84 [2021-03-25 04:59:16,968 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:59:16,968 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-25 04:59:16,968 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 272 flow [2021-03-25 04:59:16,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:16,969 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:16,969 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:16,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:59:16,969 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:16,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1352908607, now seen corresponding path program 1 times [2021-03-25 04:59:16,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:16,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824540061] [2021-03-25 04:59:16,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:17,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:17,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:59:17,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:17,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:59:17,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:17,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:59:17,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:17,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:59:17,132 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-25 04:59:17,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 04:59:17,154 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:59:17,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824540061] [2021-03-25 04:59:17,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:17,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:59:17,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381732020] [2021-03-25 04:59:17,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:59:17,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:17,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:59:17,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:59:17,156 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 173 [2021-03-25 04:59:17,157 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:17,157 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:17,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 173 [2021-03-25 04:59:17,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:17,350 INFO L129 PetriNetUnfolder]: 268/591 cut-off events. [2021-03-25 04:59:17,350 INFO L130 PetriNetUnfolder]: For 1575/1619 co-relation queries the response was YES. [2021-03-25 04:59:17,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2151 conditions, 591 events. 268/591 cut-off events. For 1575/1619 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3602 event pairs, 127 based on Foata normal form. 18/603 useless extension candidates. Maximal degree in co-relation 2129. Up to 397 conditions per place. [2021-03-25 04:59:17,353 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 30 selfloop transitions, 11 changer transitions 1/56 dead transitions. [2021-03-25 04:59:17,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 467 flow [2021-03-25 04:59:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:59:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:59:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2021-03-25 04:59:17,355 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7456647398843931 [2021-03-25 04:59:17,355 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2021-03-25 04:59:17,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2021-03-25 04:59:17,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:17,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2021-03-25 04:59:17,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 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:59:17,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 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:59:17,358 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 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:59:17,358 INFO L185 Difference]: Start difference. First operand has 49 places, 39 transitions, 272 flow. Second operand 5 states and 645 transitions. [2021-03-25 04:59:17,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 467 flow [2021-03-25 04:59:17,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 433 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-25 04:59:17,362 INFO L241 Difference]: Finished difference. Result has 52 places, 44 transitions, 322 flow [2021-03-25 04:59:17,362 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2021-03-25 04:59:17,362 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-03-25 04:59:17,362 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:17,362 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 44 transitions, 322 flow [2021-03-25 04:59:17,362 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 44 transitions, 322 flow [2021-03-25 04:59:17,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 322 flow [2021-03-25 04:59:17,396 INFO L129 PetriNetUnfolder]: 109/376 cut-off events. [2021-03-25 04:59:17,396 INFO L130 PetriNetUnfolder]: For 1265/1297 co-relation queries the response was YES. [2021-03-25 04:59:17,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 376 events. 109/376 cut-off events. For 1265/1297 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2601 event pairs, 48 based on Foata normal form. 5/356 useless extension candidates. Maximal degree in co-relation 1275. Up to 168 conditions per place. [2021-03-25 04:59:17,399 INFO L142 LiptonReduction]: Number of co-enabled transitions 326 [2021-03-25 04:59:17,403 INFO L154 LiptonReduction]: Checked pairs total: 64 [2021-03-25 04:59:17,403 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:59:17,403 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-25 04:59:17,404 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 322 flow [2021-03-25 04:59:17,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:17,404 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:17,404 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:17,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:59:17,404 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:17,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:17,405 INFO L82 PathProgramCache]: Analyzing trace with hash -451590210, now seen corresponding path program 1 times [2021-03-25 04:59:17,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:17,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723007653] [2021-03-25 04:59:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:17,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:17,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:59:17,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:17,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:59:17,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:17,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:59:17,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:17,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:59:17,490 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:59:17,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723007653] [2021-03-25 04:59:17,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:17,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:59:17,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801621559] [2021-03-25 04:59:17,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:59:17,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:17,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:59:17,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:59:17,491 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 173 [2021-03-25 04:59:17,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 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:59:17,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:17,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 173 [2021-03-25 04:59:17,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:17,649 INFO L129 PetriNetUnfolder]: 303/669 cut-off events. [2021-03-25 04:59:17,650 INFO L130 PetriNetUnfolder]: For 2397/2450 co-relation queries the response was YES. [2021-03-25 04:59:17,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 669 events. 303/669 cut-off events. For 2397/2450 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4196 event pairs, 76 based on Foata normal form. 39/702 useless extension candidates. Maximal degree in co-relation 2596. Up to 376 conditions per place. [2021-03-25 04:59:17,653 INFO L132 encePairwiseOnDemand]: 165/173 looper letters, 30 selfloop transitions, 14 changer transitions 7/65 dead transitions. [2021-03-25 04:59:17,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 584 flow [2021-03-25 04:59:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:59:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:59:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2021-03-25 04:59:17,655 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.738728323699422 [2021-03-25 04:59:17,655 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2021-03-25 04:59:17,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2021-03-25 04:59:17,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:17,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2021-03-25 04:59:17,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 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:59:17,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 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:59:17,659 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 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:59:17,659 INFO L185 Difference]: Start difference. First operand has 52 places, 44 transitions, 322 flow. Second operand 5 states and 639 transitions. [2021-03-25 04:59:17,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 584 flow [2021-03-25 04:59:17,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 571 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 04:59:17,663 INFO L241 Difference]: Finished difference. Result has 58 places, 51 transitions, 448 flow [2021-03-25 04:59:17,664 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=448, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2021-03-25 04:59:17,664 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2021-03-25 04:59:17,664 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:17,664 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 51 transitions, 448 flow [2021-03-25 04:59:17,664 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 51 transitions, 448 flow [2021-03-25 04:59:17,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 51 transitions, 448 flow [2021-03-25 04:59:17,701 INFO L129 PetriNetUnfolder]: 128/398 cut-off events. [2021-03-25 04:59:17,701 INFO L130 PetriNetUnfolder]: For 1750/1784 co-relation queries the response was YES. [2021-03-25 04:59:17,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 398 events. 128/398 cut-off events. For 1750/1784 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2669 event pairs, 44 based on Foata normal form. 8/380 useless extension candidates. Maximal degree in co-relation 1512. Up to 184 conditions per place. [2021-03-25 04:59:17,704 INFO L142 LiptonReduction]: Number of co-enabled transitions 326 [2021-03-25 04:59:18,017 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2021-03-25 04:59:18,081 INFO L154 LiptonReduction]: Checked pairs total: 292 [2021-03-25 04:59:18,081 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:59:18,082 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 418 [2021-03-25 04:59:18,082 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 458 flow [2021-03-25 04:59:18,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 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:59:18,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:18,082 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:18,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:59:18,082 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:18,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:18,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1634285468, now seen corresponding path program 2 times [2021-03-25 04:59:18,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:18,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138230080] [2021-03-25 04:59:18,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:18,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:18,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:59:18,138 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-25 04:59:18,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 04:59:18,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:18,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:18,159 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:59:18,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138230080] [2021-03-25 04:59:18,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:18,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:59:18,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671441637] [2021-03-25 04:59:18,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:59:18,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:18,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:59:18,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:59:18,161 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 174 [2021-03-25 04:59:18,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:18,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:18,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 174 [2021-03-25 04:59:18,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:18,336 INFO L129 PetriNetUnfolder]: 257/586 cut-off events. [2021-03-25 04:59:18,336 INFO L130 PetriNetUnfolder]: For 3187/3306 co-relation queries the response was YES. [2021-03-25 04:59:18,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 586 events. 257/586 cut-off events. For 3187/3306 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3623 event pairs, 59 based on Foata normal form. 40/619 useless extension candidates. Maximal degree in co-relation 2469. Up to 249 conditions per place. [2021-03-25 04:59:18,339 INFO L132 encePairwiseOnDemand]: 167/174 looper letters, 29 selfloop transitions, 7 changer transitions 14/64 dead transitions. [2021-03-25 04:59:18,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 657 flow [2021-03-25 04:59:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:59:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:59:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 526 transitions. [2021-03-25 04:59:18,341 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7557471264367817 [2021-03-25 04:59:18,341 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 526 transitions. [2021-03-25 04:59:18,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 526 transitions. [2021-03-25 04:59:18,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:18,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 526 transitions. [2021-03-25 04:59:18,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:18,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 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:59:18,344 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 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:59:18,344 INFO L185 Difference]: Start difference. First operand has 58 places, 51 transitions, 458 flow. Second operand 4 states and 526 transitions. [2021-03-25 04:59:18,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 657 flow [2021-03-25 04:59:18,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 624 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-03-25 04:59:18,347 INFO L241 Difference]: Finished difference. Result has 61 places, 43 transitions, 378 flow [2021-03-25 04:59:18,347 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=378, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2021-03-25 04:59:18,348 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2021-03-25 04:59:18,348 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:18,348 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 43 transitions, 378 flow [2021-03-25 04:59:18,348 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 43 transitions, 378 flow [2021-03-25 04:59:18,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 43 transitions, 378 flow [2021-03-25 04:59:18,374 INFO L129 PetriNetUnfolder]: 70/244 cut-off events. [2021-03-25 04:59:18,375 INFO L130 PetriNetUnfolder]: For 1257/1285 co-relation queries the response was YES. [2021-03-25 04:59:18,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 244 events. 70/244 cut-off events. For 1257/1285 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1451 event pairs, 30 based on Foata normal form. 4/232 useless extension candidates. Maximal degree in co-relation 978. Up to 119 conditions per place. [2021-03-25 04:59:18,377 INFO L142 LiptonReduction]: Number of co-enabled transitions 280 [2021-03-25 04:59:18,380 INFO L154 LiptonReduction]: Checked pairs total: 146 [2021-03-25 04:59:18,380 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:59:18,380 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-25 04:59:18,381 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 378 flow [2021-03-25 04:59:18,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:18,382 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:18,382 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:18,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:59:18,382 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1462694975, now seen corresponding path program 1 times [2021-03-25 04:59:18,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:18,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967157583] [2021-03-25 04:59:18,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:18,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:18,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:59:18,442 INFO L142 QuantifierPusher]: treesize reduction 26, result has 60.6 percent of original size [2021-03-25 04:59:18,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 04:59:18,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:18,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:59:18,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:18,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:18,475 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:59:18,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967157583] [2021-03-25 04:59:18,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:18,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:59:18,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470397269] [2021-03-25 04:59:18,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:59:18,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:18,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:59:18,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:59:18,476 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 174 [2021-03-25 04:59:18,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:18,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:18,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 174 [2021-03-25 04:59:18,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:18,645 INFO L129 PetriNetUnfolder]: 213/466 cut-off events. [2021-03-25 04:59:18,645 INFO L130 PetriNetUnfolder]: For 2435/2497 co-relation queries the response was YES. [2021-03-25 04:59:18,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2104 conditions, 466 events. 213/466 cut-off events. For 2435/2497 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2665 event pairs, 125 based on Foata normal form. 22/485 useless extension candidates. Maximal degree in co-relation 2074. Up to 268 conditions per place. [2021-03-25 04:59:18,648 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 29 selfloop transitions, 8 changer transitions 9/60 dead transitions. [2021-03-25 04:59:18,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 611 flow [2021-03-25 04:59:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:59:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:59:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2021-03-25 04:59:18,650 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7203065134099617 [2021-03-25 04:59:18,650 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2021-03-25 04:59:18,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2021-03-25 04:59:18,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:18,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2021-03-25 04:59:18,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 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:59:18,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 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:59:18,653 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 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:59:18,653 INFO L185 Difference]: Start difference. First operand has 61 places, 43 transitions, 378 flow. Second operand 6 states and 752 transitions. [2021-03-25 04:59:18,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 611 flow [2021-03-25 04:59:18,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 519 flow, removed 16 selfloop flow, removed 9 redundant places. [2021-03-25 04:59:18,658 INFO L241 Difference]: Finished difference. Result has 60 places, 44 transitions, 350 flow [2021-03-25 04:59:18,658 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2021-03-25 04:59:18,658 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 12 predicate places. [2021-03-25 04:59:18,658 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:18,658 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 44 transitions, 350 flow [2021-03-25 04:59:18,658 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 44 transitions, 350 flow [2021-03-25 04:59:18,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 44 transitions, 350 flow [2021-03-25 04:59:18,684 INFO L129 PetriNetUnfolder]: 74/255 cut-off events. [2021-03-25 04:59:18,684 INFO L130 PetriNetUnfolder]: For 1158/1176 co-relation queries the response was YES. [2021-03-25 04:59:18,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 255 events. 74/255 cut-off events. For 1158/1176 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1562 event pairs, 33 based on Foata normal form. 5/238 useless extension candidates. Maximal degree in co-relation 949. Up to 119 conditions per place. [2021-03-25 04:59:18,686 INFO L142 LiptonReduction]: Number of co-enabled transitions 286 [2021-03-25 04:59:18,689 INFO L154 LiptonReduction]: Checked pairs total: 139 [2021-03-25 04:59:18,689 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:59:18,689 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-03-25 04:59:18,691 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 350 flow [2021-03-25 04:59:18,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:18,691 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:18,691 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:18,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:59:18,691 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:18,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:18,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2094146219, now seen corresponding path program 1 times [2021-03-25 04:59:18,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:18,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038222432] [2021-03-25 04:59:18,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:18,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:18,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:59:18,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:18,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:59:18,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:18,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 04:59:18,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:18,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 04:59:18,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:18,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 04:59:18,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:18,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:59:18,824 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:59:18,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038222432] [2021-03-25 04:59:18,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:18,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:59:18,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462517932] [2021-03-25 04:59:18,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 04:59:18,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:18,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 04:59:18,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-25 04:59:18,827 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 174 [2021-03-25 04:59:18,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 350 flow. Second operand has 8 states, 8 states have (on average 120.875) internal successors, (967), 8 states have internal predecessors, (967), 0 states have call successors, (0), 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:59:18,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:18,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 174 [2021-03-25 04:59:18,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:19,054 INFO L129 PetriNetUnfolder]: 188/436 cut-off events. [2021-03-25 04:59:19,054 INFO L130 PetriNetUnfolder]: For 2318/2382 co-relation queries the response was YES. [2021-03-25 04:59:19,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1766 conditions, 436 events. 188/436 cut-off events. For 2318/2382 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2605 event pairs, 27 based on Foata normal form. 34/468 useless extension candidates. Maximal degree in co-relation 1738. Up to 208 conditions per place. [2021-03-25 04:59:19,057 INFO L132 encePairwiseOnDemand]: 166/174 looper letters, 21 selfloop transitions, 13 changer transitions 19/67 dead transitions. [2021-03-25 04:59:19,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 596 flow [2021-03-25 04:59:19,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:59:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:59:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1005 transitions. [2021-03-25 04:59:19,059 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7219827586206896 [2021-03-25 04:59:19,059 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1005 transitions. [2021-03-25 04:59:19,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1005 transitions. [2021-03-25 04:59:19,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:19,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1005 transitions. [2021-03-25 04:59:19,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.625) internal successors, (1005), 8 states have internal predecessors, (1005), 0 states have call successors, (0), 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:59:19,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 174.0) internal successors, (1566), 9 states have internal predecessors, (1566), 0 states have call successors, (0), 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:59:19,063 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 174.0) internal successors, (1566), 9 states have internal predecessors, (1566), 0 states have call successors, (0), 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:59:19,063 INFO L185 Difference]: Start difference. First operand has 58 places, 44 transitions, 350 flow. Second operand 8 states and 1005 transitions. [2021-03-25 04:59:19,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 596 flow [2021-03-25 04:59:19,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 67 transitions, 570 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-25 04:59:19,066 INFO L241 Difference]: Finished difference. Result has 65 places, 40 transitions, 337 flow [2021-03-25 04:59:19,066 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=337, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2021-03-25 04:59:19,066 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2021-03-25 04:59:19,066 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:19,067 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 40 transitions, 337 flow [2021-03-25 04:59:19,067 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 40 transitions, 337 flow [2021-03-25 04:59:19,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 40 transitions, 337 flow [2021-03-25 04:59:19,086 INFO L129 PetriNetUnfolder]: 68/198 cut-off events. [2021-03-25 04:59:19,086 INFO L130 PetriNetUnfolder]: For 1373/1399 co-relation queries the response was YES. [2021-03-25 04:59:19,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 198 events. 68/198 cut-off events. For 1373/1399 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1106 event pairs, 27 based on Foata normal form. 4/184 useless extension candidates. Maximal degree in co-relation 823. Up to 94 conditions per place. [2021-03-25 04:59:19,088 INFO L142 LiptonReduction]: Number of co-enabled transitions 236 [2021-03-25 04:59:19,090 INFO L154 LiptonReduction]: Checked pairs total: 105 [2021-03-25 04:59:19,090 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:59:19,090 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-25 04:59:19,091 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 337 flow [2021-03-25 04:59:19,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 120.875) internal successors, (967), 8 states have internal predecessors, (967), 0 states have call successors, (0), 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:59:19,091 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:19,091 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:19,091 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:59:19,091 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:19,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash 991865263, now seen corresponding path program 1 times [2021-03-25 04:59:19,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:19,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595099709] [2021-03-25 04:59:19,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:19,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:19,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:59:19,152 INFO L142 QuantifierPusher]: treesize reduction 5, result has 85.3 percent of original size [2021-03-25 04:59:19,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 04:59:19,170 INFO L142 QuantifierPusher]: treesize reduction 14, result has 57.6 percent of original size [2021-03-25 04:59:19,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:59:19,182 INFO L142 QuantifierPusher]: treesize reduction 7, result has 36.4 percent of original size [2021-03-25 04:59:19,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:59:19,187 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:59:19,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595099709] [2021-03-25 04:59:19,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:19,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:59:19,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529490711] [2021-03-25 04:59:19,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:59:19,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:19,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:59:19,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:59:19,188 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 174 [2021-03-25 04:59:19,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 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:59:19,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:19,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 174 [2021-03-25 04:59:19,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:19,326 INFO L129 PetriNetUnfolder]: 158/365 cut-off events. [2021-03-25 04:59:19,327 INFO L130 PetriNetUnfolder]: For 2186/2218 co-relation queries the response was YES. [2021-03-25 04:59:19,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1671 conditions, 365 events. 158/365 cut-off events. For 2186/2218 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2027 event pairs, 42 based on Foata normal form. 22/384 useless extension candidates. Maximal degree in co-relation 1641. Up to 172 conditions per place. [2021-03-25 04:59:19,329 INFO L132 encePairwiseOnDemand]: 166/174 looper letters, 22 selfloop transitions, 13 changer transitions 3/52 dead transitions. [2021-03-25 04:59:19,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 52 transitions, 513 flow [2021-03-25 04:59:19,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:59:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:59:19,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 762 transitions. [2021-03-25 04:59:19,331 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7298850574712644 [2021-03-25 04:59:19,331 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 762 transitions. [2021-03-25 04:59:19,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 762 transitions. [2021-03-25 04:59:19,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:19,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 762 transitions. [2021-03-25 04:59:19,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 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:59:19,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 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:59:19,334 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 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:59:19,334 INFO L185 Difference]: Start difference. First operand has 60 places, 40 transitions, 337 flow. Second operand 6 states and 762 transitions. [2021-03-25 04:59:19,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 52 transitions, 513 flow [2021-03-25 04:59:19,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 459 flow, removed 10 selfloop flow, removed 9 redundant places. [2021-03-25 04:59:19,338 INFO L241 Difference]: Finished difference. Result has 58 places, 42 transitions, 358 flow [2021-03-25 04:59:19,339 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2021-03-25 04:59:19,339 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2021-03-25 04:59:19,339 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:19,339 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 42 transitions, 358 flow [2021-03-25 04:59:19,339 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 42 transitions, 358 flow [2021-03-25 04:59:19,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 42 transitions, 358 flow [2021-03-25 04:59:19,405 INFO L129 PetriNetUnfolder]: 72/219 cut-off events. [2021-03-25 04:59:19,405 INFO L130 PetriNetUnfolder]: For 958/972 co-relation queries the response was YES. [2021-03-25 04:59:19,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 219 events. 72/219 cut-off events. For 958/972 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1202 event pairs, 25 based on Foata normal form. 4/216 useless extension candidates. Maximal degree in co-relation 833. Up to 108 conditions per place. [2021-03-25 04:59:19,407 INFO L142 LiptonReduction]: Number of co-enabled transitions 240 [2021-03-25 04:59:19,414 INFO L154 LiptonReduction]: Checked pairs total: 257 [2021-03-25 04:59:19,414 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:59:19,415 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-03-25 04:59:19,415 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 348 flow [2021-03-25 04:59:19,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 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:59:19,415 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:19,415 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:19,415 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 04:59:19,415 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:19,416 INFO L82 PathProgramCache]: Analyzing trace with hash 171915725, now seen corresponding path program 1 times [2021-03-25 04:59:19,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:19,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937768464] [2021-03-25 04:59:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:19,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:19,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:19,471 INFO L142 QuantifierPusher]: treesize reduction 7, result has 78.8 percent of original size [2021-03-25 04:59:19,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 04:59:19,486 INFO L142 QuantifierPusher]: treesize reduction 8, result has 72.4 percent of original size [2021-03-25 04:59:19,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:59:19,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:19,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:59:19,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:19,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:19,512 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:59:19,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937768464] [2021-03-25 04:59:19,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:19,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:59:19,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948233152] [2021-03-25 04:59:19,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:59:19,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:19,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:59:19,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:59:19,515 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 174 [2021-03-25 04:59:19,515 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 348 flow. Second operand has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 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:59:19,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:19,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 174 [2021-03-25 04:59:19,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:19,794 INFO L129 PetriNetUnfolder]: 223/539 cut-off events. [2021-03-25 04:59:19,794 INFO L130 PetriNetUnfolder]: For 2411/2447 co-relation queries the response was YES. [2021-03-25 04:59:19,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 539 events. 223/539 cut-off events. For 2411/2447 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3345 event pairs, 15 based on Foata normal form. 19/556 useless extension candidates. Maximal degree in co-relation 2229. Up to 233 conditions per place. [2021-03-25 04:59:19,797 INFO L132 encePairwiseOnDemand]: 163/174 looper letters, 23 selfloop transitions, 27 changer transitions 11/75 dead transitions. [2021-03-25 04:59:19,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 75 transitions, 740 flow [2021-03-25 04:59:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:59:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:59:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1034 transitions. [2021-03-25 04:59:19,800 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.742816091954023 [2021-03-25 04:59:19,800 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1034 transitions. [2021-03-25 04:59:19,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1034 transitions. [2021-03-25 04:59:19,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:19,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1034 transitions. [2021-03-25 04:59:19,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.25) internal successors, (1034), 8 states have internal predecessors, (1034), 0 states have call successors, (0), 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:59:19,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 174.0) internal successors, (1566), 9 states have internal predecessors, (1566), 0 states have call successors, (0), 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:59:19,804 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 174.0) internal successors, (1566), 9 states have internal predecessors, (1566), 0 states have call successors, (0), 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:59:19,804 INFO L185 Difference]: Start difference. First operand has 58 places, 41 transitions, 348 flow. Second operand 8 states and 1034 transitions. [2021-03-25 04:59:19,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 75 transitions, 740 flow [2021-03-25 04:59:19,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 686 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-25 04:59:19,808 INFO L241 Difference]: Finished difference. Result has 66 places, 57 transitions, 537 flow [2021-03-25 04:59:19,808 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=537, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2021-03-25 04:59:19,808 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2021-03-25 04:59:19,809 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:19,809 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 57 transitions, 537 flow [2021-03-25 04:59:19,809 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 57 transitions, 537 flow [2021-03-25 04:59:19,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 57 transitions, 537 flow [2021-03-25 04:59:19,854 INFO L129 PetriNetUnfolder]: 153/392 cut-off events. [2021-03-25 04:59:19,854 INFO L130 PetriNetUnfolder]: For 2280/2311 co-relation queries the response was YES. [2021-03-25 04:59:19,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 392 events. 153/392 cut-off events. For 2280/2311 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2327 event pairs, 20 based on Foata normal form. 8/388 useless extension candidates. Maximal degree in co-relation 1767. Up to 187 conditions per place. [2021-03-25 04:59:19,857 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-25 04:59:19,874 INFO L154 LiptonReduction]: Checked pairs total: 270 [2021-03-25 04:59:19,874 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:59:19,874 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 65 [2021-03-25 04:59:19,876 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 537 flow [2021-03-25 04:59:19,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 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:59:19,876 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:19,876 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:19,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 04:59:19,877 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:19,877 INFO L82 PathProgramCache]: Analyzing trace with hash -417738669, now seen corresponding path program 1 times [2021-03-25 04:59:19,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:19,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010949259] [2021-03-25 04:59:19,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:19,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:19,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:59:19,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:19,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:59:19,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:19,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:59:19,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:19,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 04:59:19,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:19,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 04:59:19,960 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:59:19,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010949259] [2021-03-25 04:59:19,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:19,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:59:19,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493978351] [2021-03-25 04:59:19,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:59:19,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:19,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:59:19,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:59:19,963 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 174 [2021-03-25 04:59:19,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 537 flow. Second operand has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 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:59:19,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:19,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 174 [2021-03-25 04:59:19,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:20,108 INFO L129 PetriNetUnfolder]: 226/577 cut-off events. [2021-03-25 04:59:20,108 INFO L130 PetriNetUnfolder]: For 3971/4020 co-relation queries the response was YES. [2021-03-25 04:59:20,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2951 conditions, 577 events. 226/577 cut-off events. For 3971/4020 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3858 event pairs, 7 based on Foata normal form. 31/606 useless extension candidates. Maximal degree in co-relation 2921. Up to 274 conditions per place. [2021-03-25 04:59:20,111 INFO L132 encePairwiseOnDemand]: 166/174 looper letters, 40 selfloop transitions, 25 changer transitions 5/84 dead transitions. [2021-03-25 04:59:20,111 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 945 flow [2021-03-25 04:59:20,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:59:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:59:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2021-03-25 04:59:20,113 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.728735632183908 [2021-03-25 04:59:20,113 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2021-03-25 04:59:20,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2021-03-25 04:59:20,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:20,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2021-03-25 04:59:20,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 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:59:20,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 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:59:20,116 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 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:59:20,116 INFO L185 Difference]: Start difference. First operand has 64 places, 57 transitions, 537 flow. Second operand 5 states and 634 transitions. [2021-03-25 04:59:20,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 945 flow [2021-03-25 04:59:20,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 84 transitions, 867 flow, removed 39 selfloop flow, removed 2 redundant places. [2021-03-25 04:59:20,122 INFO L241 Difference]: Finished difference. Result has 69 places, 68 transitions, 723 flow [2021-03-25 04:59:20,122 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=723, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2021-03-25 04:59:20,122 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2021-03-25 04:59:20,122 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:20,123 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 68 transitions, 723 flow [2021-03-25 04:59:20,123 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 68 transitions, 723 flow [2021-03-25 04:59:20,123 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 68 transitions, 723 flow [2021-03-25 04:59:20,173 INFO L129 PetriNetUnfolder]: 171/506 cut-off events. [2021-03-25 04:59:20,173 INFO L130 PetriNetUnfolder]: For 3121/3180 co-relation queries the response was YES. [2021-03-25 04:59:20,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2369 conditions, 506 events. 171/506 cut-off events. For 3121/3180 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3574 event pairs, 4 based on Foata normal form. 36/540 useless extension candidates. Maximal degree in co-relation 2338. Up to 228 conditions per place. [2021-03-25 04:59:20,177 INFO L142 LiptonReduction]: Number of co-enabled transitions 352 [2021-03-25 04:59:20,208 INFO L154 LiptonReduction]: Checked pairs total: 580 [2021-03-25 04:59:20,208 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:59:20,208 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 86 [2021-03-25 04:59:20,208 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 723 flow [2021-03-25 04:59:20,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 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:59:20,209 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:20,209 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:20,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 04:59:20,209 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash 411015281, now seen corresponding path program 2 times [2021-03-25 04:59:20,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:20,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17239690] [2021-03-25 04:59:20,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:20,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:20,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:59:20,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:20,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 04:59:20,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:20,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:59:20,288 INFO L142 QuantifierPusher]: treesize reduction 7, result has 75.9 percent of original size [2021-03-25 04:59:20,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 04:59:20,302 INFO L142 QuantifierPusher]: treesize reduction 7, result has 69.6 percent of original size [2021-03-25 04:59:20,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:59:20,314 INFO L142 QuantifierPusher]: treesize reduction 8, result has 72.4 percent of original size [2021-03-25 04:59:20,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:59:20,330 INFO L142 QuantifierPusher]: treesize reduction 8, result has 65.2 percent of original size [2021-03-25 04:59:20,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 04:59:20,342 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:59:20,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17239690] [2021-03-25 04:59:20,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:20,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 04:59:20,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018368911] [2021-03-25 04:59:20,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 04:59:20,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:20,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 04:59:20,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-03-25 04:59:20,345 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 174 [2021-03-25 04:59:20,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 723 flow. Second operand has 9 states, 9 states have (on average 116.88888888888889) internal successors, (1052), 9 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:20,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:20,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 174 [2021-03-25 04:59:20,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:20,595 INFO L129 PetriNetUnfolder]: 221/642 cut-off events. [2021-03-25 04:59:20,595 INFO L130 PetriNetUnfolder]: For 3434/3467 co-relation queries the response was YES. [2021-03-25 04:59:20,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 642 events. 221/642 cut-off events. For 3434/3467 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 4931 event pairs, 29 based on Foata normal form. 28/668 useless extension candidates. Maximal degree in co-relation 3196. Up to 257 conditions per place. [2021-03-25 04:59:20,598 INFO L132 encePairwiseOnDemand]: 167/174 looper letters, 23 selfloop transitions, 12 changer transitions 36/82 dead transitions. [2021-03-25 04:59:20,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 82 transitions, 992 flow [2021-03-25 04:59:20,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:59:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:59:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 842 transitions. [2021-03-25 04:59:20,600 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6912972085385879 [2021-03-25 04:59:20,601 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 842 transitions. [2021-03-25 04:59:20,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 842 transitions. [2021-03-25 04:59:20,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:20,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 842 transitions. [2021-03-25 04:59:20,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 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:59:20,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 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:59:20,604 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 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:59:20,604 INFO L185 Difference]: Start difference. First operand has 69 places, 68 transitions, 723 flow. Second operand 7 states and 842 transitions. [2021-03-25 04:59:20,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 82 transitions, 992 flow [2021-03-25 04:59:20,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 82 transitions, 960 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-03-25 04:59:20,609 INFO L241 Difference]: Finished difference. Result has 75 places, 44 transitions, 461 flow [2021-03-25 04:59:20,610 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=461, PETRI_PLACES=75, PETRI_TRANSITIONS=44} [2021-03-25 04:59:20,610 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 27 predicate places. [2021-03-25 04:59:20,610 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:20,610 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 44 transitions, 461 flow [2021-03-25 04:59:20,610 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 44 transitions, 461 flow [2021-03-25 04:59:20,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 44 transitions, 461 flow [2021-03-25 04:59:20,626 INFO L129 PetriNetUnfolder]: 52/156 cut-off events. [2021-03-25 04:59:20,626 INFO L130 PetriNetUnfolder]: For 1094/1102 co-relation queries the response was YES. [2021-03-25 04:59:20,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 156 events. 52/156 cut-off events. For 1094/1102 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 758 event pairs, 3 based on Foata normal form. 1/155 useless extension candidates. Maximal degree in co-relation 763. Up to 69 conditions per place. [2021-03-25 04:59:20,630 INFO L142 LiptonReduction]: Number of co-enabled transitions 162 [2021-03-25 04:59:21,275 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-25 04:59:21,504 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 04:59:22,783 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 338 DAG size of output: 262 [2021-03-25 04:59:23,271 WARN L205 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-25 04:59:23,570 INFO L154 LiptonReduction]: Checked pairs total: 521 [2021-03-25 04:59:23,571 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 04:59:23,571 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2961 [2021-03-25 04:59:23,571 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 42 transitions, 495 flow [2021-03-25 04:59:23,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 116.88888888888889) internal successors, (1052), 9 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:59:23,572 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:23,572 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:23,572 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 04:59:23,572 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:23,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:23,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1571741133, now seen corresponding path program 1 times [2021-03-25 04:59:23,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:23,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300607432] [2021-03-25 04:59:23,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:23,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:23,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:23,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:23,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:59:23,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:23,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:59:23,612 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:59:23,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300607432] [2021-03-25 04:59:23,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:23,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:59:23,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295799800] [2021-03-25 04:59:23,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:59:23,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:23,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:59:23,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:59:23,613 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 180 [2021-03-25 04:59:23,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 42 transitions, 495 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 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:59:23,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:23,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 180 [2021-03-25 04:59:23,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:23,661 INFO L129 PetriNetUnfolder]: 113/266 cut-off events. [2021-03-25 04:59:23,662 INFO L130 PetriNetUnfolder]: For 2487/2568 co-relation queries the response was YES. [2021-03-25 04:59:23,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 266 events. 113/266 cut-off events. For 2487/2568 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1394 event pairs, 27 based on Foata normal form. 68/326 useless extension candidates. Maximal degree in co-relation 1043. Up to 151 conditions per place. [2021-03-25 04:59:23,663 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 10 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2021-03-25 04:59:23,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 44 transitions, 445 flow [2021-03-25 04:59:23,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:59:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:59:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 776 transitions. [2021-03-25 04:59:23,665 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8622222222222222 [2021-03-25 04:59:23,665 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 776 transitions. [2021-03-25 04:59:23,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 776 transitions. [2021-03-25 04:59:23,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:23,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 776 transitions. [2021-03-25 04:59:23,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.2) internal successors, (776), 5 states have internal predecessors, (776), 0 states have call successors, (0), 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:59:23,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 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:59:23,668 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 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:59:23,668 INFO L185 Difference]: Start difference. First operand has 71 places, 42 transitions, 495 flow. Second operand 5 states and 776 transitions. [2021-03-25 04:59:23,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 44 transitions, 445 flow [2021-03-25 04:59:23,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 340 flow, removed 31 selfloop flow, removed 21 redundant places. [2021-03-25 04:59:23,671 INFO L241 Difference]: Finished difference. Result has 56 places, 41 transitions, 352 flow [2021-03-25 04:59:23,671 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2021-03-25 04:59:23,671 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2021-03-25 04:59:23,671 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:23,671 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 41 transitions, 352 flow [2021-03-25 04:59:23,671 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 41 transitions, 352 flow [2021-03-25 04:59:23,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 41 transitions, 352 flow [2021-03-25 04:59:23,689 INFO L129 PetriNetUnfolder]: 109/262 cut-off events. [2021-03-25 04:59:23,689 INFO L130 PetriNetUnfolder]: For 802/863 co-relation queries the response was YES. [2021-03-25 04:59:23,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 262 events. 109/262 cut-off events. For 802/863 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1429 event pairs, 28 based on Foata normal form. 18/269 useless extension candidates. Maximal degree in co-relation 1014. Up to 148 conditions per place. [2021-03-25 04:59:23,691 INFO L142 LiptonReduction]: Number of co-enabled transitions 210 [2021-03-25 04:59:23,933 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-25 04:59:24,347 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2021-03-25 04:59:24,467 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:59:24,471 INFO L154 LiptonReduction]: Checked pairs total: 3 [2021-03-25 04:59:24,471 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:59:24,472 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 801 [2021-03-25 04:59:24,472 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 360 flow [2021-03-25 04:59:24,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 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:59:24,472 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:24,472 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:24,472 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 04:59:24,472 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:24,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:24,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1118255067, now seen corresponding path program 1 times [2021-03-25 04:59:24,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:24,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024142445] [2021-03-25 04:59:24,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:24,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:24,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:24,511 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-25 04:59:24,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:59:24,514 INFO L142 QuantifierPusher]: treesize reduction 14, result has 39.1 percent of original size [2021-03-25 04:59:24,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:59:24,519 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:59:24,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024142445] [2021-03-25 04:59:24,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:24,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:59:24,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424608042] [2021-03-25 04:59:24,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:59:24,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:24,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:59:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:59:24,521 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 181 [2021-03-25 04:59:24,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 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:59:24,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:24,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 181 [2021-03-25 04:59:24,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:24,576 INFO L129 PetriNetUnfolder]: 60/194 cut-off events. [2021-03-25 04:59:24,576 INFO L130 PetriNetUnfolder]: For 945/1208 co-relation queries the response was YES. [2021-03-25 04:59:24,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 194 events. 60/194 cut-off events. For 945/1208 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1078 event pairs, 2 based on Foata normal form. 149/337 useless extension candidates. Maximal degree in co-relation 846. Up to 119 conditions per place. [2021-03-25 04:59:24,577 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 6 selfloop transitions, 15 changer transitions 3/50 dead transitions. [2021-03-25 04:59:24,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 457 flow [2021-03-25 04:59:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:59:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:59:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1092 transitions. [2021-03-25 04:59:24,580 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.861878453038674 [2021-03-25 04:59:24,580 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1092 transitions. [2021-03-25 04:59:24,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1092 transitions. [2021-03-25 04:59:24,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:24,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1092 transitions. [2021-03-25 04:59:24,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.0) internal successors, (1092), 7 states have internal predecessors, (1092), 0 states have call successors, (0), 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:59:24,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 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:59:24,583 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 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:59:24,583 INFO L185 Difference]: Start difference. First operand has 56 places, 41 transitions, 360 flow. Second operand 7 states and 1092 transitions. [2021-03-25 04:59:24,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 457 flow [2021-03-25 04:59:24,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 50 transitions, 443 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-25 04:59:24,586 INFO L241 Difference]: Finished difference. Result has 63 places, 47 transitions, 440 flow [2021-03-25 04:59:24,586 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2021-03-25 04:59:24,586 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2021-03-25 04:59:24,586 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:24,586 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 47 transitions, 440 flow [2021-03-25 04:59:24,588 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 47 transitions, 440 flow [2021-03-25 04:59:24,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 47 transitions, 440 flow [2021-03-25 04:59:24,602 INFO L129 PetriNetUnfolder]: 56/188 cut-off events. [2021-03-25 04:59:24,602 INFO L130 PetriNetUnfolder]: For 948/1022 co-relation queries the response was YES. [2021-03-25 04:59:24,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 188 events. 56/188 cut-off events. For 948/1022 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1101 event pairs, 2 based on Foata normal form. 12/197 useless extension candidates. Maximal degree in co-relation 880. Up to 113 conditions per place. [2021-03-25 04:59:24,603 INFO L142 LiptonReduction]: Number of co-enabled transitions 236 [2021-03-25 04:59:24,606 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 04:59:24,606 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:59:24,606 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-25 04:59:24,607 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 440 flow [2021-03-25 04:59:24,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 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:59:24,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:24,607 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:59:24,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 04:59:24,607 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:24,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash -260438950, now seen corresponding path program 1 times [2021-03-25 04:59:24,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:24,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144315136] [2021-03-25 04:59:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:59:24,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:24,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:24,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:24,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:24,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:59:24,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:59:24,664 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 04:59:24,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:59:24,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:59:24,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144315136] [2021-03-25 04:59:24,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:59:24,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:59:24,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714902235] [2021-03-25 04:59:24,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:59:24,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:59:24,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:59:24,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:59:24,673 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 181 [2021-03-25 04:59:24,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 440 flow. Second operand has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 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:59:24,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:59:24,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 181 [2021-03-25 04:59:24,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:59:24,736 INFO L129 PetriNetUnfolder]: 44/163 cut-off events. [2021-03-25 04:59:24,736 INFO L130 PetriNetUnfolder]: For 1420/1812 co-relation queries the response was YES. [2021-03-25 04:59:24,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 163 events. 44/163 cut-off events. For 1420/1812 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 938 event pairs, 0 based on Foata normal form. 141/298 useless extension candidates. Maximal degree in co-relation 854. Up to 109 conditions per place. [2021-03-25 04:59:24,738 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 2 selfloop transitions, 19 changer transitions 3/50 dead transitions. [2021-03-25 04:59:24,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 50 transitions, 503 flow [2021-03-25 04:59:24,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 04:59:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 04:59:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1395 transitions. [2021-03-25 04:59:24,741 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.856353591160221 [2021-03-25 04:59:24,741 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1395 transitions. [2021-03-25 04:59:24,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1395 transitions. [2021-03-25 04:59:24,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:59:24,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1395 transitions. [2021-03-25 04:59:24,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 155.0) internal successors, (1395), 9 states have internal predecessors, (1395), 0 states have call successors, (0), 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:59:24,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 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:59:24,746 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 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:59:24,746 INFO L185 Difference]: Start difference. First operand has 63 places, 47 transitions, 440 flow. Second operand 9 states and 1395 transitions. [2021-03-25 04:59:24,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 50 transitions, 503 flow [2021-03-25 04:59:24,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 50 transitions, 428 flow, removed 22 selfloop flow, removed 5 redundant places. [2021-03-25 04:59:24,749 INFO L241 Difference]: Finished difference. Result has 69 places, 47 transitions, 411 flow [2021-03-25 04:59:24,749 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=411, PETRI_PLACES=69, PETRI_TRANSITIONS=47} [2021-03-25 04:59:24,749 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2021-03-25 04:59:24,749 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:59:24,749 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 47 transitions, 411 flow [2021-03-25 04:59:24,750 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 47 transitions, 411 flow [2021-03-25 04:59:24,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 47 transitions, 411 flow [2021-03-25 04:59:24,761 INFO L129 PetriNetUnfolder]: 42/160 cut-off events. [2021-03-25 04:59:24,761 INFO L130 PetriNetUnfolder]: For 761/789 co-relation queries the response was YES. [2021-03-25 04:59:24,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 160 events. 42/160 cut-off events. For 761/789 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 973 event pairs, 0 based on Foata normal form. 10/166 useless extension candidates. Maximal degree in co-relation 680. Up to 50 conditions per place. [2021-03-25 04:59:24,762 INFO L142 LiptonReduction]: Number of co-enabled transitions 228 [2021-03-25 04:59:25,353 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-25 04:59:25,572 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 04:59:26,948 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 338 DAG size of output: 262 [2021-03-25 04:59:27,460 WARN L205 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-25 04:59:27,697 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 04:59:27,931 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 04:59:28,469 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 04:59:29,010 WARN L205 SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 04:59:29,015 INFO L154 LiptonReduction]: Checked pairs total: 40 [2021-03-25 04:59:29,015 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 04:59:29,015 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4266 [2021-03-25 04:59:29,015 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 381 flow [2021-03-25 04:59:29,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 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:59:29,016 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:59:29,016 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:59:29,016 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 04:59:29,016 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:59:29,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:59:29,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1477659029, now seen corresponding path program 1 times [2021-03-25 04:59:29,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:59:29,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114311177] [2021-03-25 04:59:29,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:59:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:59:29,048 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:59:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:59:29,087 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:59:29,125 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:59:29,126 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:59:29,126 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 04:59:29,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:59:29 BasicIcfg [2021-03-25 04:59:29,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:59:29,198 INFO L168 Benchmark]: Toolchain (without parser) took 32198.06 ms. Allocated memory was 400.6 MB in the beginning and 1.0 GB in the end (delta: 601.9 MB). Free memory was 364.2 MB in the beginning and 537.4 MB in the end (delta: -173.3 MB). Peak memory consumption was 429.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:59:29,198 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 400.6 MB. Free memory was 382.1 MB in the beginning and 381.9 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:59:29,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 483.36 ms. Allocated memory is still 400.6 MB. Free memory was 364.1 MB in the beginning and 357.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:59:29,198 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.95 ms. Allocated memory is still 400.6 MB. Free memory was 357.3 MB in the beginning and 354.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:59:29,198 INFO L168 Benchmark]: Boogie Preprocessor took 25.34 ms. Allocated memory is still 400.6 MB. Free memory was 354.2 MB in the beginning and 351.0 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:59:29,199 INFO L168 Benchmark]: RCFGBuilder took 2356.67 ms. Allocated memory was 400.6 MB in the beginning and 505.4 MB in the end (delta: 104.9 MB). Free memory was 351.0 MB in the beginning and 392.7 MB in the end (delta: -41.6 MB). Peak memory consumption was 172.3 MB. Max. memory is 16.0 GB. [2021-03-25 04:59:29,199 INFO L168 Benchmark]: TraceAbstraction took 29287.95 ms. Allocated memory was 505.4 MB in the beginning and 1.0 GB in the end (delta: 497.0 MB). Free memory was 392.7 MB in the beginning and 537.4 MB in the end (delta: -144.8 MB). Peak memory consumption was 352.3 MB. Max. memory is 16.0 GB. [2021-03-25 04:59:29,199 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.37 ms. Allocated memory is still 400.6 MB. Free memory was 382.1 MB in the beginning and 381.9 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 483.36 ms. Allocated memory is still 400.6 MB. Free memory was 364.1 MB in the beginning and 357.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 36.95 ms. Allocated memory is still 400.6 MB. Free memory was 357.3 MB in the beginning and 354.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 25.34 ms. Allocated memory is still 400.6 MB. Free memory was 354.2 MB in the beginning and 351.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2356.67 ms. Allocated memory was 400.6 MB in the beginning and 505.4 MB in the end (delta: 104.9 MB). Free memory was 351.0 MB in the beginning and 392.7 MB in the end (delta: -41.6 MB). Peak memory consumption was 172.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 29287.95 ms. Allocated memory was 505.4 MB in the beginning and 1.0 GB in the end (delta: 497.0 MB). Free memory was 392.7 MB in the beginning and 537.4 MB in the end (delta: -144.8 MB). Peak memory consumption was 352.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7671.5ms, 102 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 39 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 61 TotalNumberOfCompositions, 3074 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1195, positive: 1115, positive conditional: 0, positive unconditional: 1115, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 742, positive: 720, positive conditional: 0, positive unconditional: 720, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 742, positive: 720, positive conditional: 0, positive unconditional: 720, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1195, positive: 395, positive conditional: 0, positive unconditional: 395, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 742, unknown conditional: 0, unknown unconditional: 742] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5140.1ms, 45 PlacesBefore, 34 PlacesAfterwards, 36 TransitionsBefore, 25 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1020 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 227, positive: 165, positive conditional: 0, positive unconditional: 165, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 55, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 227, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 55, unknown conditional: 0, unknown unconditional: 55] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1084.2ms, 37 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 142, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 142, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.2ms, 34 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.0ms, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.7ms, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 62 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 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: 12, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 691.6ms, 42 PlacesBefore, 42 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 193 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 33, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45.1ms, 44 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 63 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 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: 11, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.1ms, 49 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 84 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 23, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.6ms, 52 PlacesBefore, 52 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 64 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 3, negative conditional: 0, negative unconditional: 3, 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: 19, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 417.2ms, 58 PlacesBefore, 58 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 292 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 16, negative conditional: 0, negative unconditional: 16, 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: 70, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.5ms, 61 PlacesBefore, 61 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 9, negative conditional: 0, negative unconditional: 9, 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: 23, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.8ms, 60 PlacesBefore, 58 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 139 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 8, negative conditional: 0, negative unconditional: 8, 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: 37, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.5ms, 65 PlacesBefore, 60 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 7, negative conditional: 0, negative unconditional: 7, 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: 32, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.5ms, 58 PlacesBefore, 58 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 257 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 51, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.9ms, 66 PlacesBefore, 64 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 270 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, 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: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 48, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 85.1ms, 69 PlacesBefore, 69 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 580 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 87, positive conditional: 0, positive unconditional: 87, 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: 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: 111, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2960.2ms, 75 PlacesBefore, 71 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 521 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 133, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 133, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 800.3ms, 56 PlacesBefore, 56 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.7ms, 63 PlacesBefore, 63 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , 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: 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] , 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4265.6ms, 69 PlacesBefore, 66 PlacesAfterwards, 47 TransitionsBefore, 42 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 40 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 0, negative conditional: 0, negative unconditional: 0, 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: 40, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1879; [L845] FCALL, FORK 0 pthread_create(&t1879, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1880; [L847] FCALL, FORK 0 pthread_create(&t1880, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 [L773] 2 y = 1 [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L848] 0 pthread_t t1881; [L849] FCALL, FORK 0 pthread_create(&t1881, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 29075.5ms, OverallIterations: 21, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3027.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7726.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 126 SDtfs, 93 SDslu, 86 SDs, 0 SdLazy, 875 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 992.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 845.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=723occurred in iteration=16, InterpolantAutomatonStates: 106, 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: 74.3ms SsaConstructionTime, 672.2ms SatisfiabilityAnalysisTime, 1420.9ms InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 2403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...