/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:42:25,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:42:25,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:42:25,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:42:25,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:42:25,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:42:25,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:42:25,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:42:25,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:42:25,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:42:25,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:42:25,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:42:25,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:42:25,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:42:25,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:42:25,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:42:25,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:42:25,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:42:25,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:42:25,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:42:25,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:42:25,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:42:25,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:42:25,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:42:25,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:42:25,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:42:25,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:42:25,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:42:25,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:42:25,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:42:25,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:42:25,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:42:25,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:42:25,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:42:25,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:42:25,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:42:25,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:42:25,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:42:25,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:42:25,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:42:25,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:42:25,843 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:42:25,858 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:42:25,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:42:25,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:42:25,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:42:25,859 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:42:25,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:42:25,860 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:42:25,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:42:25,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:42:25,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:42:25,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:42:25,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:42:25,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:42:25,860 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:42:25,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:42:25,861 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:42:25,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:42:25,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:42:25,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:42:25,861 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:42:25,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:42:25,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:42:25,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:42:25,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:42:25,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:42:25,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:42:25,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:42:25,862 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:42:25,862 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:42:25,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:42:25,862 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 00:42:26,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:42:26,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:42:26,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:42:26,180 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:42:26,181 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:42:26,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i [2021-03-26 00:42:26,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc19973b1/32e96c7172cd49a0b7250a0fddcce19a/FLAGc794126eb [2021-03-26 00:42:26,697 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:42:26,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i [2021-03-26 00:42:26,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc19973b1/32e96c7172cd49a0b7250a0fddcce19a/FLAGc794126eb [2021-03-26 00:42:26,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc19973b1/32e96c7172cd49a0b7250a0fddcce19a [2021-03-26 00:42:26,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:42:26,726 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:42:26,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:42:26,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:42:26,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:42:26,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:42:26" (1/1) ... [2021-03-26 00:42:26,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1375adbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:26, skipping insertion in model container [2021-03-26 00:42:26,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:42:26" (1/1) ... [2021-03-26 00:42:26,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:42:26,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:42:26,916 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/safe018_power.oepc.i[995,1008] [2021-03-26 00:42:27,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:42:27,106 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:42:27,114 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/safe018_power.oepc.i[995,1008] [2021-03-26 00:42:27,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:42:27,214 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:42:27,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:27 WrapperNode [2021-03-26 00:42:27,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:42:27,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:42:27,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:42:27,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:42:27,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:27" (1/1) ... [2021-03-26 00:42:27,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:27" (1/1) ... [2021-03-26 00:42:27,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:42:27,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:42:27,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:42:27,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:42:27,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:27" (1/1) ... [2021-03-26 00:42:27,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:27" (1/1) ... [2021-03-26 00:42:27,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:27" (1/1) ... [2021-03-26 00:42:27,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:27" (1/1) ... [2021-03-26 00:42:27,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:27" (1/1) ... [2021-03-26 00:42:27,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:27" (1/1) ... [2021-03-26 00:42:27,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:27" (1/1) ... [2021-03-26 00:42:27,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:42:27,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:42:27,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:42:27,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:42:27,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:27" (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 00:42:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 00:42:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:42:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:42:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:42:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:42:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:42:27,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:42:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:42:27,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:42:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:42:27,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:42:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:42:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:42:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:42:27,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:42:27,390 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 00:42:28,854 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:42:28,855 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-26 00:42:28,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:42:28 BoogieIcfgContainer [2021-03-26 00:42:28,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:42:28,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:42:28,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:42:28,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:42:28,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:42:26" (1/3) ... [2021-03-26 00:42:28,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f0548a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:42:28, skipping insertion in model container [2021-03-26 00:42:28,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:42:27" (2/3) ... [2021-03-26 00:42:28,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f0548a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:42:28, skipping insertion in model container [2021-03-26 00:42:28,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:42:28" (3/3) ... [2021-03-26 00:42:28,860 INFO L111 eAbstractionObserver]: Analyzing ICFG safe018_power.oepc.i [2021-03-26 00:42:28,864 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:42:28,867 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 00:42:28,867 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:42:28,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,894 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,894 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,894 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,894 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,957 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,958 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,958 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,958 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,962 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,962 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,963 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,964 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,965 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,966 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:42:28,970 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:42:28,982 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-26 00:42:28,993 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:42:28,994 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:42:28,994 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:42:28,994 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:42:28,994 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:42:28,994 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:42:28,994 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:42:28,994 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:42:29,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2021-03-26 00:42:29,028 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-03-26 00:42:29,028 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:42:29,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2021-03-26 00:42:29,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2021-03-26 00:42:29,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 97 transitions, 203 flow [2021-03-26 00:42:29,034 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:29,041 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 97 transitions, 203 flow [2021-03-26 00:42:29,043 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 97 transitions, 203 flow [2021-03-26 00:42:29,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 97 transitions, 203 flow [2021-03-26 00:42:29,057 INFO L129 PetriNetUnfolder]: 1/97 cut-off events. [2021-03-26 00:42:29,057 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:42:29,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 1/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2021-03-26 00:42:29,059 INFO L142 LiptonReduction]: Number of co-enabled transitions 890 [2021-03-26 00:42:31,695 WARN L205 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2021-03-26 00:42:32,390 WARN L205 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 361 [2021-03-26 00:42:35,788 WARN L205 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 566 DAG size of output: 532 [2021-03-26 00:42:37,486 WARN L205 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 528 [2021-03-26 00:42:37,710 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-26 00:42:38,084 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-26 00:42:38,204 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 00:42:42,583 INFO L154 LiptonReduction]: Checked pairs total: 1274 [2021-03-26 00:42:42,583 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 00:42:42,584 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13551 [2021-03-26 00:42:42,605 INFO L129 PetriNetUnfolder]: 1/35 cut-off events. [2021-03-26 00:42:42,605 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:42:42,605 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:42,606 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:42,606 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:42,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:42,609 INFO L82 PathProgramCache]: Analyzing trace with hash 584251938, now seen corresponding path program 1 times [2021-03-26 00:42:42,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:42,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550959548] [2021-03-26 00:42:42,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:42,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:42,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:42:42,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:42,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:42,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:42,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:42:42,941 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 00:42:42,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550959548] [2021-03-26 00:42:42,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:42,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:42:42,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966156352] [2021-03-26 00:42:42,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:42:42,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:42:42,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:42:42,959 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 176 [2021-03-26 00:42:42,963 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 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 00:42:42,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:42,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 176 [2021-03-26 00:42:42,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:42,992 INFO L129 PetriNetUnfolder]: 0/39 cut-off events. [2021-03-26 00:42:42,992 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:42:42,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 4/42 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 00:42:42,994 INFO L132 encePairwiseOnDemand]: 171/176 looper letters, 2 selfloop transitions, 2 changer transitions 3/36 dead transitions. [2021-03-26 00:42:42,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 93 flow [2021-03-26 00:42:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:42:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:42:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 810 transitions. [2021-03-26 00:42:43,009 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9204545454545454 [2021-03-26 00:42:43,010 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 810 transitions. [2021-03-26 00:42:43,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 810 transitions. [2021-03-26 00:42:43,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:43,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 810 transitions. [2021-03-26 00:42:43,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 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 00:42:43,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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 00:42:43,029 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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 00:42:43,030 INFO L185 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 5 states and 810 transitions. [2021-03-26 00:42:43,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 93 flow [2021-03-26 00:42:43,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 90 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:42:43,034 INFO L241 Difference]: Finished difference. Result has 48 places, 33 transitions, 84 flow [2021-03-26 00:42:43,036 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2021-03-26 00:42:43,036 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2021-03-26 00:42:43,036 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:43,037 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 33 transitions, 84 flow [2021-03-26 00:42:43,037 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 33 transitions, 84 flow [2021-03-26 00:42:43,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 84 flow [2021-03-26 00:42:43,044 INFO L129 PetriNetUnfolder]: 0/33 cut-off events. [2021-03-26 00:42:43,045 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 00:42:43,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 33 events. 0/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:42:43,045 INFO L142 LiptonReduction]: Number of co-enabled transitions 152 [2021-03-26 00:42:43,526 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-03-26 00:42:48,097 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:42:48,232 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:42:48,367 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:42:48,497 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:42:48,500 INFO L154 LiptonReduction]: Checked pairs total: 742 [2021-03-26 00:42:48,500 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 00:42:48,501 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5465 [2021-03-26 00:42:48,502 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 58 flow [2021-03-26 00:42:48,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 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 00:42:48,502 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:48,502 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:48,503 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:42:48,503 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:48,503 INFO L82 PathProgramCache]: Analyzing trace with hash 900605826, now seen corresponding path program 1 times [2021-03-26 00:42:48,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:48,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114656307] [2021-03-26 00:42:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:48,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:48,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:42:48,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:48,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:48,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:48,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:42:48,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:48,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:42:48,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:48,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:42:48,671 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 00:42:48,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114656307] [2021-03-26 00:42:48,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:48,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:42:48,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123936529] [2021-03-26 00:42:48,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:42:48,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:42:48,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:42:48,680 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 189 [2021-03-26 00:42:48,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 58 flow. Second operand has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 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 00:42:48,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:48,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 189 [2021-03-26 00:42:48,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:48,712 INFO L129 PetriNetUnfolder]: 5/42 cut-off events. [2021-03-26 00:42:48,712 INFO L130 PetriNetUnfolder]: For 44/55 co-relation queries the response was YES. [2021-03-26 00:42:48,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 42 events. 5/42 cut-off events. For 44/55 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 122 event pairs, 1 based on Foata normal form. 4/45 useless extension candidates. Maximal degree in co-relation 72. Up to 7 conditions per place. [2021-03-26 00:42:48,712 INFO L132 encePairwiseOnDemand]: 185/189 looper letters, 4 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2021-03-26 00:42:48,712 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 23 transitions, 83 flow [2021-03-26 00:42:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:42:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:42:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 654 transitions. [2021-03-26 00:42:48,714 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8650793650793651 [2021-03-26 00:42:48,715 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 654 transitions. [2021-03-26 00:42:48,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 654 transitions. [2021-03-26 00:42:48,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:48,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 654 transitions. [2021-03-26 00:42:48,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 0 states have call successors, (0), 0 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 00:42:48,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 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 00:42:48,719 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 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 00:42:48,719 INFO L185 Difference]: Start difference. First operand has 32 places, 20 transitions, 58 flow. Second operand 4 states and 654 transitions. [2021-03-26 00:42:48,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 23 transitions, 83 flow [2021-03-26 00:42:48,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 73 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 00:42:48,720 INFO L241 Difference]: Finished difference. Result has 33 places, 20 transitions, 64 flow [2021-03-26 00:42:48,720 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2021-03-26 00:42:48,721 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -12 predicate places. [2021-03-26 00:42:48,721 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:48,721 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 20 transitions, 64 flow [2021-03-26 00:42:48,721 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 20 transitions, 64 flow [2021-03-26 00:42:48,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 20 transitions, 64 flow [2021-03-26 00:42:48,725 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-26 00:42:48,726 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 00:42:48,726 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 20 events. 0/20 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:42:48,726 INFO L142 LiptonReduction]: Number of co-enabled transitions 126 [2021-03-26 00:42:49,791 WARN L205 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 159 [2021-03-26 00:42:50,026 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-26 00:42:50,515 WARN L205 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 159 [2021-03-26 00:42:50,766 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-26 00:42:50,783 INFO L154 LiptonReduction]: Checked pairs total: 378 [2021-03-26 00:42:50,783 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:42:50,783 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2062 [2021-03-26 00:42:50,786 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 60 flow [2021-03-26 00:42:50,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 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 00:42:50,787 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:50,787 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:50,787 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:42:50,787 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:50,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1502333617, now seen corresponding path program 1 times [2021-03-26 00:42:50,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:50,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963942523] [2021-03-26 00:42:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:50,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:50,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:50,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:50,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:42:50,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:50,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 00:42:50,885 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 00:42:50,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963942523] [2021-03-26 00:42:50,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:50,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:42:50,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309867677] [2021-03-26 00:42:50,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:42:50,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:50,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:42:50,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:42:50,888 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 191 [2021-03-26 00:42:50,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 0 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 00:42:50,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:50,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 191 [2021-03-26 00:42:50,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:50,912 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 00:42:50,912 INFO L130 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2021-03-26 00:42:50,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 18 events. 0/18 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 1/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:42:50,913 INFO L132 encePairwiseOnDemand]: 188/191 looper letters, 1 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2021-03-26 00:42:50,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 18 transitions, 66 flow [2021-03-26 00:42:50,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:42:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:42:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2021-03-26 00:42:50,917 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8917975567190227 [2021-03-26 00:42:50,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2021-03-26 00:42:50,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2021-03-26 00:42:50,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:50,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2021-03-26 00:42:50,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 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 00:42:50,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:50,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:50,919 INFO L185 Difference]: Start difference. First operand has 31 places, 18 transitions, 60 flow. Second operand 3 states and 511 transitions. [2021-03-26 00:42:50,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 18 transitions, 66 flow [2021-03-26 00:42:50,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 18 transitions, 54 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 00:42:50,920 INFO L241 Difference]: Finished difference. Result has 30 places, 18 transitions, 56 flow [2021-03-26 00:42:50,920 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2021-03-26 00:42:50,920 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -15 predicate places. [2021-03-26 00:42:50,920 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:50,921 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 18 transitions, 56 flow [2021-03-26 00:42:50,921 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 18 transitions, 56 flow [2021-03-26 00:42:50,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 18 transitions, 56 flow [2021-03-26 00:42:50,924 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 00:42:50,924 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:42:50,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 18 events. 0/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:42:50,924 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-26 00:42:51,538 INFO L154 LiptonReduction]: Checked pairs total: 113 [2021-03-26 00:42:51,539 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:42:51,539 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 619 [2021-03-26 00:42:51,540 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 56 flow [2021-03-26 00:42:51,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 0 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 00:42:51,540 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:51,540 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:51,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:42:51,540 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:51,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:51,541 INFO L82 PathProgramCache]: Analyzing trace with hash -41028381, now seen corresponding path program 1 times [2021-03-26 00:42:51,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:51,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493693369] [2021-03-26 00:42:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:51,675 INFO L142 QuantifierPusher]: treesize reduction 12, result has 67.6 percent of original size [2021-03-26 00:42:51,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:42:51,686 INFO L142 QuantifierPusher]: treesize reduction 8, result has 71.4 percent of original size [2021-03-26 00:42:51,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:42:51,698 INFO L142 QuantifierPusher]: treesize reduction 8, result has 76.5 percent of original size [2021-03-26 00:42:51,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 00:42:51,711 INFO L142 QuantifierPusher]: treesize reduction 15, result has 44.4 percent of original size [2021-03-26 00:42:51,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 00:42:51,719 INFO L142 QuantifierPusher]: treesize reduction 7, result has 63.2 percent of original size [2021-03-26 00:42:51,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 00:42:51,728 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 00:42:51,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493693369] [2021-03-26 00:42:51,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:51,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:42:51,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742474560] [2021-03-26 00:42:51,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:42:51,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:42:51,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:42:51,730 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 191 [2021-03-26 00:42:51,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 56 flow. Second operand has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 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 00:42:51,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:51,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 191 [2021-03-26 00:42:51,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:51,822 INFO L129 PetriNetUnfolder]: 14/61 cut-off events. [2021-03-26 00:42:51,823 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-26 00:42:51,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 61 events. 14/61 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 177 event pairs, 1 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 128. Up to 23 conditions per place. [2021-03-26 00:42:51,824 INFO L132 encePairwiseOnDemand]: 185/191 looper letters, 9 selfloop transitions, 6 changer transitions 0/25 dead transitions. [2021-03-26 00:42:51,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 25 transitions, 107 flow [2021-03-26 00:42:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:42:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:42:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2021-03-26 00:42:51,825 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6544502617801047 [2021-03-26 00:42:51,826 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2021-03-26 00:42:51,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2021-03-26 00:42:51,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:51,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2021-03-26 00:42:51,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 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 00:42:51,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:51,828 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:51,828 INFO L185 Difference]: Start difference. First operand has 30 places, 18 transitions, 56 flow. Second operand 4 states and 500 transitions. [2021-03-26 00:42:51,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 25 transitions, 107 flow [2021-03-26 00:42:51,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 101 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:42:51,829 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 90 flow [2021-03-26 00:42:51,829 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-26 00:42:51,830 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -12 predicate places. [2021-03-26 00:42:51,830 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:51,830 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 90 flow [2021-03-26 00:42:51,830 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 90 flow [2021-03-26 00:42:51,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 90 flow [2021-03-26 00:42:51,838 INFO L129 PetriNetUnfolder]: 3/40 cut-off events. [2021-03-26 00:42:51,838 INFO L130 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2021-03-26 00:42:51,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 40 events. 3/40 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 125 event pairs, 0 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 80. Up to 9 conditions per place. [2021-03-26 00:42:51,839 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-26 00:42:52,100 INFO L154 LiptonReduction]: Checked pairs total: 121 [2021-03-26 00:42:52,100 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:42:52,100 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 270 [2021-03-26 00:42:52,101 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 90 flow [2021-03-26 00:42:52,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 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 00:42:52,101 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:52,101 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:52,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:42:52,102 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:52,102 INFO L82 PathProgramCache]: Analyzing trace with hash 22616573, now seen corresponding path program 2 times [2021-03-26 00:42:52,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:52,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745114454] [2021-03-26 00:42:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:52,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:52,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:42:52,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:52,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:42:52,238 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.9 percent of original size [2021-03-26 00:42:52,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 00:42:52,254 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.7 percent of original size [2021-03-26 00:42:52,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:42:52,285 INFO L142 QuantifierPusher]: treesize reduction 10, result has 61.5 percent of original size [2021-03-26 00:42:52,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:42:52,295 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 00:42:52,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745114454] [2021-03-26 00:42:52,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:52,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:42:52,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150724653] [2021-03-26 00:42:52,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:42:52,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:52,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:42:52,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:42:52,297 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 191 [2021-03-26 00:42:52,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 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 00:42:52,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:52,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 191 [2021-03-26 00:42:52,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:52,401 INFO L129 PetriNetUnfolder]: 13/59 cut-off events. [2021-03-26 00:42:52,402 INFO L130 PetriNetUnfolder]: For 36/40 co-relation queries the response was YES. [2021-03-26 00:42:52,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 59 events. 13/59 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 173 event pairs, 1 based on Foata normal form. 5/64 useless extension candidates. Maximal degree in co-relation 147. Up to 22 conditions per place. [2021-03-26 00:42:52,402 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 11 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2021-03-26 00:42:52,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 135 flow [2021-03-26 00:42:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:42:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:42:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2021-03-26 00:42:52,404 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6321989528795812 [2021-03-26 00:42:52,404 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2021-03-26 00:42:52,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2021-03-26 00:42:52,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:52,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2021-03-26 00:42:52,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 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 00:42:52,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:52,407 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:42:52,407 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 90 flow. Second operand 4 states and 483 transitions. [2021-03-26 00:42:52,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 135 flow [2021-03-26 00:42:52,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:42:52,409 INFO L241 Difference]: Finished difference. Result has 36 places, 23 transitions, 106 flow [2021-03-26 00:42:52,409 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2021-03-26 00:42:52,409 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2021-03-26 00:42:52,409 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:52,409 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 106 flow [2021-03-26 00:42:52,409 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 106 flow [2021-03-26 00:42:52,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 106 flow [2021-03-26 00:42:52,414 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-03-26 00:42:52,414 INFO L130 PetriNetUnfolder]: For 29/31 co-relation queries the response was YES. [2021-03-26 00:42:52,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 39 events. 3/39 cut-off events. For 29/31 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 0 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 82. Up to 8 conditions per place. [2021-03-26 00:42:52,418 INFO L142 LiptonReduction]: Number of co-enabled transitions 146 [2021-03-26 00:42:52,480 INFO L154 LiptonReduction]: Checked pairs total: 258 [2021-03-26 00:42:52,480 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:42:52,480 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-03-26 00:42:52,481 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 110 flow [2021-03-26 00:42:52,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 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 00:42:52,481 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:52,481 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:52,481 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:42:52,481 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:52,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1115531428, now seen corresponding path program 1 times [2021-03-26 00:42:52,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:52,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089585244] [2021-03-26 00:42:52,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:52,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:52,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:52,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:52,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:52,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:52,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:42:52,530 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 00:42:52,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089585244] [2021-03-26 00:42:52,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:52,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:42:52,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003847334] [2021-03-26 00:42:52,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:42:52,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:52,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:42:52,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:42:52,532 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2021-03-26 00:42:52,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 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 00:42:52,533 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:52,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2021-03-26 00:42:52,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:52,583 INFO L129 PetriNetUnfolder]: 44/127 cut-off events. [2021-03-26 00:42:52,583 INFO L130 PetriNetUnfolder]: For 76/82 co-relation queries the response was YES. [2021-03-26 00:42:52,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 127 events. 44/127 cut-off events. For 76/82 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 576 event pairs, 16 based on Foata normal form. 16/136 useless extension candidates. Maximal degree in co-relation 289. Up to 73 conditions per place. [2021-03-26 00:42:52,584 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 8 selfloop transitions, 8 changer transitions 0/33 dead transitions. [2021-03-26 00:42:52,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 162 flow [2021-03-26 00:42:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:42:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:42:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 843 transitions. [2021-03-26 00:42:52,597 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8735751295336788 [2021-03-26 00:42:52,598 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 843 transitions. [2021-03-26 00:42:52,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 843 transitions. [2021-03-26 00:42:52,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:52,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 843 transitions. [2021-03-26 00:42:52,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.6) internal successors, (843), 5 states have internal predecessors, (843), 0 states have call successors, (0), 0 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 00:42:52,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 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 00:42:52,601 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 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 00:42:52,601 INFO L185 Difference]: Start difference. First operand has 36 places, 23 transitions, 110 flow. Second operand 5 states and 843 transitions. [2021-03-26 00:42:52,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 162 flow [2021-03-26 00:42:52,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:42:52,603 INFO L241 Difference]: Finished difference. Result has 42 places, 30 transitions, 166 flow [2021-03-26 00:42:52,603 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2021-03-26 00:42:52,604 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2021-03-26 00:42:52,604 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:52,604 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 166 flow [2021-03-26 00:42:52,604 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 166 flow [2021-03-26 00:42:52,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 166 flow [2021-03-26 00:42:52,648 INFO L129 PetriNetUnfolder]: 44/125 cut-off events. [2021-03-26 00:42:52,648 INFO L130 PetriNetUnfolder]: For 124/137 co-relation queries the response was YES. [2021-03-26 00:42:52,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 125 events. 44/125 cut-off events. For 124/137 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 569 event pairs, 16 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 357. Up to 76 conditions per place. [2021-03-26 00:42:52,650 INFO L142 LiptonReduction]: Number of co-enabled transitions 212 [2021-03-26 00:42:52,692 INFO L154 LiptonReduction]: Checked pairs total: 238 [2021-03-26 00:42:52,692 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:42:52,692 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 88 [2021-03-26 00:42:52,696 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 158 flow [2021-03-26 00:42:52,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 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 00:42:52,697 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:52,697 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:52,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:42:52,697 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:52,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:52,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1331700666, now seen corresponding path program 1 times [2021-03-26 00:42:52,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:52,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103188696] [2021-03-26 00:42:52,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:52,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:52,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:52,789 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-26 00:42:52,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:42:52,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:52,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:52,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:52,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:42:52,798 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 00:42:52,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103188696] [2021-03-26 00:42:52,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:52,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:42:52,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293884140] [2021-03-26 00:42:52,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:42:52,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:52,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:42:52,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:42:52,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 194 [2021-03-26 00:42:52,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 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 00:42:52,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:52,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 194 [2021-03-26 00:42:52,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:52,846 INFO L129 PetriNetUnfolder]: 24/88 cut-off events. [2021-03-26 00:42:52,846 INFO L130 PetriNetUnfolder]: For 132/184 co-relation queries the response was YES. [2021-03-26 00:42:52,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 88 events. 24/88 cut-off events. For 132/184 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 342 event pairs, 2 based on Foata normal form. 26/111 useless extension candidates. Maximal degree in co-relation 306. Up to 54 conditions per place. [2021-03-26 00:42:52,847 INFO L132 encePairwiseOnDemand]: 188/194 looper letters, 5 selfloop transitions, 11 changer transitions 3/35 dead transitions. [2021-03-26 00:42:52,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 236 flow [2021-03-26 00:42:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:42:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:42:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1017 transitions. [2021-03-26 00:42:52,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8737113402061856 [2021-03-26 00:42:52,849 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1017 transitions. [2021-03-26 00:42:52,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1017 transitions. [2021-03-26 00:42:52,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:52,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1017 transitions. [2021-03-26 00:42:52,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 0 states have call successors, (0), 0 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 00:42:52,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 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 00:42:52,854 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 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 00:42:52,854 INFO L185 Difference]: Start difference. First operand has 41 places, 28 transitions, 158 flow. Second operand 6 states and 1017 transitions. [2021-03-26 00:42:52,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 236 flow [2021-03-26 00:42:52,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 223 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-26 00:42:52,859 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 215 flow [2021-03-26 00:42:52,859 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2021-03-26 00:42:52,859 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2021-03-26 00:42:52,859 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:52,859 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 215 flow [2021-03-26 00:42:52,859 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 215 flow [2021-03-26 00:42:52,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 215 flow [2021-03-26 00:42:52,868 INFO L129 PetriNetUnfolder]: 22/85 cut-off events. [2021-03-26 00:42:52,868 INFO L130 PetriNetUnfolder]: For 156/168 co-relation queries the response was YES. [2021-03-26 00:42:52,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 85 events. 22/85 cut-off events. For 156/168 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 322 event pairs, 2 based on Foata normal form. 3/87 useless extension candidates. Maximal degree in co-relation 305. Up to 51 conditions per place. [2021-03-26 00:42:52,869 INFO L142 LiptonReduction]: Number of co-enabled transitions 172 [2021-03-26 00:42:52,873 INFO L154 LiptonReduction]: Checked pairs total: 211 [2021-03-26 00:42:52,873 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:42:52,873 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-26 00:42:52,873 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 207 flow [2021-03-26 00:42:52,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 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 00:42:52,874 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:52,874 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:52,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:42:52,874 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:52,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1082794253, now seen corresponding path program 1 times [2021-03-26 00:42:52,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:52,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664765852] [2021-03-26 00:42:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:52,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:52,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:42:52,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:52,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:52,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:52,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:52,931 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 00:42:52,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664765852] [2021-03-26 00:42:52,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:52,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:42:52,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564219391] [2021-03-26 00:42:52,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:42:52,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:52,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:42:52,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:42:52,933 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 194 [2021-03-26 00:42:52,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 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 00:42:52,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:52,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 194 [2021-03-26 00:42:52,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:52,965 INFO L129 PetriNetUnfolder]: 34/125 cut-off events. [2021-03-26 00:42:52,966 INFO L130 PetriNetUnfolder]: For 261/289 co-relation queries the response was YES. [2021-03-26 00:42:52,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 125 events. 34/125 cut-off events. For 261/289 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 545 event pairs, 4 based on Foata normal form. 11/133 useless extension candidates. Maximal degree in co-relation 449. Up to 71 conditions per place. [2021-03-26 00:42:52,967 INFO L132 encePairwiseOnDemand]: 191/194 looper letters, 8 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2021-03-26 00:42:52,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 213 flow [2021-03-26 00:42:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:42:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:42:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 675 transitions. [2021-03-26 00:42:52,968 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8698453608247423 [2021-03-26 00:42:52,969 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 675 transitions. [2021-03-26 00:42:52,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 675 transitions. [2021-03-26 00:42:52,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:52,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 675 transitions. [2021-03-26 00:42:52,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 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 00:42:52,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 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 00:42:52,971 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 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 00:42:52,971 INFO L185 Difference]: Start difference. First operand has 44 places, 31 transitions, 207 flow. Second operand 4 states and 675 transitions. [2021-03-26 00:42:52,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 213 flow [2021-03-26 00:42:52,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 193 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-26 00:42:52,973 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 170 flow [2021-03-26 00:42:52,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2021-03-26 00:42:52,973 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2021-03-26 00:42:52,973 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:52,973 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 29 transitions, 170 flow [2021-03-26 00:42:52,974 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 29 transitions, 170 flow [2021-03-26 00:42:52,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 29 transitions, 170 flow [2021-03-26 00:42:52,986 INFO L129 PetriNetUnfolder]: 31/117 cut-off events. [2021-03-26 00:42:52,986 INFO L130 PetriNetUnfolder]: For 135/141 co-relation queries the response was YES. [2021-03-26 00:42:52,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 117 events. 31/117 cut-off events. For 135/141 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 513 event pairs, 4 based on Foata normal form. 3/117 useless extension candidates. Maximal degree in co-relation 354. Up to 45 conditions per place. [2021-03-26 00:42:52,987 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-26 00:42:56,133 INFO L154 LiptonReduction]: Checked pairs total: 36 [2021-03-26 00:42:56,134 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:42:56,134 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3161 [2021-03-26 00:42:56,134 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 170 flow [2021-03-26 00:42:56,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 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 00:42:56,134 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:56,135 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:42:56,135 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:42:56,135 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:56,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:56,135 INFO L82 PathProgramCache]: Analyzing trace with hash 664104693, now seen corresponding path program 2 times [2021-03-26 00:42:56,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:56,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125858640] [2021-03-26 00:42:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:42:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:42:56,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:56,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:56,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:56,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:56,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:56,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:56,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:56,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:42:56,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:42:56,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:42:56,246 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 00:42:56,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125858640] [2021-03-26 00:42:56,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:42:56,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:42:56,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197676305] [2021-03-26 00:42:56,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:42:56,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:42:56,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:42:56,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:42:56,248 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 194 [2021-03-26 00:42:56,249 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 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 00:42:56,249 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:42:56,249 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 194 [2021-03-26 00:42:56,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:42:56,297 INFO L129 PetriNetUnfolder]: 23/96 cut-off events. [2021-03-26 00:42:56,297 INFO L130 PetriNetUnfolder]: For 159/216 co-relation queries the response was YES. [2021-03-26 00:42:56,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 96 events. 23/96 cut-off events. For 159/216 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 402 event pairs, 0 based on Foata normal form. 38/130 useless extension candidates. Maximal degree in co-relation 348. Up to 38 conditions per place. [2021-03-26 00:42:56,298 INFO L132 encePairwiseOnDemand]: 188/194 looper letters, 2 selfloop transitions, 11 changer transitions 5/33 dead transitions. [2021-03-26 00:42:56,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 33 transitions, 232 flow [2021-03-26 00:42:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:42:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:42:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1180 transitions. [2021-03-26 00:42:56,300 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8689248895434463 [2021-03-26 00:42:56,301 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1180 transitions. [2021-03-26 00:42:56,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1180 transitions. [2021-03-26 00:42:56,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:42:56,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1180 transitions. [2021-03-26 00:42:56,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.57142857142858) internal successors, (1180), 7 states have internal predecessors, (1180), 0 states have call successors, (0), 0 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 00:42:56,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 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 00:42:56,307 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 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 00:42:56,307 INFO L185 Difference]: Start difference. First operand has 44 places, 29 transitions, 170 flow. Second operand 7 states and 1180 transitions. [2021-03-26 00:42:56,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 33 transitions, 232 flow [2021-03-26 00:42:56,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 33 transitions, 208 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-26 00:42:56,309 INFO L241 Difference]: Finished difference. Result has 50 places, 28 transitions, 184 flow [2021-03-26 00:42:56,309 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2021-03-26 00:42:56,310 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2021-03-26 00:42:56,310 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:42:56,310 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 28 transitions, 184 flow [2021-03-26 00:42:56,310 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 28 transitions, 184 flow [2021-03-26 00:42:56,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 28 transitions, 184 flow [2021-03-26 00:42:56,326 INFO L129 PetriNetUnfolder]: 17/83 cut-off events. [2021-03-26 00:42:56,326 INFO L130 PetriNetUnfolder]: For 146/156 co-relation queries the response was YES. [2021-03-26 00:42:56,326 INFO L84 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 83 events. 17/83 cut-off events. For 146/156 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 331 event pairs, 0 based on Foata normal form. 2/82 useless extension candidates. Maximal degree in co-relation 296. Up to 31 conditions per place. [2021-03-26 00:42:56,327 INFO L142 LiptonReduction]: Number of co-enabled transitions 106 [2021-03-26 00:42:56,658 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2021-03-26 00:42:56,760 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-03-26 00:42:57,494 WARN L205 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2021-03-26 00:42:57,777 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-03-26 00:42:58,019 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2021-03-26 00:42:58,508 WARN L205 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2021-03-26 00:42:58,659 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-03-26 00:42:58,785 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 00:42:59,008 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:42:59,141 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:42:59,291 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2021-03-26 00:42:59,445 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2021-03-26 00:42:59,704 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2021-03-26 00:42:59,960 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2021-03-26 00:42:59,963 INFO L154 LiptonReduction]: Checked pairs total: 16 [2021-03-26 00:42:59,963 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:42:59,963 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3653 [2021-03-26 00:42:59,964 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 24 transitions, 168 flow [2021-03-26 00:42:59,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 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 00:42:59,964 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:42:59,964 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 00:42:59,964 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:42:59,964 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:42:59,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:42:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash 860832825, now seen corresponding path program 1 times [2021-03-26 00:42:59,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:42:59,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850275826] [2021-03-26 00:42:59,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:43:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:43:00,016 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:43:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:43:00,056 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:43:00,094 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:43:00,094 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:43:00,094 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:43:00,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:43:00 BasicIcfg [2021-03-26 00:43:00,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:43:00,186 INFO L168 Benchmark]: Toolchain (without parser) took 33459.55 ms. Allocated memory was 327.2 MB in the beginning and 765.5 MB in the end (delta: 438.3 MB). Free memory was 290.5 MB in the beginning and 470.5 MB in the end (delta: -180.0 MB). Peak memory consumption was 260.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:43:00,186 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 327.2 MB. Free memory is still 308.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:43:00,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 487.69 ms. Allocated memory is still 327.2 MB. Free memory was 290.2 MB in the beginning and 285.9 MB in the end (delta: 4.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:43:00,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.18 ms. Allocated memory is still 327.2 MB. Free memory was 285.9 MB in the beginning and 283.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:43:00,187 INFO L168 Benchmark]: Boogie Preprocessor took 42.66 ms. Allocated memory is still 327.2 MB. Free memory was 283.2 MB in the beginning and 280.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:43:00,187 INFO L168 Benchmark]: RCFGBuilder took 1533.32 ms. Allocated memory is still 327.2 MB. Free memory was 280.6 MB in the beginning and 132.0 MB in the end (delta: 148.6 MB). Peak memory consumption was 167.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:43:00,187 INFO L168 Benchmark]: TraceAbstraction took 31328.62 ms. Allocated memory was 327.2 MB in the beginning and 765.5 MB in the end (delta: 438.3 MB). Free memory was 132.0 MB in the beginning and 470.5 MB in the end (delta: -338.5 MB). Peak memory consumption was 99.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:43:00,198 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.47 ms. Allocated memory is still 327.2 MB. Free memory is still 308.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 487.69 ms. Allocated memory is still 327.2 MB. Free memory was 290.2 MB in the beginning and 285.9 MB in the end (delta: 4.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 63.18 ms. Allocated memory is still 327.2 MB. Free memory was 285.9 MB in the beginning and 283.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 42.66 ms. Allocated memory is still 327.2 MB. Free memory was 283.2 MB in the beginning and 280.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1533.32 ms. Allocated memory is still 327.2 MB. Free memory was 280.6 MB in the beginning and 132.0 MB in the end (delta: 148.6 MB). Peak memory consumption was 167.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 31328.62 ms. Allocated memory was 327.2 MB in the beginning and 765.5 MB in the end (delta: 438.3 MB). Free memory was 132.0 MB in the beginning and 470.5 MB in the end (delta: -338.5 MB). Peak memory consumption was 99.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13540.4ms, 106 PlacesBefore, 45 PlacesAfterwards, 97 TransitionsBefore, 36 TransitionsAfterwards, 890 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 64 TotalNumberOfCompositions, 1274 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 732, positive: 682, positive conditional: 682, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 566, positive: 540, positive conditional: 0, positive unconditional: 540, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 566, positive: 540, positive conditional: 0, positive unconditional: 540, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 566, positive: 534, positive conditional: 0, positive unconditional: 534, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3140, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 274, negative conditional: 0, negative unconditional: 274, unknown: 2856, unknown conditional: 0, unknown unconditional: 2856] ], Cache Queries: [ total: 732, positive: 142, positive conditional: 142, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 566, unknown conditional: 566, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 10, Positive conditional cache size: 10, Positive unconditional cache size: 0, Negative cache size: 9, Negative conditional cache size: 9, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5463.0ms, 48 PlacesBefore, 32 PlacesAfterwards, 33 TransitionsBefore, 20 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 742 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 235, positive: 164, positive conditional: 164, positive unconditional: 0, negative: 71, negative conditional: 71, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, positive: 45, positive conditional: 2, positive unconditional: 43, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 61, positive: 45, positive conditional: 2, positive unconditional: 43, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 61, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 13, negative conditional: 1, negative unconditional: 12, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3638, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 191, negative conditional: 5, negative unconditional: 186, unknown: 3432, unknown conditional: 0, unknown unconditional: 3432] ], Cache Queries: [ total: 235, positive: 119, positive conditional: 119, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 61, unknown conditional: 61, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 42, Positive conditional cache size: 42, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2061.9ms, 33 PlacesBefore, 31 PlacesAfterwards, 20 TransitionsBefore, 18 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 378 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 87, positive conditional: 87, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 2, positive unconditional: 3, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 2, positive unconditional: 3, 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: 10, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 110, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 126, positive: 82, positive conditional: 82, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 18, Negative conditional cache size: 18, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 617.9ms, 30 PlacesBefore, 30 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 113 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 11, positive conditional: 3, positive unconditional: 8, negative: 8, negative conditional: 6, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 11, positive conditional: 3, positive unconditional: 8, negative: 8, negative conditional: 6, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 6, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 612, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 612, negative conditional: 608, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 58, Positive conditional cache size: 58, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 269.9ms, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 121 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 13, positive conditional: 5, positive unconditional: 8, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 13, positive conditional: 5, positive unconditional: 8, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 258, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 236, negative conditional: 0, negative unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 71, Positive conditional cache size: 71, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 70.6ms, 36 PlacesBefore, 36 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 258 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 79, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 19, positive conditional: 16, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 19, positive conditional: 16, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 79, Positive conditional cache size: 79, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 88.1ms, 42 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 238 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 26, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 26, 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: 28, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.4ms, 44 PlacesBefore, 44 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 211 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 80, positive conditional: 80, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 20, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 20, 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: 26, positive: 26, positive conditional: 0, positive unconditional: 26, 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: 94, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 82, Positive conditional cache size: 82, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3159.9ms, 44 PlacesBefore, 44 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 36 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3144, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3144, unknown conditional: 0, unknown unconditional: 3144] ], Cache Queries: [ total: 8, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 84, Positive conditional cache size: 84, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3653.2ms, 50 PlacesBefore, 45 PlacesAfterwards, 28 TransitionsBefore, 24 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 16 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, 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: 16, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 54, Positive conditional cache size: 54, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L832] 0 pthread_t t2201; [L833] FCALL, FORK 0 pthread_create(&t2201, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 pthread_t t2202; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L835] FCALL, FORK 0 pthread_create(&t2202, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=255, weak$$choice2=255, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L836] 0 pthread_t t2203; [L837] FCALL, FORK 0 pthread_create(&t2203, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0: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$$choice1=255, weak$$choice2=255, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 3 __unbuffered_p2_EAX = x [L807] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0: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$$choice1=255, weak$$choice2=255, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L810] EXPR 3 \read(y) [L810] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L814] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L839] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L843] EXPR 0 \read(y) [L843] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L847] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L847] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L850] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L851] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L851] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L851] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L851] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L852] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 31103.7ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 608.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13606.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 28 SDtfs, 22 SDslu, 19 SDs, 0 SdLazy, 211 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 180.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 265.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=7, InterpolantAutomatonStates: 42, 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: 31.2ms SsaConstructionTime, 488.8ms SatisfiabilityAnalysisTime, 696.0ms InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 828 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...