/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 09:54:43,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 09:54:43,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 09:54:43,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 09:54:43,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 09:54:43,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 09:54:43,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 09:54:43,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 09:54:43,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 09:54:43,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 09:54:43,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 09:54:43,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 09:54:43,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 09:54:43,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 09:54:43,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 09:54:43,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 09:54:43,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 09:54:43,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 09:54:43,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 09:54:43,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 09:54:43,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 09:54:43,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 09:54:43,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 09:54:43,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 09:54:43,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 09:54:43,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 09:54:43,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 09:54:43,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 09:54:43,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 09:54:43,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 09:54:43,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 09:54:43,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 09:54:43,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 09:54:43,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 09:54:43,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 09:54:43,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 09:54:43,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 09:54:43,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 09:54:43,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 09:54:43,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 09:54:43,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 09:54:43,787 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 09:54:43,806 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 09:54:43,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 09:54:43,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 09:54:43,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 09:54:43,808 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 09:54:43,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 09:54:43,808 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 09:54:43,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 09:54:43,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 09:54:43,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 09:54:43,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 09:54:43,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 09:54:43,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 09:54:43,809 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 09:54:43,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 09:54:43,809 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 09:54:43,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 09:54:43,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 09:54:43,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 09:54:43,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 09:54:43,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 09:54:43,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 09:54:43,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 09:54:43,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 09:54:43,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 09:54:43,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 09:54:43,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 09:54:43,811 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 09:54:43,811 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 09:54:43,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 09:54:43,811 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-26 09:54:44,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 09:54:44,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 09:54:44,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 09:54:44,120 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 09:54:44,121 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 09:54:44,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.oepc.i [2021-03-26 09:54:44,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3553a371/09369968daf54162a782907cdb7b51d4/FLAG221c0f382 [2021-03-26 09:54:44,766 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 09:54:44,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_rmo.oepc.i [2021-03-26 09:54:44,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3553a371/09369968daf54162a782907cdb7b51d4/FLAG221c0f382 [2021-03-26 09:54:45,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3553a371/09369968daf54162a782907cdb7b51d4 [2021-03-26 09:54:45,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 09:54:45,051 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 09:54:45,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 09:54:45,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 09:54:45,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 09:54:45,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:54:45" (1/1) ... [2021-03-26 09:54:45,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdf035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45, skipping insertion in model container [2021-03-26 09:54:45,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:54:45" (1/1) ... [2021-03-26 09:54:45,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 09:54:45,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 09:54:45,237 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/mix012_rmo.oepc.i[949,962] [2021-03-26 09:54:45,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:54:45,447 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 09:54:45,456 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/mix012_rmo.oepc.i[949,962] [2021-03-26 09:54:45,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:54:45,554 INFO L208 MainTranslator]: Completed translation [2021-03-26 09:54:45,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45 WrapperNode [2021-03-26 09:54:45,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 09:54:45,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 09:54:45,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 09:54:45,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 09:54:45,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45" (1/1) ... [2021-03-26 09:54:45,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45" (1/1) ... [2021-03-26 09:54:45,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 09:54:45,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 09:54:45,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 09:54:45,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 09:54:45,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45" (1/1) ... [2021-03-26 09:54:45,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45" (1/1) ... [2021-03-26 09:54:45,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45" (1/1) ... [2021-03-26 09:54:45,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45" (1/1) ... [2021-03-26 09:54:45,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45" (1/1) ... [2021-03-26 09:54:45,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45" (1/1) ... [2021-03-26 09:54:45,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45" (1/1) ... [2021-03-26 09:54:45,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 09:54:45,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 09:54:45,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 09:54:45,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 09:54:45,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45" (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-26 09:54:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 09:54:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 09:54:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 09:54:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 09:54:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 09:54:45,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 09:54:45,701 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 09:54:45,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 09:54:45,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 09:54:45,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 09:54:45,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 09:54:45,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 09:54:45,703 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 09:54:47,252 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 09:54:47,252 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 09:54:47,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:54:47 BoogieIcfgContainer [2021-03-26 09:54:47,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 09:54:47,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 09:54:47,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 09:54:47,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 09:54:47,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 09:54:45" (1/3) ... [2021-03-26 09:54:47,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c4647e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:54:47, skipping insertion in model container [2021-03-26 09:54:47,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:54:45" (2/3) ... [2021-03-26 09:54:47,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c4647e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:54:47, skipping insertion in model container [2021-03-26 09:54:47,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:54:47" (3/3) ... [2021-03-26 09:54:47,262 INFO L111 eAbstractionObserver]: Analyzing ICFG mix012_rmo.oepc.i [2021-03-26 09:54:47,268 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 09:54:47,271 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 09:54:47,272 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 09:54:47,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,300 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,300 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,300 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,300 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,300 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,304 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,304 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,320 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,321 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,321 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,324 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:54:47,327 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 09:54:47,343 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 09:54:47,360 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 09:54:47,360 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 09:54:47,360 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 09:54:47,360 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 09:54:47,360 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 09:54:47,360 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 09:54:47,360 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 09:54:47,360 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 09:54:47,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 176 flow [2021-03-26 09:54:47,396 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-26 09:54:47,396 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:54:47,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-03-26 09:54:47,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 83 transitions, 176 flow [2021-03-26 09:54:47,403 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 81 transitions, 168 flow [2021-03-26 09:54:47,404 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:54:47,415 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-26 09:54:47,418 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-26 09:54:47,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 81 transitions, 168 flow [2021-03-26 09:54:47,433 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-26 09:54:47,433 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:54:47,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-03-26 09:54:47,436 INFO L142 LiptonReduction]: Number of co-enabled transitions 992 [2021-03-26 09:54:48,626 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 09:54:48,978 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 09:54:49,085 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 09:54:50,101 INFO L154 LiptonReduction]: Checked pairs total: 1854 [2021-03-26 09:54:50,101 INFO L156 LiptonReduction]: Total number of compositions: 63 [2021-03-26 09:54:50,103 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2700 [2021-03-26 09:54:50,114 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2021-03-26 09:54:50,114 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:54:50,114 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:54:50,115 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:54:50,115 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:54:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:54:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1445182060, now seen corresponding path program 1 times [2021-03-26 09:54:50,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:54:50,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224977850] [2021-03-26 09:54:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:54:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:54:50,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:50,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:54:50,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:50,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:54:50,312 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-26 09:54:50,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224977850] [2021-03-26 09:54:50,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:54:50,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:54:50,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859657736] [2021-03-26 09:54:50,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 09:54:50,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:54:50,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 09:54:50,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 09:54:50,332 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 146 [2021-03-26 09:54:50,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-26 09:54:50,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:54:50,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 146 [2021-03-26 09:54:50,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:54:50,376 INFO L129 PetriNetUnfolder]: 16/76 cut-off events. [2021-03-26 09:54:50,377 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:54:50,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 76 events. 16/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 270 event pairs, 11 based on Foata normal form. 9/77 useless extension candidates. Maximal degree in co-relation 104. Up to 27 conditions per place. [2021-03-26 09:54:50,378 INFO L132 encePairwiseOnDemand]: 142/146 looper letters, 7 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2021-03-26 09:54:50,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 80 flow [2021-03-26 09:54:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:54:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:54:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2021-03-26 09:54:50,390 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8698630136986302 [2021-03-26 09:54:50,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2021-03-26 09:54:50,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2021-03-26 09:54:50,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:54:50,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2021-03-26 09:54:50,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-26 09:54:50,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 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-26 09:54:50,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 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-26 09:54:50,404 INFO L185 Difference]: Start difference. First operand has 34 places, 28 transitions, 62 flow. Second operand 3 states and 381 transitions. [2021-03-26 09:54:50,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 80 flow [2021-03-26 09:54:50,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:54:50,408 INFO L241 Difference]: Finished difference. Result has 32 places, 25 transitions, 58 flow [2021-03-26 09:54:50,410 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, 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=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2021-03-26 09:54:50,410 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2021-03-26 09:54:50,411 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:54:50,411 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 58 flow [2021-03-26 09:54:50,411 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 58 flow [2021-03-26 09:54:50,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 58 flow [2021-03-26 09:54:50,415 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-26 09:54:50,416 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:54:50,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 09:54:50,416 INFO L142 LiptonReduction]: Number of co-enabled transitions 182 [2021-03-26 09:54:51,727 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 09:54:51,834 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 09:54:52,093 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-26 09:54:52,224 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 09:54:52,226 INFO L154 LiptonReduction]: Checked pairs total: 820 [2021-03-26 09:54:52,226 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 09:54:52,227 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1816 [2021-03-26 09:54:52,228 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-26 09:54:52,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-26 09:54:52,228 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:54:52,228 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:54:52,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 09:54:52,229 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:54:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:54:52,229 INFO L82 PathProgramCache]: Analyzing trace with hash 909409370, now seen corresponding path program 1 times [2021-03-26 09:54:52,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:54:52,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628921639] [2021-03-26 09:54:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:54:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:54:52,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:52,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:54:52,321 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-26 09:54:52,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 09:54:52,337 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 09:54:52,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:54:52,341 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-26 09:54:52,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628921639] [2021-03-26 09:54:52,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:54:52,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:54:52,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979483271] [2021-03-26 09:54:52,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:54:52,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:54:52,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:54:52,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:54:52,345 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 153 [2021-03-26 09:54:52,345 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 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-26 09:54:52,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:54:52,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 153 [2021-03-26 09:54:52,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:54:52,399 INFO L129 PetriNetUnfolder]: 14/60 cut-off events. [2021-03-26 09:54:52,400 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:54:52,401 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 60 events. 14/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 204 event pairs, 3 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 96. Up to 18 conditions per place. [2021-03-26 09:54:52,401 INFO L132 encePairwiseOnDemand]: 147/153 looper letters, 4 selfloop transitions, 3 changer transitions 8/27 dead transitions. [2021-03-26 09:54:52,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 92 flow [2021-03-26 09:54:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:54:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:54:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2021-03-26 09:54:52,408 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8052287581699347 [2021-03-26 09:54:52,408 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2021-03-26 09:54:52,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2021-03-26 09:54:52,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:54:52,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2021-03-26 09:54:52,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 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-26 09:54:52,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 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-26 09:54:52,415 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 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-26 09:54:52,415 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 616 transitions. [2021-03-26 09:54:52,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 92 flow [2021-03-26 09:54:52,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:54:52,416 INFO L241 Difference]: Finished difference. Result has 29 places, 19 transitions, 63 flow [2021-03-26 09:54:52,417 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2021-03-26 09:54:52,417 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2021-03-26 09:54:52,417 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:54:52,417 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 63 flow [2021-03-26 09:54:52,418 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 63 flow [2021-03-26 09:54:52,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 63 flow [2021-03-26 09:54:52,423 INFO L129 PetriNetUnfolder]: 5/31 cut-off events. [2021-03-26 09:54:52,423 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 09:54:52,424 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 31 events. 5/31 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 53. Up to 12 conditions per place. [2021-03-26 09:54:52,424 INFO L142 LiptonReduction]: Number of co-enabled transitions 132 [2021-03-26 09:54:52,426 INFO L154 LiptonReduction]: Checked pairs total: 123 [2021-03-26 09:54:52,426 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:54:52,426 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-26 09:54:52,428 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 63 flow [2021-03-26 09:54:52,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 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-26 09:54:52,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:54:52,429 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:54:52,429 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 09:54:52,429 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:54:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:54:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1869165286, now seen corresponding path program 1 times [2021-03-26 09:54:52,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:54:52,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158511467] [2021-03-26 09:54:52,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:54:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:54:52,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:52,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:54:52,542 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-26 09:54:52,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158511467] [2021-03-26 09:54:52,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:54:52,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 09:54:52,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744935437] [2021-03-26 09:54:52,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 09:54:52,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:54:52,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 09:54:52,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 09:54:52,545 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 153 [2021-03-26 09:54:52,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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-26 09:54:52,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:54:52,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 153 [2021-03-26 09:54:52,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:54:52,552 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-26 09:54:52,553 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 09:54:52,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 28 events. 3/28 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 09:54:52,553 INFO L132 encePairwiseOnDemand]: 150/153 looper letters, 1 selfloop transitions, 3 changer transitions 0/19 dead transitions. [2021-03-26 09:54:52,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 19 transitions, 71 flow [2021-03-26 09:54:52,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:54:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:54:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2021-03-26 09:54:52,555 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8649237472766884 [2021-03-26 09:54:52,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2021-03-26 09:54:52,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2021-03-26 09:54:52,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:54:52,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2021-03-26 09:54:52,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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-26 09:54:52,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 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-26 09:54:52,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 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-26 09:54:52,558 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 63 flow. Second operand 3 states and 397 transitions. [2021-03-26 09:54:52,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 19 transitions, 71 flow [2021-03-26 09:54:52,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 66 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 09:54:52,559 INFO L241 Difference]: Finished difference. Result has 28 places, 19 transitions, 69 flow [2021-03-26 09:54:52,559 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2021-03-26 09:54:52,559 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, -6 predicate places. [2021-03-26 09:54:52,559 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:54:52,560 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 19 transitions, 69 flow [2021-03-26 09:54:52,560 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 69 flow [2021-03-26 09:54:52,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 19 transitions, 69 flow [2021-03-26 09:54:52,564 INFO L129 PetriNetUnfolder]: 5/32 cut-off events. [2021-03-26 09:54:52,565 INFO L130 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2021-03-26 09:54:52,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 32 events. 5/32 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 4 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 56. Up to 11 conditions per place. [2021-03-26 09:54:52,565 INFO L142 LiptonReduction]: Number of co-enabled transitions 130 [2021-03-26 09:54:52,566 INFO L154 LiptonReduction]: Checked pairs total: 100 [2021-03-26 09:54:52,566 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:54:52,567 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-26 09:54:52,567 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 69 flow [2021-03-26 09:54:52,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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-26 09:54:52,568 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:54:52,568 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:54:52,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 09:54:52,568 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:54:52,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:54:52,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1869174679, now seen corresponding path program 1 times [2021-03-26 09:54:52,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:54:52,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144360615] [2021-03-26 09:54:52,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:54:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:54:52,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:52,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:54:52,615 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 09:54:52,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 09:54:52,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:52,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:54:52,621 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-26 09:54:52,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144360615] [2021-03-26 09:54:52,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:54:52,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:54:52,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161641981] [2021-03-26 09:54:52,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:54:52,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:54:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:54:52,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:54:52,624 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 153 [2021-03-26 09:54:52,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:54:52,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:54:52,625 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 153 [2021-03-26 09:54:52,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:54:52,665 INFO L129 PetriNetUnfolder]: 14/54 cut-off events. [2021-03-26 09:54:52,665 INFO L130 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2021-03-26 09:54:52,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 54 events. 14/54 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 163 event pairs, 2 based on Foata normal form. 5/49 useless extension candidates. Maximal degree in co-relation 110. Up to 27 conditions per place. [2021-03-26 09:54:52,666 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 6 selfloop transitions, 5 changer transitions 3/27 dead transitions. [2021-03-26 09:54:52,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 113 flow [2021-03-26 09:54:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:54:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:54:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2021-03-26 09:54:52,669 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8313725490196079 [2021-03-26 09:54:52,669 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2021-03-26 09:54:52,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2021-03-26 09:54:52,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:54:52,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2021-03-26 09:54:52,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 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-26 09:54:52,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 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-26 09:54:52,673 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 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-26 09:54:52,673 INFO L185 Difference]: Start difference. First operand has 28 places, 19 transitions, 69 flow. Second operand 5 states and 636 transitions. [2021-03-26 09:54:52,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 113 flow [2021-03-26 09:54:52,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:54:52,676 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 100 flow [2021-03-26 09:54:52,676 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-26 09:54:52,676 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2021-03-26 09:54:52,676 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:54:52,676 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 100 flow [2021-03-26 09:54:52,676 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 100 flow [2021-03-26 09:54:52,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 100 flow [2021-03-26 09:54:52,689 INFO L129 PetriNetUnfolder]: 5/45 cut-off events. [2021-03-26 09:54:52,689 INFO L130 PetriNetUnfolder]: For 19/24 co-relation queries the response was YES. [2021-03-26 09:54:52,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 45 events. 5/45 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 3 based on Foata normal form. 2/44 useless extension candidates. Maximal degree in co-relation 103. Up to 15 conditions per place. [2021-03-26 09:54:52,691 INFO L142 LiptonReduction]: Number of co-enabled transitions 144 [2021-03-26 09:54:52,733 INFO L154 LiptonReduction]: Checked pairs total: 77 [2021-03-26 09:54:52,733 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:54:52,733 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 57 [2021-03-26 09:54:52,737 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 100 flow [2021-03-26 09:54:52,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:54:52,737 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:54:52,737 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:54:52,737 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 09:54:52,738 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:54:52,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:54:52,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1872435451, now seen corresponding path program 1 times [2021-03-26 09:54:52,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:54:52,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479634093] [2021-03-26 09:54:52,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:54:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:54:52,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:52,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:54:52,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:52,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:54:52,893 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 09:54:52,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 09:54:52,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:52,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:54:52,902 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-26 09:54:52,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479634093] [2021-03-26 09:54:52,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:54:52,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:54:52,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063485531] [2021-03-26 09:54:52,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:54:52,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:54:52,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:54:52,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:54:52,910 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 153 [2021-03-26 09:54:52,911 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 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-26 09:54:52,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:54:52,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 153 [2021-03-26 09:54:52,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:54:52,957 INFO L129 PetriNetUnfolder]: 9/43 cut-off events. [2021-03-26 09:54:52,958 INFO L130 PetriNetUnfolder]: For 42/67 co-relation queries the response was YES. [2021-03-26 09:54:52,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 43 events. 9/43 cut-off events. For 42/67 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 104 event pairs, 0 based on Foata normal form. 17/56 useless extension candidates. Maximal degree in co-relation 117. Up to 16 conditions per place. [2021-03-26 09:54:52,958 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 4 selfloop transitions, 8 changer transitions 3/28 dead transitions. [2021-03-26 09:54:52,958 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 148 flow [2021-03-26 09:54:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:54:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:54:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 885 transitions. [2021-03-26 09:54:52,961 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8263305322128851 [2021-03-26 09:54:52,961 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 885 transitions. [2021-03-26 09:54:52,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 885 transitions. [2021-03-26 09:54:52,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:54:52,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 885 transitions. [2021-03-26 09:54:52,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 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-26 09:54:52,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 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-26 09:54:52,967 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 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-26 09:54:52,967 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 100 flow. Second operand 7 states and 885 transitions. [2021-03-26 09:54:52,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 148 flow [2021-03-26 09:54:52,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 141 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 09:54:52,968 INFO L241 Difference]: Finished difference. Result has 41 places, 24 transitions, 126 flow [2021-03-26 09:54:52,969 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2021-03-26 09:54:52,969 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2021-03-26 09:54:52,969 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:54:52,969 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 24 transitions, 126 flow [2021-03-26 09:54:52,969 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 126 flow [2021-03-26 09:54:52,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 24 transitions, 126 flow [2021-03-26 09:54:52,974 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 09:54:52,975 INFO L130 PetriNetUnfolder]: For 38/39 co-relation queries the response was YES. [2021-03-26 09:54:52,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 31 events. 3/31 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 81. Up to 10 conditions per place. [2021-03-26 09:54:52,975 INFO L142 LiptonReduction]: Number of co-enabled transitions 114 [2021-03-26 09:54:53,209 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 09:54:53,338 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 09:54:53,621 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-03-26 09:54:53,749 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-03-26 09:54:53,752 INFO L154 LiptonReduction]: Checked pairs total: 255 [2021-03-26 09:54:53,752 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 09:54:53,752 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 783 [2021-03-26 09:54:53,753 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 20 transitions, 106 flow [2021-03-26 09:54:53,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 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-26 09:54:53,753 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:54:53,753 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:54:53,754 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 09:54:53,754 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:54:53,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:54:53,754 INFO L82 PathProgramCache]: Analyzing trace with hash -410536755, now seen corresponding path program 1 times [2021-03-26 09:54:53,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:54:53,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682004967] [2021-03-26 09:54:53,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:54:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:54:53,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:53,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:54:53,866 INFO L142 QuantifierPusher]: treesize reduction 5, result has 85.3 percent of original size [2021-03-26 09:54:53,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 09:54:53,887 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-26 09:54:53,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 09:54:53,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:53,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:54:53,911 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-26 09:54:53,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682004967] [2021-03-26 09:54:53,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:54:53,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:54:53,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876916056] [2021-03-26 09:54:53,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:54:53,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:54:53,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:54:53,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:54:53,916 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 155 [2021-03-26 09:54:53,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 20 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 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-26 09:54:53,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:54:53,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 155 [2021-03-26 09:54:53,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:54:54,009 INFO L129 PetriNetUnfolder]: 10/50 cut-off events. [2021-03-26 09:54:54,009 INFO L130 PetriNetUnfolder]: For 154/158 co-relation queries the response was YES. [2021-03-26 09:54:54,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 50 events. 10/50 cut-off events. For 154/158 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 1 based on Foata normal form. 5/55 useless extension candidates. Maximal degree in co-relation 147. Up to 16 conditions per place. [2021-03-26 09:54:54,010 INFO L132 encePairwiseOnDemand]: 150/155 looper letters, 5 selfloop transitions, 6 changer transitions 2/26 dead transitions. [2021-03-26 09:54:54,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 26 transitions, 153 flow [2021-03-26 09:54:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:54:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:54:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions. [2021-03-26 09:54:54,013 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7182795698924731 [2021-03-26 09:54:54,013 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 668 transitions. [2021-03-26 09:54:54,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions. [2021-03-26 09:54:54,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:54:54,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions. [2021-03-26 09:54:54,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 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-26 09:54:54,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 155.0) internal successors, (1085), 7 states have internal predecessors, (1085), 0 states have call successors, (0), 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-26 09:54:54,017 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 155.0) internal successors, (1085), 7 states have internal predecessors, (1085), 0 states have call successors, (0), 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-26 09:54:54,017 INFO L185 Difference]: Start difference. First operand has 38 places, 20 transitions, 106 flow. Second operand 6 states and 668 transitions. [2021-03-26 09:54:54,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 26 transitions, 153 flow [2021-03-26 09:54:54,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 122 flow, removed 11 selfloop flow, removed 7 redundant places. [2021-03-26 09:54:54,020 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 121 flow [2021-03-26 09:54:54,020 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-26 09:54:54,020 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2021-03-26 09:54:54,020 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:54:54,020 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 121 flow [2021-03-26 09:54:54,021 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 121 flow [2021-03-26 09:54:54,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 121 flow [2021-03-26 09:54:54,028 INFO L129 PetriNetUnfolder]: 9/45 cut-off events. [2021-03-26 09:54:54,029 INFO L130 PetriNetUnfolder]: For 33/35 co-relation queries the response was YES. [2021-03-26 09:54:54,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 45 events. 9/45 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 109 event pairs, 0 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 114. Up to 11 conditions per place. [2021-03-26 09:54:54,030 INFO L142 LiptonReduction]: Number of co-enabled transitions 82 [2021-03-26 09:54:54,169 INFO L154 LiptonReduction]: Checked pairs total: 15 [2021-03-26 09:54:54,169 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:54:54,169 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 149 [2021-03-26 09:54:54,170 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 124 flow [2021-03-26 09:54:54,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 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-26 09:54:54,170 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:54:54,170 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:54:54,170 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 09:54:54,170 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:54:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:54:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash -909093414, now seen corresponding path program 1 times [2021-03-26 09:54:54,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:54:54,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856192157] [2021-03-26 09:54:54,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:54:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:54:54,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:54,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:54:54,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:54,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:54:54,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:54:54,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:54:54,238 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-26 09:54:54,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856192157] [2021-03-26 09:54:54,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:54:54,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:54:54,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052972379] [2021-03-26 09:54:54,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:54:54,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:54:54,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:54:54,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:54:54,242 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 157 [2021-03-26 09:54:54,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 124 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-26 09:54:54,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:54:54,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 157 [2021-03-26 09:54:54,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:54:54,275 INFO L129 PetriNetUnfolder]: 8/57 cut-off events. [2021-03-26 09:54:54,275 INFO L130 PetriNetUnfolder]: For 105/114 co-relation queries the response was YES. [2021-03-26 09:54:54,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 57 events. 8/57 cut-off events. For 105/114 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 1 based on Foata normal form. 10/66 useless extension candidates. Maximal degree in co-relation 156. Up to 14 conditions per place. [2021-03-26 09:54:54,276 INFO L132 encePairwiseOnDemand]: 152/157 looper letters, 4 selfloop transitions, 1 changer transitions 9/25 dead transitions. [2021-03-26 09:54:54,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 144 flow [2021-03-26 09:54:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:54:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:54:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2021-03-26 09:54:54,279 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8121019108280255 [2021-03-26 09:54:54,279 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2021-03-26 09:54:54,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2021-03-26 09:54:54,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:54:54,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2021-03-26 09:54:54,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 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-26 09:54:54,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 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-26 09:54:54,282 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 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-26 09:54:54,282 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 124 flow. Second operand 4 states and 510 transitions. [2021-03-26 09:54:54,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 144 flow [2021-03-26 09:54:54,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 142 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 09:54:54,286 INFO L241 Difference]: Finished difference. Result has 37 places, 16 transitions, 81 flow [2021-03-26 09:54:54,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=37, PETRI_TRANSITIONS=16} [2021-03-26 09:54:54,286 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2021-03-26 09:54:54,287 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:54:54,287 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 16 transitions, 81 flow [2021-03-26 09:54:54,287 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 16 transitions, 81 flow [2021-03-26 09:54:54,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 16 transitions, 81 flow [2021-03-26 09:54:54,294 INFO L129 PetriNetUnfolder]: 1/17 cut-off events. [2021-03-26 09:54:54,294 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-03-26 09:54:54,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 17 events. 1/17 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2021-03-26 09:54:54,294 INFO L142 LiptonReduction]: Number of co-enabled transitions 30 [2021-03-26 09:54:54,935 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 172 [2021-03-26 09:54:55,177 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2021-03-26 09:54:56,367 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 296 DAG size of output: 252 [2021-03-26 09:54:56,889 WARN L205 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-26 09:54:57,152 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 09:54:57,443 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 09:54:58,449 WARN L205 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 257 DAG size of output: 256 [2021-03-26 09:54:59,036 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 09:54:59,039 INFO L154 LiptonReduction]: Checked pairs total: 35 [2021-03-26 09:54:59,039 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:54:59,039 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4753 [2021-03-26 09:54:59,040 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 14 transitions, 77 flow [2021-03-26 09:54:59,040 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-26 09:54:59,040 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:54:59,040 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:54:59,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 09:54:59,040 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:54:59,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:54:59,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1639215355, now seen corresponding path program 1 times [2021-03-26 09:54:59,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:54:59,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804038446] [2021-03-26 09:54:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:54:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:54:59,076 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:54:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:54:59,110 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:54:59,132 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 09:54:59,132 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 09:54:59,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 09:54:59,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 09:54:59 BasicIcfg [2021-03-26 09:54:59,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 09:54:59,191 INFO L168 Benchmark]: Toolchain (without parser) took 14128.25 ms. Allocated memory was 255.9 MB in the beginning and 557.8 MB in the end (delta: 302.0 MB). Free memory was 234.7 MB in the beginning and 475.5 MB in the end (delta: -240.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 16.0 GB. [2021-03-26 09:54:59,191 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 09:54:59,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 501.47 ms. Allocated memory was 255.9 MB in the beginning and 356.5 MB in the end (delta: 100.7 MB). Free memory was 234.3 MB in the beginning and 316.2 MB in the end (delta: -81.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 09:54:59,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.51 ms. Allocated memory is still 356.5 MB. Free memory was 316.2 MB in the beginning and 314.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:54:59,192 INFO L168 Benchmark]: Boogie Preprocessor took 36.89 ms. Allocated memory is still 356.5 MB. Free memory was 314.1 MB in the beginning and 312.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:54:59,192 INFO L168 Benchmark]: RCFGBuilder took 1616.05 ms. Allocated memory is still 356.5 MB. Free memory was 312.0 MB in the beginning and 330.9 MB in the end (delta: -18.9 MB). Peak memory consumption was 67.6 MB. Max. memory is 16.0 GB. [2021-03-26 09:54:59,192 INFO L168 Benchmark]: TraceAbstraction took 11921.89 ms. Allocated memory was 356.5 MB in the beginning and 557.8 MB in the end (delta: 201.3 MB). Free memory was 329.8 MB in the beginning and 475.5 MB in the end (delta: -145.7 MB). Peak memory consumption was 55.6 MB. Max. memory is 16.0 GB. [2021-03-26 09:54:59,194 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.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 501.47 ms. Allocated memory was 255.9 MB in the beginning and 356.5 MB in the end (delta: 100.7 MB). Free memory was 234.3 MB in the beginning and 316.2 MB in the end (delta: -81.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 44.51 ms. Allocated memory is still 356.5 MB. Free memory was 316.2 MB in the beginning and 314.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 36.89 ms. Allocated memory is still 356.5 MB. Free memory was 314.1 MB in the beginning and 312.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1616.05 ms. Allocated memory is still 356.5 MB. Free memory was 312.0 MB in the beginning and 330.9 MB in the end (delta: -18.9 MB). Peak memory consumption was 67.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11921.89 ms. Allocated memory was 356.5 MB in the beginning and 557.8 MB in the end (delta: 201.3 MB). Free memory was 329.8 MB in the beginning and 475.5 MB in the end (delta: -145.7 MB). Peak memory consumption was 55.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2683.5ms, 86 PlacesBefore, 34 PlacesAfterwards, 81 TransitionsBefore, 28 TransitionsAfterwards, 992 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 63 TotalNumberOfCompositions, 1854 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 883, positive: 813, positive conditional: 813, positive unconditional: 0, negative: 70, negative conditional: 70, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 883, positive: 813, positive conditional: 0, positive unconditional: 813, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 883, positive: 813, positive conditional: 0, positive unconditional: 813, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 680, positive: 648, positive conditional: 0, positive unconditional: 648, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 680, positive: 646, positive conditional: 0, positive unconditional: 646, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 530, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 524, negative conditional: 0, negative unconditional: 524, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 883, positive: 165, positive conditional: 0, positive unconditional: 165, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 680, unknown conditional: 0, unknown unconditional: 680] , Statistics on independence cache: Total cache size (in pairs): 680, Positive cache size: 648, Positive conditional cache size: 0, Positive unconditional cache size: 648, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1815.4ms, 32 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 18 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 4 FixpointIterations, 5 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 820 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 212, positive: 134, positive conditional: 134, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 212, positive: 134, positive conditional: 2, positive unconditional: 132, negative: 78, negative conditional: 4, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 212, positive: 134, positive conditional: 2, positive unconditional: 132, negative: 78, negative conditional: 4, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, positive: 41, positive conditional: 2, positive unconditional: 39, negative: 19, negative conditional: 2, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 19, negative conditional: 2, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 296, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 294, negative conditional: 53, negative unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 212, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 59, negative conditional: 2, negative unconditional: 57, unknown: 60, unknown conditional: 4, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 740, Positive cache size: 689, Positive conditional cache size: 2, Positive unconditional cache size: 687, Negative cache size: 51, Negative conditional cache size: 2, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4ms, 29 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 123 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 36, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 752, Positive cache size: 701, Positive conditional cache size: 2, Positive unconditional cache size: 699, Negative cache size: 51, Negative conditional cache size: 2, Negative unconditional cache size: 49, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6ms, 28 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 100 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 30, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 752, Positive cache size: 701, Positive conditional cache size: 2, Positive unconditional cache size: 699, Negative cache size: 51, Negative conditional cache size: 2, Negative unconditional cache size: 49, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.6ms, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 77 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, positive: 14, positive conditional: 4, positive unconditional: 10, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 14, positive conditional: 4, positive unconditional: 10, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 12, positive conditional: 3, positive unconditional: 9, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 756, Positive cache size: 703, Positive conditional cache size: 3, Positive unconditional cache size: 700, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 782.7ms, 41 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 20 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 255 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, positive: 37, positive conditional: 20, positive unconditional: 17, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 37, positive conditional: 20, positive unconditional: 17, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 67, positive: 37, positive conditional: 20, positive unconditional: 17, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 756, Positive cache size: 703, Positive conditional cache size: 3, Positive unconditional cache size: 700, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 148.4ms, 35 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 15 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, positive: 13, positive conditional: 5, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 5, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 1, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 14, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 761, Positive cache size: 708, Positive conditional cache size: 4, Positive unconditional cache size: 704, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4752.0ms, 37 PlacesBefore, 32 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 30 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 35 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, positive: 12, positive conditional: 5, positive unconditional: 7, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 12, positive conditional: 5, positive unconditional: 7, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 9, positive conditional: 4, positive unconditional: 5, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 764, Positive cache size: 711, Positive conditional cache size: 5, Positive unconditional cache size: 706, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [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$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t313; [L813] FCALL, FORK 0 pthread_create(&t313, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 0 pthread_t t314; [L815] FCALL, FORK 0 pthread_create(&t314, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L790] 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) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] 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) [L790] 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) [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L792] 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 [L793] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 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 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L821] 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) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] 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) [L821] 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) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 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 [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 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 [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11776.9ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 437.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2751.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 31 SDtfs, 18 SDslu, 14 SDs, 0 SdLazy, 102 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 143.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 98.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=5, InterpolantAutomatonStates: 33, 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: 23.9ms SsaConstructionTime, 295.2ms SatisfiabilityAnalysisTime, 428.1ms InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...