/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/safe024_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 16:21:51,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 16:21:51,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 16:21:51,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 16:21:51,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 16:21:51,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 16:21:51,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 16:21:51,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 16:21:51,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 16:21:51,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 16:21:51,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 16:21:51,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 16:21:51,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 16:21:51,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 16:21:51,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 16:21:51,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 16:21:51,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 16:21:51,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 16:21:51,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 16:21:51,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 16:21:51,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 16:21:51,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 16:21:51,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 16:21:51,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 16:21:51,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 16:21:51,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 16:21:51,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 16:21:51,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 16:21:51,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 16:21:51,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 16:21:51,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 16:21:51,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 16:21:51,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 16:21:51,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 16:21:51,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 16:21:51,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 16:21:51,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 16:21:51,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 16:21:51,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 16:21:51,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 16:21:51,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 16:21:51,791 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-06-11 16:21:51,824 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 16:21:51,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 16:21:51,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 16:21:51,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 16:21:51,827 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 16:21:51,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 16:21:51,828 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 16:21:51,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 16:21:51,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 16:21:51,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 16:21:51,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 16:21:51,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 16:21:51,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 16:21:51,830 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 16:21:51,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 16:21:51,830 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 16:21:51,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 16:21:51,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 16:21:51,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 16:21:51,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 16:21:51,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 16:21:51,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 16:21:51,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 16:21:51,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 16:21:51,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 16:21:51,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 16:21:51,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 16:21:51,832 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 16:21:51,832 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 16:21:51,832 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 16:21:51,832 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-06-11 16:21:52,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 16:21:52,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 16:21:52,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 16:21:52,140 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 16:21:52,141 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 16:21:52,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i [2021-06-11 16:21:52,199 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b0e7066/f4825c9c547549bfa99a90292f93575f/FLAGe2c9b9402 [2021-06-11 16:21:52,715 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 16:21:52,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i [2021-06-11 16:21:52,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b0e7066/f4825c9c547549bfa99a90292f93575f/FLAGe2c9b9402 [2021-06-11 16:21:53,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b0e7066/f4825c9c547549bfa99a90292f93575f [2021-06-11 16:21:53,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 16:21:53,175 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 16:21:53,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 16:21:53,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 16:21:53,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 16:21:53,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:21:53" (1/1) ... [2021-06-11 16:21:53,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116744e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53, skipping insertion in model container [2021-06-11 16:21:53,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:21:53" (1/1) ... [2021-06-11 16:21:53,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 16:21:53,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 16:21:53,363 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/safe024_pso.oepc.i[993,1006] [2021-06-11 16:21:53,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:21:53,598 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 16:21:53,611 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/safe024_pso.oepc.i[993,1006] [2021-06-11 16:21:53,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:21:53,737 INFO L208 MainTranslator]: Completed translation [2021-06-11 16:21:53,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53 WrapperNode [2021-06-11 16:21:53,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 16:21:53,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 16:21:53,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 16:21:53,740 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 16:21:53,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53" (1/1) ... [2021-06-11 16:21:53,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53" (1/1) ... [2021-06-11 16:21:53,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 16:21:53,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 16:21:53,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 16:21:53,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 16:21:53,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53" (1/1) ... [2021-06-11 16:21:53,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53" (1/1) ... [2021-06-11 16:21:53,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53" (1/1) ... [2021-06-11 16:21:53,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53" (1/1) ... [2021-06-11 16:21:53,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53" (1/1) ... [2021-06-11 16:21:53,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53" (1/1) ... [2021-06-11 16:21:53,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53" (1/1) ... [2021-06-11 16:21:53,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 16:21:53,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 16:21:53,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 16:21:53,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 16:21:53,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53" (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-06-11 16:21:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 16:21:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 16:21:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 16:21:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 16:21:53,931 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 16:21:53,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 16:21:53,931 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 16:21:53,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 16:21:53,931 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 16:21:53,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 16:21:53,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 16:21:53,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 16:21:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 16:21:53,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 16:21:53,933 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 16:21:55,370 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 16:21:55,370 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 16:21:55,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:21:55 BoogieIcfgContainer [2021-06-11 16:21:55,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 16:21:55,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 16:21:55,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 16:21:55,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 16:21:55,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 04:21:53" (1/3) ... [2021-06-11 16:21:55,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123420cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:21:55, skipping insertion in model container [2021-06-11 16:21:55,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:21:53" (2/3) ... [2021-06-11 16:21:55,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123420cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:21:55, skipping insertion in model container [2021-06-11 16:21:55,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:21:55" (3/3) ... [2021-06-11 16:21:55,378 INFO L111 eAbstractionObserver]: Analyzing ICFG safe024_pso.oepc.i [2021-06-11 16:21:55,384 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 16:21:55,387 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 16:21:55,387 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 16:21:55,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,424 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,424 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,424 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,439 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,439 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,440 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,440 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,440 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,444 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,445 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,453 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,453 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,453 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,453 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,458 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,459 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,470 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,471 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:21:55,472 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 16:21:55,487 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 16:21:55,514 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 16:21:55,515 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 16:21:55,515 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 16:21:55,515 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 16:21:55,515 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 16:21:55,515 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 16:21:55,515 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 16:21:55,515 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 16:21:55,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-06-11 16:21:55,562 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-06-11 16:21:55,562 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:21:55,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-06-11 16:21:55,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-06-11 16:21:55,570 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-06-11 16:21:55,571 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:21:55,583 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-06-11 16:21:55,586 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-06-11 16:21:55,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-06-11 16:21:55,602 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-06-11 16:21:55,603 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:21:55,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-06-11 16:21:55,606 INFO L151 LiptonReduction]: Number of co-enabled transitions 1586 [2021-06-11 16:21:55,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:55,709 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:55,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:55,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:21:55,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:21:55,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:55,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:55,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:55,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:21:55,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:21:55,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:55,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:55,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:55,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:55,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:55,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:55,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:55,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:55,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:55,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:56,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:21:56,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:21:56,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:56,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,816 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 16:21:56,816 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:21:56,838 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:56,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:57,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:57,047 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:57,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:57,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:21:57,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 16:21:57,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:57,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:57,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:57,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:57,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:57,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:57,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:57,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:57,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:57,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:57,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:57,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:57,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:57,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:57,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:57,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:57,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:57,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:57,629 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 16:21:58,024 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 16:21:58,136 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 16:21:58,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,159 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:58,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:21:58,163 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:58,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,164 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 16:21:58,165 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:21:58,167 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,170 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 16:21:58,170 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:58,172 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 16:21:58,173 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 16:21:58,173 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:21:58,175 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,177 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 16:21:58,178 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 16:21:58,178 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:21:58,179 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,183 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 16:21:58,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:58,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:21:58,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:21:58,283 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 16:21:58,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:58,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:58,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:58,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:58,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:58,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,675 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:58,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,679 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:58,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:21:58,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 16:21:58,683 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:58,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:58,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 16:21:58,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 16:21:58,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:58,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 16:21:58,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-06-11 16:21:58,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:58,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:58,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:59,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,019 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 16:21:59,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:59,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:59,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:59,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,205 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:59,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:21:59,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:21:59,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:59,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:59,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:59,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:59,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:21:59,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,811 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:21:59,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:21:59,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:21:59,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:21:59,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:22:00,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:00,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:22:00,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:00,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:22:00,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:22:00,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:00,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:22:00,759 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-06-11 16:22:00,892 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-11 16:22:01,172 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-06-11 16:22:01,324 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-06-11 16:22:01,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:01,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:22:01,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:01,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:22:01,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:22:01,403 INFO L163 LiptonReduction]: Checked pairs total: 4258 [2021-06-11 16:22:01,403 INFO L165 LiptonReduction]: Total number of compositions: 93 [2021-06-11 16:22:01,416 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5846 [2021-06-11 16:22:01,428 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2021-06-11 16:22:01,428 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:22:01,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:22:01,429 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-11 16:22:01,429 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:22:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:22:01,433 INFO L82 PathProgramCache]: Analyzing trace with hash 939940462, now seen corresponding path program 1 times [2021-06-11 16:22:01,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:22:01,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566011996] [2021-06-11 16:22:01,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:22:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:22:01,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:01,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:22:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:22:01,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566011996] [2021-06-11 16:22:01,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:22:01,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:22:01,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139741859] [2021-06-11 16:22:01,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:22:01,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:22:01,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:22:01,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:22:01,680 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 191 [2021-06-11 16:22:01,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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-06-11 16:22:01,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:22:01,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 191 [2021-06-11 16:22:01,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:22:01,748 INFO L129 PetriNetUnfolder]: 29/96 cut-off events. [2021-06-11 16:22:01,749 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:22:01,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 96 events. 29/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 379 event pairs, 15 based on Foata normal form. 23/102 useless extension candidates. Maximal degree in co-relation 150. Up to 41 conditions per place. [2021-06-11 16:22:01,752 INFO L132 encePairwiseOnDemand]: 186/191 looper letters, 7 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-06-11 16:22:01,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 79 flow [2021-06-11 16:22:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:22:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:22:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2021-06-11 16:22:01,763 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8516579406631762 [2021-06-11 16:22:01,763 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2021-06-11 16:22:01,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2021-06-11 16:22:01,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:22:01,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2021-06-11 16:22:01,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 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-06-11 16:22:01,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:22:01,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:22:01,778 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 488 transitions. [2021-06-11 16:22:01,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 79 flow [2021-06-11 16:22:01,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 76 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 16:22:01,781 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2021-06-11 16:22:01,782 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-06-11 16:22:01,782 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-06-11 16:22:01,782 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:22:01,782 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 56 flow [2021-06-11 16:22:01,783 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 56 flow [2021-06-11 16:22:01,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 56 flow [2021-06-11 16:22:01,786 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-11 16:22:01,787 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:22:01,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 16:22:01,787 INFO L151 LiptonReduction]: Number of co-enabled transitions 244 [2021-06-11 16:22:01,843 INFO L163 LiptonReduction]: Checked pairs total: 270 [2021-06-11 16:22:01,844 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:22:01,844 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 62 [2021-06-11 16:22:01,846 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-06-11 16:22:01,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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-06-11 16:22:01,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:22:01,846 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:22:01,847 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 16:22:01,847 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:22:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:22:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1044190925, now seen corresponding path program 1 times [2021-06-11 16:22:01,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:22:01,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876280191] [2021-06-11 16:22:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:22:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:22:01,981 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-06-11 16:22:01,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:22:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:22:01,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876280191] [2021-06-11 16:22:01,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:22:01,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:22:01,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400492070] [2021-06-11 16:22:01,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:22:01,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:22:01,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:22:01,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:22:01,993 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 191 [2021-06-11 16:22:01,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:22:01,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:22:01,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 191 [2021-06-11 16:22:01,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:22:02,030 INFO L129 PetriNetUnfolder]: 14/64 cut-off events. [2021-06-11 16:22:02,030 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:22:02,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 64 events. 14/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 225 event pairs, 4 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 102. Up to 30 conditions per place. [2021-06-11 16:22:02,031 INFO L132 encePairwiseOnDemand]: 185/191 looper letters, 4 selfloop transitions, 3 changer transitions 4/27 dead transitions. [2021-06-11 16:22:02,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 84 flow [2021-06-11 16:22:02,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:22:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:22:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2021-06-11 16:22:02,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8254799301919721 [2021-06-11 16:22:02,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2021-06-11 16:22:02,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2021-06-11 16:22:02,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:22:02,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2021-06-11 16:22:02,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 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-06-11 16:22:02,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:22:02,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:22:02,041 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 473 transitions. [2021-06-11 16:22:02,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 84 flow [2021-06-11 16:22:02,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:22:02,042 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 69 flow [2021-06-11 16:22:02,042 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-06-11 16:22:02,042 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2021-06-11 16:22:02,042 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:22:02,043 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 69 flow [2021-06-11 16:22:02,043 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 69 flow [2021-06-11 16:22:02,043 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 23 transitions, 69 flow [2021-06-11 16:22:02,050 INFO L129 PetriNetUnfolder]: 7/42 cut-off events. [2021-06-11 16:22:02,050 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:22:02,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 42 events. 7/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 109 event pairs, 5 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 63. Up to 18 conditions per place. [2021-06-11 16:22:02,051 INFO L151 LiptonReduction]: Number of co-enabled transitions 226 [2021-06-11 16:22:02,057 INFO L163 LiptonReduction]: Checked pairs total: 183 [2021-06-11 16:22:02,058 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:22:02,058 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-06-11 16:22:02,058 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 69 flow [2021-06-11 16:22:02,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:22:02,059 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:22:02,059 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:22:02,059 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 16:22:02,059 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:22:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:22:02,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1989818592, now seen corresponding path program 1 times [2021-06-11 16:22:02,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:22:02,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262265510] [2021-06-11 16:22:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:22:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:22:02,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:22:02,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:22:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:22:02,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262265510] [2021-06-11 16:22:02,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:22:02,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:22:02,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630421896] [2021-06-11 16:22:02,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:22:02,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:22:02,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:22:02,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:22:02,126 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 191 [2021-06-11 16:22:02,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 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-06-11 16:22:02,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:22:02,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 191 [2021-06-11 16:22:02,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:22:02,153 INFO L129 PetriNetUnfolder]: 8/54 cut-off events. [2021-06-11 16:22:02,153 INFO L130 PetriNetUnfolder]: For 15/20 co-relation queries the response was YES. [2021-06-11 16:22:02,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 54 events. 8/54 cut-off events. For 15/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 168 event pairs, 2 based on Foata normal form. 6/59 useless extension candidates. Maximal degree in co-relation 91. Up to 22 conditions per place. [2021-06-11 16:22:02,154 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 1 selfloop transitions, 4 changer transitions 2/25 dead transitions. [2021-06-11 16:22:02,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 92 flow [2021-06-11 16:22:02,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:22:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:22:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2021-06-11 16:22:02,156 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8049738219895288 [2021-06-11 16:22:02,156 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 615 transitions. [2021-06-11 16:22:02,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions. [2021-06-11 16:22:02,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:22:02,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions. [2021-06-11 16:22:02,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 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-06-11 16:22:02,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 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-06-11 16:22:02,161 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 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-06-11 16:22:02,161 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 69 flow. Second operand 4 states and 615 transitions. [2021-06-11 16:22:02,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 92 flow [2021-06-11 16:22:02,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 88 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:22:02,162 INFO L241 Difference]: Finished difference. Result has 35 places, 23 transitions, 83 flow [2021-06-11 16:22:02,162 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2021-06-11 16:22:02,162 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2021-06-11 16:22:02,162 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:22:02,163 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 83 flow [2021-06-11 16:22:02,163 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 83 flow [2021-06-11 16:22:02,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 83 flow [2021-06-11 16:22:02,170 INFO L129 PetriNetUnfolder]: 6/38 cut-off events. [2021-06-11 16:22:02,170 INFO L130 PetriNetUnfolder]: For 13/14 co-relation queries the response was YES. [2021-06-11 16:22:02,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 38 events. 6/38 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 2 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 69. Up to 16 conditions per place. [2021-06-11 16:22:02,171 INFO L151 LiptonReduction]: Number of co-enabled transitions 198 [2021-06-11 16:22:02,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:22:02,334 INFO L163 LiptonReduction]: Checked pairs total: 249 [2021-06-11 16:22:02,335 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 16:22:02,335 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 173 [2021-06-11 16:22:02,335 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 81 flow [2021-06-11 16:22:02,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 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-06-11 16:22:02,336 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:22:02,336 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:22:02,336 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 16:22:02,336 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:22:02,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:22:02,337 INFO L82 PathProgramCache]: Analyzing trace with hash 955781741, now seen corresponding path program 1 times [2021-06-11 16:22:02,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:22:02,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91509696] [2021-06-11 16:22:02,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:22:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:22:02,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:22:02,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:22:02,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:22:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:22:02,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91509696] [2021-06-11 16:22:02,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:22:02,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:22:02,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778476121] [2021-06-11 16:22:02,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:22:02,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:22:02,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:22:02,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:22:02,416 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 192 [2021-06-11 16:22:02,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 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-06-11 16:22:02,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:22:02,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 192 [2021-06-11 16:22:02,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:22:02,462 INFO L129 PetriNetUnfolder]: 63/144 cut-off events. [2021-06-11 16:22:02,462 INFO L130 PetriNetUnfolder]: For 49/60 co-relation queries the response was YES. [2021-06-11 16:22:02,463 INFO L84 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 144 events. 63/144 cut-off events. For 49/60 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 654 event pairs, 20 based on Foata normal form. 10/126 useless extension candidates. Maximal degree in co-relation 309. Up to 60 conditions per place. [2021-06-11 16:22:02,464 INFO L132 encePairwiseOnDemand]: 185/192 looper letters, 7 selfloop transitions, 9 changer transitions 2/33 dead transitions. [2021-06-11 16:22:02,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 139 flow [2021-06-11 16:22:02,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:22:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:22:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 785 transitions. [2021-06-11 16:22:02,466 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8177083333333334 [2021-06-11 16:22:02,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 785 transitions. [2021-06-11 16:22:02,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 785 transitions. [2021-06-11 16:22:02,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:22:02,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 785 transitions. [2021-06-11 16:22:02,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-06-11 16:22:02,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 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-06-11 16:22:02,471 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 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-06-11 16:22:02,472 INFO L185 Difference]: Start difference. First operand has 34 places, 22 transitions, 81 flow. Second operand 5 states and 785 transitions. [2021-06-11 16:22:02,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 139 flow [2021-06-11 16:22:02,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:22:02,474 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 139 flow [2021-06-11 16:22:02,474 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-06-11 16:22:02,474 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2021-06-11 16:22:02,474 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:22:02,474 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 139 flow [2021-06-11 16:22:02,475 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 139 flow [2021-06-11 16:22:02,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 139 flow [2021-06-11 16:22:02,488 INFO L129 PetriNetUnfolder]: 58/146 cut-off events. [2021-06-11 16:22:02,489 INFO L130 PetriNetUnfolder]: For 124/163 co-relation queries the response was YES. [2021-06-11 16:22:02,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 146 events. 58/146 cut-off events. For 124/163 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 687 event pairs, 29 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 401. Up to 84 conditions per place. [2021-06-11 16:22:02,491 INFO L151 LiptonReduction]: Number of co-enabled transitions 252 [2021-06-11 16:22:02,493 INFO L163 LiptonReduction]: Checked pairs total: 144 [2021-06-11 16:22:02,494 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:22:02,494 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-06-11 16:22:02,494 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 139 flow [2021-06-11 16:22:02,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 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-06-11 16:22:02,495 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:22:02,495 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:22:02,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 16:22:02,495 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:22:02,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:22:02,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1932686359, now seen corresponding path program 1 times [2021-06-11 16:22:02,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:22:02,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794569780] [2021-06-11 16:22:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:22:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:22:02,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:22:02,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:22:02,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:22:02,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:22:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:22:02,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794569780] [2021-06-11 16:22:02,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:22:02,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:22:02,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139085500] [2021-06-11 16:22:02,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:22:02,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:22:02,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:22:02,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:22:02,556 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 192 [2021-06-11 16:22:02,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 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-06-11 16:22:02,557 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:22:02,557 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 192 [2021-06-11 16:22:02,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:22:02,625 INFO L129 PetriNetUnfolder]: 41/111 cut-off events. [2021-06-11 16:22:02,627 INFO L130 PetriNetUnfolder]: For 171/324 co-relation queries the response was YES. [2021-06-11 16:22:02,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 111 events. 41/111 cut-off events. For 171/324 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 437 event pairs, 4 based on Foata normal form. 32/132 useless extension candidates. Maximal degree in co-relation 378. Up to 65 conditions per place. [2021-06-11 16:22:02,628 INFO L132 encePairwiseOnDemand]: 185/192 looper letters, 5 selfloop transitions, 16 changer transitions 4/40 dead transitions. [2021-06-11 16:22:02,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 252 flow [2021-06-11 16:22:02,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:22:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:22:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1098 transitions. [2021-06-11 16:22:02,631 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8169642857142857 [2021-06-11 16:22:02,631 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1098 transitions. [2021-06-11 16:22:02,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1098 transitions. [2021-06-11 16:22:02,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:22:02,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1098 transitions. [2021-06-11 16:22:02,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.85714285714286) internal successors, (1098), 7 states have internal predecessors, (1098), 0 states have call successors, (0), 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-06-11 16:22:02,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 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-06-11 16:22:02,638 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 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-06-11 16:22:02,638 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 139 flow. Second operand 7 states and 1098 transitions. [2021-06-11 16:22:02,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 252 flow [2021-06-11 16:22:02,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 248 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 16:22:02,642 INFO L241 Difference]: Finished difference. Result has 47 places, 36 transitions, 237 flow [2021-06-11 16:22:02,642 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=237, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2021-06-11 16:22:02,642 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2021-06-11 16:22:02,643 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:22:02,643 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 36 transitions, 237 flow [2021-06-11 16:22:02,643 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 36 transitions, 237 flow [2021-06-11 16:22:02,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 237 flow [2021-06-11 16:22:02,654 INFO L129 PetriNetUnfolder]: 32/108 cut-off events. [2021-06-11 16:22:02,655 INFO L130 PetriNetUnfolder]: For 327/417 co-relation queries the response was YES. [2021-06-11 16:22:02,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 108 events. 32/108 cut-off events. For 327/417 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 443 event pairs, 5 based on Foata normal form. 2/99 useless extension candidates. Maximal degree in co-relation 406. Up to 60 conditions per place. [2021-06-11 16:22:02,656 INFO L151 LiptonReduction]: Number of co-enabled transitions 282 [2021-06-11 16:22:02,663 INFO L163 LiptonReduction]: Checked pairs total: 273 [2021-06-11 16:22:02,663 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:22:02,664 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-06-11 16:22:02,665 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 237 flow [2021-06-11 16:22:02,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 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-06-11 16:22:02,666 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:22:02,666 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:22:02,666 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 16:22:02,666 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:22:02,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:22:02,666 INFO L82 PathProgramCache]: Analyzing trace with hash -396938590, now seen corresponding path program 1 times [2021-06-11 16:22:02,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:22:02,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434965126] [2021-06-11 16:22:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:22:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:22:02,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:22:02,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:22:02,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:22:02,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:22:02,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:02,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:22:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:22:02,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434965126] [2021-06-11 16:22:02,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:22:02,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 16:22:02,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754806227] [2021-06-11 16:22:02,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:22:02,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:22:02,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:22:02,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:22:02,780 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 192 [2021-06-11 16:22:02,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 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-06-11 16:22:02,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:22:02,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 192 [2021-06-11 16:22:02,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:22:02,866 INFO L129 PetriNetUnfolder]: 24/83 cut-off events. [2021-06-11 16:22:02,866 INFO L130 PetriNetUnfolder]: For 415/760 co-relation queries the response was YES. [2021-06-11 16:22:02,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 83 events. 24/83 cut-off events. For 415/760 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 307 event pairs, 0 based on Foata normal form. 44/117 useless extension candidates. Maximal degree in co-relation 373. Up to 49 conditions per place. [2021-06-11 16:22:02,867 INFO L132 encePairwiseOnDemand]: 185/192 looper letters, 2 selfloop transitions, 20 changer transitions 4/41 dead transitions. [2021-06-11 16:22:02,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 41 transitions, 329 flow [2021-06-11 16:22:02,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 16:22:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 16:22:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1405 transitions. [2021-06-11 16:22:02,871 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8130787037037037 [2021-06-11 16:22:02,871 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1405 transitions. [2021-06-11 16:22:02,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1405 transitions. [2021-06-11 16:22:02,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:22:02,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1405 transitions. [2021-06-11 16:22:02,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 156.11111111111111) internal successors, (1405), 9 states have internal predecessors, (1405), 0 states have call successors, (0), 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-06-11 16:22:02,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 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-06-11 16:22:02,877 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 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-06-11 16:22:02,878 INFO L185 Difference]: Start difference. First operand has 47 places, 36 transitions, 237 flow. Second operand 9 states and 1405 transitions. [2021-06-11 16:22:02,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 41 transitions, 329 flow [2021-06-11 16:22:02,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 283 flow, removed 13 selfloop flow, removed 4 redundant places. [2021-06-11 16:22:02,882 INFO L241 Difference]: Finished difference. Result has 54 places, 37 transitions, 256 flow [2021-06-11 16:22:02,882 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=256, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2021-06-11 16:22:02,883 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2021-06-11 16:22:02,883 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:22:02,883 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 37 transitions, 256 flow [2021-06-11 16:22:02,883 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 37 transitions, 256 flow [2021-06-11 16:22:02,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 37 transitions, 256 flow [2021-06-11 16:22:02,895 INFO L129 PetriNetUnfolder]: 23/85 cut-off events. [2021-06-11 16:22:02,895 INFO L130 PetriNetUnfolder]: For 281/313 co-relation queries the response was YES. [2021-06-11 16:22:02,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 85 events. 23/85 cut-off events. For 281/313 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 354 event pairs, 1 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 324. Up to 28 conditions per place. [2021-06-11 16:22:02,896 INFO L151 LiptonReduction]: Number of co-enabled transitions 256 [2021-06-11 16:22:02,901 INFO L163 LiptonReduction]: Checked pairs total: 247 [2021-06-11 16:22:02,901 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:22:02,901 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-06-11 16:22:02,902 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 256 flow [2021-06-11 16:22:02,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 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-06-11 16:22:02,902 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:22:02,903 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:22:02,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 16:22:02,903 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:22:02,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:22:02,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2019219010, now seen corresponding path program 1 times [2021-06-11 16:22:02,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:22:02,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531014366] [2021-06-11 16:22:02,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:22:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:22:03,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:03,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:22:03,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:03,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:22:03,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:03,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:22:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:22:03,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531014366] [2021-06-11 16:22:03,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:22:03,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:22:03,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040785602] [2021-06-11 16:22:03,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:22:03,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:22:03,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:22:03,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:22:03,017 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 192 [2021-06-11 16:22:03,018 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 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-06-11 16:22:03,018 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:22:03,018 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 192 [2021-06-11 16:22:03,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:22:03,051 INFO L129 PetriNetUnfolder]: 33/115 cut-off events. [2021-06-11 16:22:03,051 INFO L130 PetriNetUnfolder]: For 419/475 co-relation queries the response was YES. [2021-06-11 16:22:03,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 115 events. 33/115 cut-off events. For 419/475 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 523 event pairs, 0 based on Foata normal form. 2/104 useless extension candidates. Maximal degree in co-relation 457. Up to 40 conditions per place. [2021-06-11 16:22:03,052 INFO L132 encePairwiseOnDemand]: 189/192 looper letters, 3 selfloop transitions, 1 changer transitions 13/38 dead transitions. [2021-06-11 16:22:03,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 38 transitions, 270 flow [2021-06-11 16:22:03,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:22:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:22:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 618 transitions. [2021-06-11 16:22:03,054 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8046875 [2021-06-11 16:22:03,054 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 618 transitions. [2021-06-11 16:22:03,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 618 transitions. [2021-06-11 16:22:03,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:22:03,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 618 transitions. [2021-06-11 16:22:03,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 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-06-11 16:22:03,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:22:03,058 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:22:03,058 INFO L185 Difference]: Start difference. First operand has 53 places, 37 transitions, 256 flow. Second operand 4 states and 618 transitions. [2021-06-11 16:22:03,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 38 transitions, 270 flow [2021-06-11 16:22:03,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 206 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-06-11 16:22:03,062 INFO L241 Difference]: Finished difference. Result has 50 places, 25 transitions, 119 flow [2021-06-11 16:22:03,062 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=50, PETRI_TRANSITIONS=25} [2021-06-11 16:22:03,062 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2021-06-11 16:22:03,062 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:22:03,062 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 25 transitions, 119 flow [2021-06-11 16:22:03,062 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 25 transitions, 119 flow [2021-06-11 16:22:03,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 25 transitions, 119 flow [2021-06-11 16:22:03,069 INFO L129 PetriNetUnfolder]: 6/33 cut-off events. [2021-06-11 16:22:03,070 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-11 16:22:03,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 33 events. 6/33 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 82. Up to 10 conditions per place. [2021-06-11 16:22:03,070 INFO L151 LiptonReduction]: Number of co-enabled transitions 74 [2021-06-11 16:22:03,790 WARN L205 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-06-11 16:22:04,051 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-06-11 16:22:05,406 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-06-11 16:22:06,007 WARN L205 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-06-11 16:22:06,028 INFO L142 QuantifierPusher]: treesize reduction 84, result has 90.8 percent of original size [2021-06-11 16:22:06,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:22:06,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:22:06,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:22:06,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,038 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 16:22:06,043 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:22:06,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 16:22:06,048 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:22:06,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,052 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 16:22:06,053 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:22:06,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 16:22:06,057 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:22:06,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 16:22:06,060 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:22:06,062 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 16:22:06,062 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 16:22:06,062 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:22:06,063 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,064 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 16:22:06,064 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:22:06,065 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,065 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 16:22:06,066 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:22:06,066 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,069 INFO L147 QuantifierPusher]: treesize reduction 155, result has 49.8 percent of original size 154 [2021-06-11 16:22:06,069 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:22:06,072 INFO L142 QuantifierPusher]: treesize reduction 155, result has 62.6 percent of original size [2021-06-11 16:22:06,072 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 4, 3, 2, 1] term [2021-06-11 16:22:06,073 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:22:06,073 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,074 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term [2021-06-11 16:22:06,074 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:22:06,075 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,075 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term [2021-06-11 16:22:06,076 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:22:06,076 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,080 INFO L147 QuantifierPusher]: treesize reduction 471, result has 20.8 percent of original size 124 [2021-06-11 16:22:06,080 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 16:22:06,080 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:22:06,081 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,082 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 16:22:06,082 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:22:06,083 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,083 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 16:22:06,083 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:22:06,084 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:22:06,093 INFO L147 QuantifierPusher]: treesize reduction 1742, result has 13.4 percent of original size 269 [2021-06-11 16:22:06,099 INFO L163 LiptonReduction]: Checked pairs total: 135 [2021-06-11 16:22:06,099 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 16:22:06,099 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3037 [2021-06-11 16:22:06,100 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 117 flow [2021-06-11 16:22:06,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 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-06-11 16:22:06,100 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:22:06,100 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:22:06,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 16:22:06,100 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:22:06,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:22:06,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1270532662, now seen corresponding path program 2 times [2021-06-11 16:22:06,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:22:06,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145654347] [2021-06-11 16:22:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:22:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:22:06,162 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:22:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:22:06,221 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:22:06,263 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 16:22:06,263 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 16:22:06,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 16:22:06,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 04:22:06 BasicIcfg [2021-06-11 16:22:06,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 16:22:06,331 INFO L168 Benchmark]: Toolchain (without parser) took 13156.48 ms. Allocated memory was 346.0 MB in the beginning and 526.4 MB in the end (delta: 180.4 MB). Free memory was 308.8 MB in the beginning and 293.3 MB in the end (delta: 15.5 MB). Peak memory consumption was 194.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:22:06,332 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 346.0 MB. Free memory was 327.0 MB in the beginning and 326.9 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 16:22:06,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.75 ms. Allocated memory is still 346.0 MB. Free memory was 308.6 MB in the beginning and 304.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.0 GB. [2021-06-11 16:22:06,332 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.38 ms. Allocated memory is still 346.0 MB. Free memory was 304.7 MB in the beginning and 301.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:22:06,332 INFO L168 Benchmark]: Boogie Preprocessor took 50.53 ms. Allocated memory is still 346.0 MB. Free memory was 301.6 MB in the beginning and 299.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:22:06,332 INFO L168 Benchmark]: RCFGBuilder took 1511.64 ms. Allocated memory is still 346.0 MB. Free memory was 299.5 MB in the beginning and 297.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 182.7 MB. Max. memory is 16.0 GB. [2021-06-11 16:22:06,333 INFO L168 Benchmark]: TraceAbstraction took 10957.72 ms. Allocated memory was 346.0 MB in the beginning and 526.4 MB in the end (delta: 180.4 MB). Free memory was 297.2 MB in the beginning and 293.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 184.2 MB. Max. memory is 16.0 GB. [2021-06-11 16:22:06,333 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.53 ms. Allocated memory is still 346.0 MB. Free memory was 327.0 MB in the beginning and 326.9 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 561.75 ms. Allocated memory is still 346.0 MB. Free memory was 308.6 MB in the beginning and 304.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 68.38 ms. Allocated memory is still 346.0 MB. Free memory was 304.7 MB in the beginning and 301.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 50.53 ms. Allocated memory is still 346.0 MB. Free memory was 301.6 MB in the beginning and 299.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1511.64 ms. Allocated memory is still 346.0 MB. Free memory was 299.5 MB in the beginning and 297.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 182.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 10957.72 ms. Allocated memory was 346.0 MB in the beginning and 526.4 MB in the end (delta: 180.4 MB). Free memory was 297.2 MB in the beginning and 293.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 184.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5817.5ms, 103 PlacesBefore, 35 PlacesAfterwards, 95 TransitionsBefore, 26 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 4258 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1854, positive: 1719, positive conditional: 1719, positive unconditional: 0, negative: 135, negative conditional: 135, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1854, positive: 1719, positive conditional: 0, positive unconditional: 1719, negative: 135, negative conditional: 0, negative unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1854, positive: 1719, positive conditional: 0, positive unconditional: 1719, negative: 135, negative conditional: 0, negative unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1254, positive: 1201, positive conditional: 0, positive unconditional: 1201, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1254, positive: 1196, positive conditional: 0, positive unconditional: 1196, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 803, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 796, negative conditional: 0, negative unconditional: 796, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1854, positive: 518, positive conditional: 0, positive unconditional: 518, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 1254, unknown conditional: 0, unknown unconditional: 1254] , Statistics on independence cache: Total cache size (in pairs): 1254, Positive cache size: 1201, Positive conditional cache size: 0, Positive unconditional cache size: 1201, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 61.0ms, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 270 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 0, positive unconditional: 18, 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: 20, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 1274, Positive cache size: 1219, Positive conditional cache size: 0, Positive unconditional cache size: 1219, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.7ms, 33 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 183 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 1294, Positive cache size: 1238, Positive conditional cache size: 0, Positive unconditional cache size: 1238, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 171.6ms, 35 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 249 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 8, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 43, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1302, Positive cache size: 1244, Positive conditional cache size: 0, Positive unconditional cache size: 1244, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, Eliminated conditions: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.9ms, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 144 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, positive: 85, positive conditional: 85, 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: 93, positive: 85, positive conditional: 30, positive unconditional: 55, 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: 93, positive: 85, positive conditional: 30, positive unconditional: 55, 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: 7, positive: 7, positive conditional: 2, positive unconditional: 5, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 93, positive: 78, positive conditional: 28, positive unconditional: 50, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1309, Positive cache size: 1251, Positive conditional cache size: 2, Positive unconditional cache size: 1249, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.6ms, 47 PlacesBefore, 47 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 273 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, positive: 75, positive conditional: 75, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, positive: 75, positive conditional: 50, positive unconditional: 25, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 75, positive conditional: 50, positive unconditional: 25, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 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: 88, positive: 72, positive conditional: 47, positive unconditional: 25, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1312, Positive cache size: 1254, Positive conditional cache size: 5, Positive unconditional cache size: 1249, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.3ms, 54 PlacesBefore, 53 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 247 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, positive: 95, positive conditional: 95, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, positive: 95, positive conditional: 65, positive unconditional: 30, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 95, positive conditional: 65, positive unconditional: 30, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 108, positive: 91, positive conditional: 61, positive unconditional: 30, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1316, Positive cache size: 1258, Positive conditional cache size: 9, Positive unconditional cache size: 1249, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3036.6ms, 50 PlacesBefore, 42 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 135 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, positive: 57, positive conditional: 34, positive unconditional: 23, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 57, positive conditional: 34, positive unconditional: 23, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 71, positive: 53, positive conditional: 32, positive unconditional: 21, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1320, Positive cache size: 1262, Positive conditional cache size: 11, Positive unconditional cache size: 1251, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, Eliminated conditions: 9 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2351; [L834] FCALL, FORK 0 pthread_create(&t2351, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2352; [L836] FCALL, FORK 0 pthread_create(&t2352, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t2353; [L838] FCALL, FORK 0 pthread_create(&t2353, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L756] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L757] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L758] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L760] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L761] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L844] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10754.4ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 494.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5910.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 31 SDtfs, 21 SDslu, 12 SDs, 0 SdLazy, 119 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 114.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 105.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=6, InterpolantAutomatonStates: 35, 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: 26.4ms SsaConstructionTime, 353.2ms SatisfiabilityAnalysisTime, 367.2ms InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 315 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...