/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/mix025_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:00:54,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:00:54,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:00:54,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:00:54,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:00:54,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:00:54,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:00:54,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:00:54,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:00:54,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:00:54,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:00:54,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:00:54,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:00:54,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:00:54,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:00:54,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:00:54,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:00:54,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:00:54,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:00:54,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:00:54,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:00:54,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:00:54,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:00:54,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:00:54,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:00:54,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:00:54,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:00:54,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:00:54,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:00:54,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:00:54,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:00:54,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:00:55,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:00:55,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:00:55,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:00:55,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:00:55,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:00:55,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:00:55,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:00:55,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:00:55,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:00:55,005 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:00:55,045 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:00:55,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:00:55,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:00:55,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:00:55,049 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:00:55,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:00:55,050 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:00:55,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:00:55,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:00:55,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:00:55,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:00:55,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:00:55,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:00:55,051 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:00:55,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:00:55,052 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:00:55,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:00:55,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:00:55,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:00:55,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:00:55,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:00:55,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:00:55,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:00:55,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:00:55,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:00:55,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:00:55,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:00:55,054 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:00:55,054 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:00:55,054 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:00:55,054 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:00:55,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:00:55,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:00:55,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:00:55,417 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:00:55,417 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:00:55,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i [2021-03-26 10:00:55,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af188079/bb60749f271d40fa90422d157d0118c4/FLAG8330bc1f8 [2021-03-26 10:00:56,007 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:00:56,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i [2021-03-26 10:00:56,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af188079/bb60749f271d40fa90422d157d0118c4/FLAG8330bc1f8 [2021-03-26 10:00:56,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af188079/bb60749f271d40fa90422d157d0118c4 [2021-03-26 10:00:56,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:00:56,328 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:00:56,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:00:56,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:00:56,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:00:56,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:00:56" (1/1) ... [2021-03-26 10:00:56,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9110135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56, skipping insertion in model container [2021-03-26 10:00:56,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:00:56" (1/1) ... [2021-03-26 10:00:56,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:00:56,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:00:56,504 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/mix025_pso.oepc.i[949,962] [2021-03-26 10:00:56,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:00:56,779 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:00:56,788 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/mix025_pso.oepc.i[949,962] [2021-03-26 10:00:56,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:00:56,922 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:00:56,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56 WrapperNode [2021-03-26 10:00:56,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:00:56,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:00:56,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:00:56,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:00:56,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56" (1/1) ... [2021-03-26 10:00:56,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56" (1/1) ... [2021-03-26 10:00:56,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:00:56,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:00:57,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:00:57,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:00:57,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56" (1/1) ... [2021-03-26 10:00:57,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56" (1/1) ... [2021-03-26 10:00:57,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56" (1/1) ... [2021-03-26 10:00:57,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56" (1/1) ... [2021-03-26 10:00:57,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56" (1/1) ... [2021-03-26 10:00:57,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56" (1/1) ... [2021-03-26 10:00:57,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56" (1/1) ... [2021-03-26 10:00:57,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:00:57,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:00:57,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:00:57,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:00:57,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:00:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:00:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:00:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:00:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:00:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:00:57,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:00:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:00:57,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:00:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:00:57,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:00:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:00:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:00:57,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:00:57,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:00:57,112 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:00:58,762 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:00:58,762 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:00:58,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:00:58 BoogieIcfgContainer [2021-03-26 10:00:58,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:00:58,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:00:58,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:00:58,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:00:58,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:00:56" (1/3) ... [2021-03-26 10:00:58,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35524af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:00:58, skipping insertion in model container [2021-03-26 10:00:58,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:00:56" (2/3) ... [2021-03-26 10:00:58,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35524af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:00:58, skipping insertion in model container [2021-03-26 10:00:58,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:00:58" (3/3) ... [2021-03-26 10:00:58,772 INFO L111 eAbstractionObserver]: Analyzing ICFG mix025_pso.oepc.i [2021-03-26 10:00:58,777 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:00:58,781 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:00:58,782 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:00:58,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,825 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,825 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,825 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,825 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,825 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,835 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,835 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,836 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,836 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,863 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,863 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,866 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,867 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,871 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,871 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,871 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:00:58,873 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:00:58,888 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:00:58,918 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:00:58,918 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:00:58,918 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:00:58,918 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:00:58,918 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:00:58,918 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:00:58,919 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:00:58,921 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:00:58,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 10:00:58,973 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 10:00:58,974 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:00:58,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 10:00:58,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 10:00:58,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2021-03-26 10:00:58,994 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:00:59,006 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 10:00:59,009 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 10:00:59,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 203 flow [2021-03-26 10:00:59,043 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 10:00:59,043 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:00:59,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 10:00:59,048 INFO L142 LiptonReduction]: Number of co-enabled transitions 1778 [2021-03-26 10:01:00,399 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:01:00,843 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 10:01:00,994 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:01:02,065 INFO L154 LiptonReduction]: Checked pairs total: 3086 [2021-03-26 10:01:02,066 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 10:01:02,068 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3075 [2021-03-26 10:01:02,075 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 10:01:02,075 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:01:02,076 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:02,076 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:02,076 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:02,080 INFO L82 PathProgramCache]: Analyzing trace with hash 699704113, now seen corresponding path program 1 times [2021-03-26 10:01:02,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:02,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569083742] [2021-03-26 10:01:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:02,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:02,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:02,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:02,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:02,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569083742] [2021-03-26 10:01:02,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:02,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:01:02,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876458490] [2021-03-26 10:01:02,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:01:02,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:02,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:01:02,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:01:02,340 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 164 [2021-03-26 10:01:02,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:02,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:02,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 164 [2021-03-26 10:01:02,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:02,440 INFO L129 PetriNetUnfolder]: 49/143 cut-off events. [2021-03-26 10:01:02,440 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:01:02,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 143 events. 49/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 571 event pairs, 38 based on Foata normal form. 17/151 useless extension candidates. Maximal degree in co-relation 219. Up to 65 conditions per place. [2021-03-26 10:01:02,443 INFO L132 encePairwiseOnDemand]: 160/164 looper letters, 9 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2021-03-26 10:01:02,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 115 flow [2021-03-26 10:01:02,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:01:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:01:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2021-03-26 10:01:02,463 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9065040650406504 [2021-03-26 10:01:02,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2021-03-26 10:01:02,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2021-03-26 10:01:02,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:02,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2021-03-26 10:01:02,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:02,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:02,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:02,485 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 3 states and 446 transitions. [2021-03-26 10:01:02,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 115 flow [2021-03-26 10:01:02,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:01:02,489 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 86 flow [2021-03-26 10:01:02,491 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-26 10:01:02,492 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-26 10:01:02,492 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:02,492 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 86 flow [2021-03-26 10:01:02,493 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 86 flow [2021-03-26 10:01:02,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 86 flow [2021-03-26 10:01:02,502 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-03-26 10:01:02,502 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:01:02,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:01:02,503 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 10:01:03,032 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 10:01:03,218 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 10:01:04,200 INFO L154 LiptonReduction]: Checked pairs total: 1610 [2021-03-26 10:01:04,200 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 10:01:04,200 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1708 [2021-03-26 10:01:04,201 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-26 10:01:04,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:04,202 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:04,202 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:04,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:01:04,202 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:04,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:04,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1973046455, now seen corresponding path program 1 times [2021-03-26 10:01:04,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:04,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208656876] [2021-03-26 10:01:04,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:04,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:04,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:04,335 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:01:04,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:01:04,344 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:01:04,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:01:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:04,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208656876] [2021-03-26 10:01:04,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:04,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:01:04,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098164804] [2021-03-26 10:01:04,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:01:04,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:04,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:01:04,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:01:04,351 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 177 [2021-03-26 10:01:04,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:04,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:04,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 177 [2021-03-26 10:01:04,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:04,423 INFO L129 PetriNetUnfolder]: 82/233 cut-off events. [2021-03-26 10:01:04,423 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:01:04,424 INFO L84 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 233 events. 82/233 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1260 event pairs, 12 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 389. Up to 67 conditions per place. [2021-03-26 10:01:04,425 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 6 selfloop transitions, 6 changer transitions 12/41 dead transitions. [2021-03-26 10:01:04,425 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 140 flow [2021-03-26 10:01:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:01:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:01:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 730 transitions. [2021-03-26 10:01:04,428 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8248587570621468 [2021-03-26 10:01:04,428 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 730 transitions. [2021-03-26 10:01:04,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 730 transitions. [2021-03-26 10:01:04,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:04,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 730 transitions. [2021-03-26 10:01:04,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:04,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:04,433 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:04,433 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 5 states and 730 transitions. [2021-03-26 10:01:04,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 140 flow [2021-03-26 10:01:04,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:01:04,434 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 110 flow [2021-03-26 10:01:04,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-26 10:01:04,435 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2021-03-26 10:01:04,435 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:04,435 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 110 flow [2021-03-26 10:01:04,435 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 110 flow [2021-03-26 10:01:04,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 110 flow [2021-03-26 10:01:04,451 INFO L129 PetriNetUnfolder]: 38/155 cut-off events. [2021-03-26 10:01:04,452 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-03-26 10:01:04,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 155 events. 38/155 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 812 event pairs, 20 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 303. Up to 67 conditions per place. [2021-03-26 10:01:04,454 INFO L142 LiptonReduction]: Number of co-enabled transitions 280 [2021-03-26 10:01:05,000 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 10:01:05,158 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 10:01:05,459 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 10:01:05,600 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 10:01:05,613 INFO L154 LiptonReduction]: Checked pairs total: 642 [2021-03-26 10:01:05,613 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:01:05,613 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1178 [2021-03-26 10:01:05,615 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 106 flow [2021-03-26 10:01:05,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:05,616 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:05,616 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:05,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:01:05,617 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:05,617 INFO L82 PathProgramCache]: Analyzing trace with hash -458321849, now seen corresponding path program 1 times [2021-03-26 10:01:05,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:05,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898445132] [2021-03-26 10:01:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:05,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:05,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:05,703 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:01:05,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:01:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:05,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898445132] [2021-03-26 10:01:05,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:05,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:01:05,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104911734] [2021-03-26 10:01:05,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:01:05,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:05,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:01:05,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:01:05,715 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 179 [2021-03-26 10:01:05,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:05,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:05,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 179 [2021-03-26 10:01:05,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:05,759 INFO L129 PetriNetUnfolder]: 26/108 cut-off events. [2021-03-26 10:01:05,759 INFO L130 PetriNetUnfolder]: For 44/63 co-relation queries the response was YES. [2021-03-26 10:01:05,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 108 events. 26/108 cut-off events. For 44/63 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 5 based on Foata normal form. 4/112 useless extension candidates. Maximal degree in co-relation 282. Up to 49 conditions per place. [2021-03-26 10:01:05,762 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 9 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2021-03-26 10:01:05,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 154 flow [2021-03-26 10:01:05,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:01:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:01:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2021-03-26 10:01:05,764 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8324022346368715 [2021-03-26 10:01:05,764 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 596 transitions. [2021-03-26 10:01:05,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 596 transitions. [2021-03-26 10:01:05,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:05,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 596 transitions. [2021-03-26 10:01:05,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:05,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:05,767 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:05,767 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 106 flow. Second operand 4 states and 596 transitions. [2021-03-26 10:01:05,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 154 flow [2021-03-26 10:01:05,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 126 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-26 10:01:05,770 INFO L241 Difference]: Finished difference. Result has 37 places, 29 transitions, 122 flow [2021-03-26 10:01:05,771 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2021-03-26 10:01:05,771 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -13 predicate places. [2021-03-26 10:01:05,771 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:05,771 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 122 flow [2021-03-26 10:01:05,772 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 122 flow [2021-03-26 10:01:05,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 122 flow [2021-03-26 10:01:05,783 INFO L129 PetriNetUnfolder]: 26/112 cut-off events. [2021-03-26 10:01:05,783 INFO L130 PetriNetUnfolder]: For 39/41 co-relation queries the response was YES. [2021-03-26 10:01:05,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 112 events. 26/112 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 521 event pairs, 5 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 232. Up to 49 conditions per place. [2021-03-26 10:01:05,785 INFO L142 LiptonReduction]: Number of co-enabled transitions 298 [2021-03-26 10:01:05,801 INFO L154 LiptonReduction]: Checked pairs total: 319 [2021-03-26 10:01:05,801 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:01:05,801 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-26 10:01:05,804 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 122 flow [2021-03-26 10:01:05,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:05,804 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:05,804 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:05,805 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:01:05,805 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:05,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2119533396, now seen corresponding path program 1 times [2021-03-26 10:01:05,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:05,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889706994] [2021-03-26 10:01:05,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:05,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:05,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:05,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:05,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:01:05,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:05,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:05,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889706994] [2021-03-26 10:01:05,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:05,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:01:05,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567476802] [2021-03-26 10:01:05,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:01:05,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:05,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:01:05,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:01:05,920 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-26 10:01:05,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:05,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:05,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-26 10:01:05,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:05,991 INFO L129 PetriNetUnfolder]: 118/309 cut-off events. [2021-03-26 10:01:05,991 INFO L130 PetriNetUnfolder]: For 54/69 co-relation queries the response was YES. [2021-03-26 10:01:05,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 309 events. 118/309 cut-off events. For 54/69 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 1901 event pairs, 45 based on Foata normal form. 28/314 useless extension candidates. Maximal degree in co-relation 656. Up to 165 conditions per place. [2021-03-26 10:01:05,995 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 8 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2021-03-26 10:01:05,995 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 174 flow [2021-03-26 10:01:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:01:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:01:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 773 transitions. [2021-03-26 10:01:05,997 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8636871508379889 [2021-03-26 10:01:05,998 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 773 transitions. [2021-03-26 10:01:05,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 773 transitions. [2021-03-26 10:01:05,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:05,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 773 transitions. [2021-03-26 10:01:06,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,002 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,002 INFO L185 Difference]: Start difference. First operand has 37 places, 29 transitions, 122 flow. Second operand 5 states and 773 transitions. [2021-03-26 10:01:06,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 174 flow [2021-03-26 10:01:06,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:01:06,005 INFO L241 Difference]: Finished difference. Result has 43 places, 36 transitions, 179 flow [2021-03-26 10:01:06,006 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2021-03-26 10:01:06,006 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2021-03-26 10:01:06,006 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:06,006 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 36 transitions, 179 flow [2021-03-26 10:01:06,007 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 36 transitions, 179 flow [2021-03-26 10:01:06,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 36 transitions, 179 flow [2021-03-26 10:01:06,043 INFO L129 PetriNetUnfolder]: 120/314 cut-off events. [2021-03-26 10:01:06,043 INFO L130 PetriNetUnfolder]: For 201/248 co-relation queries the response was YES. [2021-03-26 10:01:06,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 314 events. 120/314 cut-off events. For 201/248 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 1963 event pairs, 41 based on Foata normal form. 5/302 useless extension candidates. Maximal degree in co-relation 853. Up to 174 conditions per place. [2021-03-26 10:01:06,047 INFO L142 LiptonReduction]: Number of co-enabled transitions 434 [2021-03-26 10:01:06,180 INFO L154 LiptonReduction]: Checked pairs total: 719 [2021-03-26 10:01:06,180 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:01:06,180 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 174 [2021-03-26 10:01:06,181 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 173 flow [2021-03-26 10:01:06,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,182 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:06,182 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:06,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:01:06,182 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:06,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:06,182 INFO L82 PathProgramCache]: Analyzing trace with hash 31464797, now seen corresponding path program 1 times [2021-03-26 10:01:06,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:06,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464565613] [2021-03-26 10:01:06,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:06,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:06,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:06,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:06,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:06,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:06,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:01:06,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:06,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:06,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464565613] [2021-03-26 10:01:06,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:06,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:01:06,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617130947] [2021-03-26 10:01:06,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:01:06,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:06,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:01:06,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:01:06,311 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-26 10:01:06,312 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:06,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-26 10:01:06,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:06,391 INFO L129 PetriNetUnfolder]: 59/194 cut-off events. [2021-03-26 10:01:06,391 INFO L130 PetriNetUnfolder]: For 180/260 co-relation queries the response was YES. [2021-03-26 10:01:06,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 194 events. 59/194 cut-off events. For 180/260 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1005 event pairs, 6 based on Foata normal form. 53/243 useless extension candidates. Maximal degree in co-relation 630. Up to 112 conditions per place. [2021-03-26 10:01:06,393 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 5 selfloop transitions, 11 changer transitions 3/42 dead transitions. [2021-03-26 10:01:06,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 251 flow [2021-03-26 10:01:06,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:01:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:01:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 927 transitions. [2021-03-26 10:01:06,395 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8631284916201117 [2021-03-26 10:01:06,395 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 927 transitions. [2021-03-26 10:01:06,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 927 transitions. [2021-03-26 10:01:06,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:06,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 927 transitions. [2021-03-26 10:01:06,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,401 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,401 INFO L185 Difference]: Start difference. First operand has 43 places, 35 transitions, 173 flow. Second operand 6 states and 927 transitions. [2021-03-26 10:01:06,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 251 flow [2021-03-26 10:01:06,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 245 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:01:06,406 INFO L241 Difference]: Finished difference. Result has 47 places, 39 transitions, 237 flow [2021-03-26 10:01:06,406 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2021-03-26 10:01:06,406 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-26 10:01:06,406 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:06,406 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 39 transitions, 237 flow [2021-03-26 10:01:06,407 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 39 transitions, 237 flow [2021-03-26 10:01:06,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 39 transitions, 237 flow [2021-03-26 10:01:06,426 INFO L129 PetriNetUnfolder]: 56/195 cut-off events. [2021-03-26 10:01:06,426 INFO L130 PetriNetUnfolder]: For 312/342 co-relation queries the response was YES. [2021-03-26 10:01:06,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 195 events. 56/195 cut-off events. For 312/342 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1052 event pairs, 5 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 680. Up to 112 conditions per place. [2021-03-26 10:01:06,428 INFO L142 LiptonReduction]: Number of co-enabled transitions 420 [2021-03-26 10:01:06,440 INFO L154 LiptonReduction]: Checked pairs total: 737 [2021-03-26 10:01:06,440 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:01:06,440 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-26 10:01:06,443 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 229 flow [2021-03-26 10:01:06,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,443 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:06,443 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:06,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:01:06,444 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:06,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:06,444 INFO L82 PathProgramCache]: Analyzing trace with hash 224393125, now seen corresponding path program 1 times [2021-03-26 10:01:06,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:06,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875925162] [2021-03-26 10:01:06,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:06,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:06,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:06,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:06,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:06,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:06,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:06,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:06,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:01:06,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:06,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:06,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875925162] [2021-03-26 10:01:06,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:06,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:01:06,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571654631] [2021-03-26 10:01:06,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:01:06,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:06,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:01:06,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:01:06,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-26 10:01:06,606 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:06,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-26 10:01:06,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:06,663 INFO L129 PetriNetUnfolder]: 33/122 cut-off events. [2021-03-26 10:01:06,663 INFO L130 PetriNetUnfolder]: For 251/306 co-relation queries the response was YES. [2021-03-26 10:01:06,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 122 events. 33/122 cut-off events. For 251/306 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 488 event pairs, 0 based on Foata normal form. 37/157 useless extension candidates. Maximal degree in co-relation 443. Up to 62 conditions per place. [2021-03-26 10:01:06,664 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 2 selfloop transitions, 11 changer transitions 3/39 dead transitions. [2021-03-26 10:01:06,664 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 39 transitions, 261 flow [2021-03-26 10:01:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:01:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:01:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1075 transitions. [2021-03-26 10:01:06,667 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8579409417398244 [2021-03-26 10:01:06,667 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1075 transitions. [2021-03-26 10:01:06,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1075 transitions. [2021-03-26 10:01:06,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:06,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1075 transitions. [2021-03-26 10:01:06,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 153.57142857142858) internal successors, (1075), 7 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,672 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:06,672 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 229 flow. Second operand 7 states and 1075 transitions. [2021-03-26 10:01:06,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 39 transitions, 261 flow [2021-03-26 10:01:06,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 236 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-26 10:01:06,675 INFO L241 Difference]: Finished difference. Result has 50 places, 36 transitions, 216 flow [2021-03-26 10:01:06,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2021-03-26 10:01:06,676 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2021-03-26 10:01:06,676 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:06,676 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 36 transitions, 216 flow [2021-03-26 10:01:06,676 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 36 transitions, 216 flow [2021-03-26 10:01:06,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 216 flow [2021-03-26 10:01:06,688 INFO L129 PetriNetUnfolder]: 30/121 cut-off events. [2021-03-26 10:01:06,688 INFO L130 PetriNetUnfolder]: For 166/168 co-relation queries the response was YES. [2021-03-26 10:01:06,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 121 events. 30/121 cut-off events. For 166/168 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 530 event pairs, 1 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 395. Up to 39 conditions per place. [2021-03-26 10:01:06,690 INFO L142 LiptonReduction]: Number of co-enabled transitions 288 [2021-03-26 10:01:07,001 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:01:07,148 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:01:07,489 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 10:01:07,646 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-26 10:01:07,651 INFO L154 LiptonReduction]: Checked pairs total: 835 [2021-03-26 10:01:07,651 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:01:07,651 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 975 [2021-03-26 10:01:07,653 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 202 flow [2021-03-26 10:01:07,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:07,654 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:07,654 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:07,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:01:07,654 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:07,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:07,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1215174388, now seen corresponding path program 1 times [2021-03-26 10:01:07,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:07,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385047164] [2021-03-26 10:01:07,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:07,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:07,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:07,722 INFO L142 QuantifierPusher]: treesize reduction 7, result has 74.1 percent of original size [2021-03-26 10:01:07,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 10:01:07,732 INFO L142 QuantifierPusher]: treesize reduction 7, result has 76.7 percent of original size [2021-03-26 10:01:07,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:01:07,744 INFO L142 QuantifierPusher]: treesize reduction 7, result has 76.7 percent of original size [2021-03-26 10:01:07,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:01:07,759 INFO L142 QuantifierPusher]: treesize reduction 8, result has 80.0 percent of original size [2021-03-26 10:01:07,760 INFO L147 QuantifierPusher]: treesize reduction 9, result has 71.9 percent of original size 23 [2021-03-26 10:01:07,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:07,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:01:07,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:07,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:01:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:07,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385047164] [2021-03-26 10:01:07,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:07,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:01:07,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166357114] [2021-03-26 10:01:07,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:01:07,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:07,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:01:07,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:01:07,783 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 181 [2021-03-26 10:01:07,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 202 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:07,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:07,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 181 [2021-03-26 10:01:07,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:08,036 INFO L129 PetriNetUnfolder]: 316/662 cut-off events. [2021-03-26 10:01:08,036 INFO L130 PetriNetUnfolder]: For 812/909 co-relation queries the response was YES. [2021-03-26 10:01:08,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 662 events. 316/662 cut-off events. For 812/909 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3676 event pairs, 6 based on Foata normal form. 63/719 useless extension candidates. Maximal degree in co-relation 2073. Up to 184 conditions per place. [2021-03-26 10:01:08,041 INFO L132 encePairwiseOnDemand]: 169/181 looper letters, 21 selfloop transitions, 38 changer transitions 25/98 dead transitions. [2021-03-26 10:01:08,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 98 transitions, 648 flow [2021-03-26 10:01:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:01:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:01:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1169 transitions. [2021-03-26 10:01:08,044 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7176181706568447 [2021-03-26 10:01:08,044 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1169 transitions. [2021-03-26 10:01:08,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1169 transitions. [2021-03-26 10:01:08,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:08,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1169 transitions. [2021-03-26 10:01:08,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.88888888888889) internal successors, (1169), 9 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:08,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:08,049 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:08,050 INFO L185 Difference]: Start difference. First operand has 46 places, 33 transitions, 202 flow. Second operand 9 states and 1169 transitions. [2021-03-26 10:01:08,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 98 transitions, 648 flow [2021-03-26 10:01:08,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 98 transitions, 606 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-26 10:01:08,058 INFO L241 Difference]: Finished difference. Result has 51 places, 65 transitions, 413 flow [2021-03-26 10:01:08,058 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=413, PETRI_PLACES=51, PETRI_TRANSITIONS=65} [2021-03-26 10:01:08,058 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2021-03-26 10:01:08,059 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:08,059 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 65 transitions, 413 flow [2021-03-26 10:01:08,059 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 65 transitions, 413 flow [2021-03-26 10:01:08,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 65 transitions, 413 flow [2021-03-26 10:01:08,138 INFO L129 PetriNetUnfolder]: 199/440 cut-off events. [2021-03-26 10:01:08,138 INFO L130 PetriNetUnfolder]: For 483/522 co-relation queries the response was YES. [2021-03-26 10:01:08,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 440 events. 199/440 cut-off events. For 483/522 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2412 event pairs, 9 based on Foata normal form. 29/463 useless extension candidates. Maximal degree in co-relation 1363. Up to 131 conditions per place. [2021-03-26 10:01:08,142 INFO L142 LiptonReduction]: Number of co-enabled transitions 364 [2021-03-26 10:01:08,148 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:01:08,148 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:01:08,148 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 89 [2021-03-26 10:01:08,149 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 65 transitions, 413 flow [2021-03-26 10:01:08,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:08,150 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:08,150 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:08,150 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:01:08,150 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:08,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:08,150 INFO L82 PathProgramCache]: Analyzing trace with hash -487906594, now seen corresponding path program 1 times [2021-03-26 10:01:08,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:08,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012304458] [2021-03-26 10:01:08,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:08,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:08,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:08,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:08,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:08,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:08,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:08,259 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:01:08,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:01:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:08,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012304458] [2021-03-26 10:01:08,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:08,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:01:08,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083118499] [2021-03-26 10:01:08,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:01:08,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:08,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:01:08,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:01:08,272 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 181 [2021-03-26 10:01:08,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 65 transitions, 413 flow. Second operand has 5 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:08,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:08,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 181 [2021-03-26 10:01:08,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:08,389 INFO L129 PetriNetUnfolder]: 241/542 cut-off events. [2021-03-26 10:01:08,389 INFO L130 PetriNetUnfolder]: For 926/1022 co-relation queries the response was YES. [2021-03-26 10:01:08,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 542 events. 241/542 cut-off events. For 926/1022 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3062 event pairs, 0 based on Foata normal form. 57/594 useless extension candidates. Maximal degree in co-relation 1859. Up to 163 conditions per place. [2021-03-26 10:01:08,393 INFO L132 encePairwiseOnDemand]: 173/181 looper letters, 8 selfloop transitions, 16 changer transitions 38/88 dead transitions. [2021-03-26 10:01:08,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 88 transitions, 696 flow [2021-03-26 10:01:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:01:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:01:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 883 transitions. [2021-03-26 10:01:08,397 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8130755064456722 [2021-03-26 10:01:08,397 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 883 transitions. [2021-03-26 10:01:08,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 883 transitions. [2021-03-26 10:01:08,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:08,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 883 transitions. [2021-03-26 10:01:08,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.16666666666666) internal successors, (883), 6 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:08,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:08,402 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:08,402 INFO L185 Difference]: Start difference. First operand has 49 places, 65 transitions, 413 flow. Second operand 6 states and 883 transitions. [2021-03-26 10:01:08,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 88 transitions, 696 flow [2021-03-26 10:01:08,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 88 transitions, 694 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:01:08,409 INFO L241 Difference]: Finished difference. Result has 55 places, 48 transitions, 338 flow [2021-03-26 10:01:08,409 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2021-03-26 10:01:08,410 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2021-03-26 10:01:08,410 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:08,410 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 338 flow [2021-03-26 10:01:08,410 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 48 transitions, 338 flow [2021-03-26 10:01:08,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 338 flow [2021-03-26 10:01:08,444 INFO L129 PetriNetUnfolder]: 85/278 cut-off events. [2021-03-26 10:01:08,444 INFO L130 PetriNetUnfolder]: For 440/449 co-relation queries the response was YES. [2021-03-26 10:01:08,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 278 events. 85/278 cut-off events. For 440/449 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1664 event pairs, 8 based on Foata normal form. 4/278 useless extension candidates. Maximal degree in co-relation 905. Up to 78 conditions per place. [2021-03-26 10:01:08,447 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-26 10:01:09,972 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-26 10:01:10,346 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-26 10:01:12,442 WARN L205 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 377 DAG size of output: 316 [2021-03-26 10:01:13,299 WARN L205 SmtUtils]: Spent 845.00 ms on a formula simplification that was a NOOP. DAG size: 307 [2021-03-26 10:01:14,227 WARN L205 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-26 10:01:14,584 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-26 10:01:16,698 WARN L205 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-26 10:01:17,547 WARN L205 SmtUtils]: Spent 846.00 ms on a formula simplification that was a NOOP. DAG size: 305 [2021-03-26 10:01:17,659 INFO L154 LiptonReduction]: Checked pairs total: 23 [2021-03-26 10:01:17,659 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:01:17,659 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9249 [2021-03-26 10:01:17,660 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 345 flow [2021-03-26 10:01:17,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:17,660 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:17,660 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:17,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:01:17,661 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:17,661 INFO L82 PathProgramCache]: Analyzing trace with hash 342059260, now seen corresponding path program 2 times [2021-03-26 10:01:17,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:17,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108300105] [2021-03-26 10:01:17,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:17,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:17,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:01:17,747 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.7 percent of original size [2021-03-26 10:01:17,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 10:01:17,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:17,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:01:17,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:17,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:01:17,798 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:01:17,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:01:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:17,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108300105] [2021-03-26 10:01:17,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:17,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:01:17,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610455710] [2021-03-26 10:01:17,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:01:17,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:17,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:01:17,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:01:17,812 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 185 [2021-03-26 10:01:17,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 345 flow. Second operand has 7 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:17,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:17,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 185 [2021-03-26 10:01:17,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:18,127 INFO L129 PetriNetUnfolder]: 93/278 cut-off events. [2021-03-26 10:01:18,127 INFO L130 PetriNetUnfolder]: For 568/623 co-relation queries the response was YES. [2021-03-26 10:01:18,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 278 events. 93/278 cut-off events. For 568/623 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1611 event pairs, 0 based on Foata normal form. 37/312 useless extension candidates. Maximal degree in co-relation 1071. Up to 83 conditions per place. [2021-03-26 10:01:18,129 INFO L132 encePairwiseOnDemand]: 173/185 looper letters, 12 selfloop transitions, 16 changer transitions 27/70 dead transitions. [2021-03-26 10:01:18,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 620 flow [2021-03-26 10:01:18,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:01:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:01:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 945 transitions. [2021-03-26 10:01:18,132 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6385135135135135 [2021-03-26 10:01:18,132 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 945 transitions. [2021-03-26 10:01:18,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 945 transitions. [2021-03-26 10:01:18,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:18,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 945 transitions. [2021-03-26 10:01:18,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:18,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 185.0) internal successors, (1665), 9 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:18,137 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 185.0) internal successors, (1665), 9 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:18,137 INFO L185 Difference]: Start difference. First operand has 54 places, 48 transitions, 345 flow. Second operand 8 states and 945 transitions. [2021-03-26 10:01:18,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 620 flow [2021-03-26 10:01:18,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 70 transitions, 545 flow, removed 6 selfloop flow, removed 6 redundant places. [2021-03-26 10:01:18,143 INFO L241 Difference]: Finished difference. Result has 56 places, 40 transitions, 283 flow [2021-03-26 10:01:18,144 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2021-03-26 10:01:18,144 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2021-03-26 10:01:18,144 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:18,144 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 40 transitions, 283 flow [2021-03-26 10:01:18,144 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 40 transitions, 283 flow [2021-03-26 10:01:18,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 40 transitions, 283 flow [2021-03-26 10:01:18,158 INFO L129 PetriNetUnfolder]: 34/132 cut-off events. [2021-03-26 10:01:18,158 INFO L130 PetriNetUnfolder]: For 214/223 co-relation queries the response was YES. [2021-03-26 10:01:18,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 132 events. 34/132 cut-off events. For 214/223 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 619 event pairs, 3 based on Foata normal form. 5/136 useless extension candidates. Maximal degree in co-relation 420. Up to 43 conditions per place. [2021-03-26 10:01:18,159 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-26 10:01:19,325 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-26 10:01:19,728 WARN L205 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-26 10:01:22,260 WARN L205 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 377 DAG size of output: 320 [2021-03-26 10:01:23,321 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 309 [2021-03-26 10:01:23,572 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:01:24,031 WARN L205 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-26 10:01:24,170 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:01:24,325 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:01:24,556 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2021-03-26 10:01:24,607 INFO L154 LiptonReduction]: Checked pairs total: 28 [2021-03-26 10:01:24,607 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 10:01:24,607 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6463 [2021-03-26 10:01:24,608 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 274 flow [2021-03-26 10:01:24,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:24,608 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:24,608 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:24,608 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:01:24,608 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:24,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1943893390, now seen corresponding path program 1 times [2021-03-26 10:01:24,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:24,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080912191] [2021-03-26 10:01:24,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:01:24,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:24,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:01:24,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:01:24,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:01:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:01:24,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080912191] [2021-03-26 10:01:24,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:01:24,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:01:24,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988968828] [2021-03-26 10:01:24,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:01:24,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:01:24,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:01:24,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:01:24,659 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 190 [2021-03-26 10:01:24,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 274 flow. Second operand has 3 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-03-26 10:01:24,660 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:01:24,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 190 [2021-03-26 10:01:24,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:01:24,690 INFO L129 PetriNetUnfolder]: 32/109 cut-off events. [2021-03-26 10:01:24,690 INFO L130 PetriNetUnfolder]: For 241/259 co-relation queries the response was YES. [2021-03-26 10:01:24,691 INFO L84 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 109 events. 32/109 cut-off events. For 241/259 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 438 event pairs, 3 based on Foata normal form. 11/118 useless extension candidates. Maximal degree in co-relation 337. Up to 39 conditions per place. [2021-03-26 10:01:24,691 INFO L132 encePairwiseOnDemand]: 186/190 looper letters, 3 selfloop transitions, 3 changer transitions 7/35 dead transitions. [2021-03-26 10:01:24,691 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 35 transitions, 271 flow [2021-03-26 10:01:24,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:01:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:01:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2021-03-26 10:01:24,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8631578947368421 [2021-03-26 10:01:24,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2021-03-26 10:01:24,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2021-03-26 10:01:24,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:01:24,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2021-03-26 10:01:24,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:24,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:24,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:01:24,696 INFO L185 Difference]: Start difference. First operand has 53 places, 37 transitions, 274 flow. Second operand 3 states and 492 transitions. [2021-03-26 10:01:24,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 35 transitions, 271 flow [2021-03-26 10:01:24,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 35 transitions, 237 flow, removed 2 selfloop flow, removed 8 redundant places. [2021-03-26 10:01:24,698 INFO L241 Difference]: Finished difference. Result has 47 places, 28 transitions, 167 flow [2021-03-26 10:01:24,698 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2021-03-26 10:01:24,698 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-26 10:01:24,699 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:01:24,699 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 28 transitions, 167 flow [2021-03-26 10:01:24,699 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 28 transitions, 167 flow [2021-03-26 10:01:24,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 28 transitions, 167 flow [2021-03-26 10:01:24,705 INFO L129 PetriNetUnfolder]: 15/54 cut-off events. [2021-03-26 10:01:24,706 INFO L130 PetriNetUnfolder]: For 61/63 co-relation queries the response was YES. [2021-03-26 10:01:24,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 54 events. 15/54 cut-off events. For 61/63 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 2 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 152. Up to 18 conditions per place. [2021-03-26 10:01:24,706 INFO L142 LiptonReduction]: Number of co-enabled transitions 60 [2021-03-26 10:01:25,021 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:01:25,501 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2021-03-26 10:01:25,651 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 10:01:26,443 WARN L205 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 180 [2021-03-26 10:01:27,125 WARN L205 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 177 [2021-03-26 10:01:28,722 WARN L205 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 304 DAG size of output: 260 [2021-03-26 10:01:29,379 WARN L205 SmtUtils]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 257 [2021-03-26 10:01:29,838 WARN L205 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 214 [2021-03-26 10:01:30,301 WARN L205 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 214 [2021-03-26 10:01:31,517 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 320 [2021-03-26 10:01:32,745 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 320 [2021-03-26 10:01:32,749 INFO L154 LiptonReduction]: Checked pairs total: 15 [2021-03-26 10:01:32,750 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:01:32,750 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8051 [2021-03-26 10:01:32,750 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 181 flow [2021-03-26 10:01:32,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 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-03-26 10:01:32,750 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:01:32,750 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:01:32,751 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:01:32,751 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:01:32,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:01:32,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1641599405, now seen corresponding path program 1 times [2021-03-26 10:01:32,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:01:32,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21027742] [2021-03-26 10:01:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:01:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:01:32,784 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:01:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:01:32,818 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:01:32,844 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:01:32,844 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:01:32,844 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:01:32,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:01:32 BasicIcfg [2021-03-26 10:01:32,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:01:32,922 INFO L168 Benchmark]: Toolchain (without parser) took 36593.76 ms. Allocated memory was 255.9 MB in the beginning and 765.5 MB in the end (delta: 509.6 MB). Free memory was 232.8 MB in the beginning and 445.3 MB in the end (delta: -212.5 MB). Peak memory consumption was 295.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:01:32,922 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:01:32,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.67 ms. Allocated memory was 255.9 MB in the beginning and 375.4 MB in the end (delta: 119.5 MB). Free memory was 232.2 MB in the beginning and 335.4 MB in the end (delta: -103.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:01:32,922 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.04 ms. Allocated memory is still 375.4 MB. Free memory was 334.7 MB in the beginning and 332.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:01:32,922 INFO L168 Benchmark]: Boogie Preprocessor took 50.59 ms. Allocated memory is still 375.4 MB. Free memory was 332.6 MB in the beginning and 330.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:01:32,922 INFO L168 Benchmark]: RCFGBuilder took 1714.03 ms. Allocated memory is still 375.4 MB. Free memory was 330.5 MB in the beginning and 318.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 63.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:01:32,923 INFO L168 Benchmark]: TraceAbstraction took 34154.75 ms. Allocated memory was 375.4 MB in the beginning and 765.5 MB in the end (delta: 390.1 MB). Free memory was 317.5 MB in the beginning and 445.3 MB in the end (delta: -127.8 MB). Peak memory consumption was 261.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:01:32,923 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.15 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 591.67 ms. Allocated memory was 255.9 MB in the beginning and 375.4 MB in the end (delta: 119.5 MB). Free memory was 232.2 MB in the beginning and 335.4 MB in the end (delta: -103.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 74.04 ms. Allocated memory is still 375.4 MB. Free memory was 334.7 MB in the beginning and 332.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 50.59 ms. Allocated memory is still 375.4 MB. Free memory was 332.6 MB in the beginning and 330.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1714.03 ms. Allocated memory is still 375.4 MB. Free memory was 330.5 MB in the beginning and 318.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 63.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 34154.75 ms. Allocated memory was 375.4 MB in the beginning and 765.5 MB in the end (delta: 390.1 MB). Free memory was 317.5 MB in the beginning and 445.3 MB in the end (delta: -127.8 MB). Peak memory consumption was 261.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: 3056.9ms, 105 PlacesBefore, 50 PlacesAfterwards, 97 TransitionsBefore, 41 TransitionsAfterwards, 1778 CoEnabledTransitionPairs, 4 FixpointIterations, 27 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 3086 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1597, positive: 1518, positive conditional: 1518, positive unconditional: 0, negative: 79, negative conditional: 79, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1597, positive: 1518, positive conditional: 0, positive unconditional: 1518, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1597, positive: 1518, positive conditional: 0, positive unconditional: 1518, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1246, positive: 1206, positive conditional: 0, positive unconditional: 1206, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1246, positive: 1200, positive conditional: 0, positive unconditional: 1200, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 602, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 583, negative conditional: 0, negative unconditional: 583, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1597, positive: 312, positive conditional: 0, positive unconditional: 312, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 1246, unknown conditional: 0, unknown unconditional: 1246] , Statistics on independence cache: Total cache size (in pairs): 1246, Positive cache size: 1206, Positive conditional cache size: 0, Positive unconditional cache size: 1206, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1706.9ms, 47 PlacesBefore, 34 PlacesAfterwards, 38 TransitionsBefore, 25 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 1610 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 506, positive: 405, positive conditional: 405, positive unconditional: 0, negative: 101, negative conditional: 101, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 506, positive: 405, positive conditional: 15, positive unconditional: 390, negative: 101, negative conditional: 4, negative unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 506, positive: 405, positive conditional: 15, positive unconditional: 390, negative: 101, negative conditional: 4, negative unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, positive: 131, positive conditional: 6, positive unconditional: 125, negative: 28, negative conditional: 2, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 159, positive: 122, positive conditional: 0, positive unconditional: 122, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 28, negative conditional: 2, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 426, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 392, negative conditional: 35, negative unconditional: 358, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 506, positive: 274, positive conditional: 9, positive unconditional: 265, negative: 73, negative conditional: 2, negative unconditional: 71, unknown: 159, unknown conditional: 8, unknown unconditional: 151] , Statistics on independence cache: Total cache size (in pairs): 1405, Positive cache size: 1337, Positive conditional cache size: 6, Positive unconditional cache size: 1331, Negative cache size: 68, Negative conditional cache size: 2, Negative unconditional cache size: 66, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1177.7ms, 40 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 642 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202, positive: 163, positive conditional: 163, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 202, positive: 163, positive conditional: 6, positive unconditional: 157, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 202, positive: 163, positive conditional: 6, positive unconditional: 157, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 202, positive: 157, positive conditional: 6, positive unconditional: 151, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1411, Positive cache size: 1343, Positive conditional cache size: 6, Positive unconditional cache size: 1337, Negative cache size: 68, Negative conditional cache size: 2, Negative unconditional cache size: 66, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.1ms, 37 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 319 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1416, Positive cache size: 1347, Positive conditional cache size: 6, Positive unconditional cache size: 1341, Negative cache size: 69, Negative conditional cache size: 2, Negative unconditional cache size: 67, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 173.6ms, 43 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 719 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, positive: 140, positive conditional: 140, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 172, positive: 140, positive conditional: 31, positive unconditional: 109, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 172, positive: 140, positive conditional: 31, positive unconditional: 109, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 8, positive unconditional: 12, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 119, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 172, positive: 120, positive conditional: 23, positive unconditional: 97, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 25, unknown conditional: 8, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 1441, Positive cache size: 1367, Positive conditional cache size: 14, Positive unconditional cache size: 1353, Negative cache size: 74, Negative conditional cache size: 2, Negative unconditional cache size: 72, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.4ms, 47 PlacesBefore, 47 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 420 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 737 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, positive: 172, positive conditional: 172, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 206, positive: 172, positive conditional: 98, positive unconditional: 74, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 206, positive: 172, positive conditional: 98, positive unconditional: 74, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 10, positive unconditional: 8, 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: 18, positive: 18, positive conditional: 0, positive unconditional: 18, 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: 206, positive: 154, positive conditional: 88, positive unconditional: 66, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 18, unknown conditional: 10, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1459, Positive cache size: 1385, Positive conditional cache size: 24, Positive unconditional cache size: 1361, Negative cache size: 74, Negative conditional cache size: 2, Negative unconditional cache size: 72, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 975.0ms, 50 PlacesBefore, 46 PlacesAfterwards, 36 TransitionsBefore, 33 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 835 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 239, positive: 191, positive conditional: 191, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 239, positive: 191, positive conditional: 77, positive unconditional: 114, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 239, positive: 191, positive conditional: 77, positive unconditional: 114, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 4, positive unconditional: 0, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 239, positive: 187, positive conditional: 73, positive unconditional: 114, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1464, Positive cache size: 1389, Positive conditional cache size: 28, Positive unconditional cache size: 1361, Negative cache size: 75, Negative conditional cache size: 2, Negative unconditional cache size: 73, Eliminated conditions: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 89.3ms, 51 PlacesBefore, 49 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1464, Positive cache size: 1389, Positive conditional cache size: 28, Positive unconditional cache size: 1361, Negative cache size: 75, Negative conditional cache size: 2, Negative unconditional cache size: 73, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9248.9ms, 55 PlacesBefore, 54 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 23 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, positive: 23, positive conditional: 12, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 23, positive conditional: 12, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, 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: 23, positive: 19, positive conditional: 10, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1468, Positive cache size: 1393, Positive conditional cache size: 30, Positive unconditional cache size: 1363, Negative cache size: 75, Negative conditional cache size: 2, Negative unconditional cache size: 73, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6462.8ms, 56 PlacesBefore, 53 PlacesAfterwards, 40 TransitionsBefore, 37 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 28 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, positive: 28, positive conditional: 18, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 18, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 28, positive: 26, positive conditional: 17, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1470, Positive cache size: 1395, Positive conditional cache size: 31, Positive unconditional cache size: 1364, Negative cache size: 75, Negative conditional cache size: 2, Negative unconditional cache size: 73, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8050.6ms, 47 PlacesBefore, 45 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 4 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 15 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, positive: 15, positive conditional: 12, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 12, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 15, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1473, Positive cache size: 1398, Positive conditional cache size: 31, Positive unconditional cache size: 1367, Negative cache size: 75, Negative conditional cache size: 2, Negative unconditional cache size: 73, Eliminated conditions: 3 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t663; [L839] FCALL, FORK 0 pthread_create(&t663, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t664; [L841] FCALL, FORK 0 pthread_create(&t664, ((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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 1 [L777] 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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L842] 0 pthread_t t665; [L843] FCALL, FORK 0 pthread_create(&t665, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __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=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=50, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 33931.7ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1340.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3151.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 90 SDtfs, 79 SDslu, 86 SDs, 0 SdLazy, 297 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 398.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 289.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred in iteration=7, InterpolantAutomatonStates: 56, 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: 41.2ms SsaConstructionTime, 446.4ms SatisfiabilityAnalysisTime, 729.0ms InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 1057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...