/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:50:22,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:50:22,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:50:22,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:50:22,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:50:22,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:50:22,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:50:22,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:50:22,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:50:22,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:50:22,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:50:22,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:50:22,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:50:22,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:50:22,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:50:22,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:50:22,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:50:22,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:50:22,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:50:22,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:50:22,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:50:22,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:50:22,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:50:22,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:50:22,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:50:22,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:50:22,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:50:22,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:50:22,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:50:22,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:50:22,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:50:22,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:50:22,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:50:22,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:50:22,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:50:22,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:50:22,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:50:22,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:50:22,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:50:22,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:50:22,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:50:22,659 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-RepeatedSemanticLbe.epf [2021-03-25 14:50:22,690 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:50:22,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:50:22,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:50:22,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:50:22,693 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:50:22,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:50:22,693 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:50:22,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:50:22,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:50:22,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:50:22,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:50:22,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:50:22,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:50:22,695 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:50:22,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:50:22,695 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:50:22,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:50:22,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:50:22,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:50:22,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:50:22,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:50:22,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:50:22,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:50:22,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:50:22,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:50:22,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:50:22,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:50:22,697 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:50:22,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:50:22,697 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:50:22,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:50:22,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:50:22,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:50:22,952 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:50:22,952 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:50:22,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt.i [2021-03-25 14:50:23,000 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62ccbbac/6fb591a40aa141468c825278022f83d7/FLAGd90d6d043 [2021-03-25 14:50:23,365 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:50:23,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.opt.i [2021-03-25 14:50:23,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62ccbbac/6fb591a40aa141468c825278022f83d7/FLAGd90d6d043 [2021-03-25 14:50:23,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62ccbbac/6fb591a40aa141468c825278022f83d7 [2021-03-25 14:50:23,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:50:23,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:50:23,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:50:23,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:50:23,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:50:23,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:50:23" (1/1) ... [2021-03-25 14:50:23,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eff25e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:23, skipping insertion in model container [2021-03-25 14:50:23,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:50:23" (1/1) ... [2021-03-25 14:50:23,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:50:23,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:50:23,870 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/safe007_power.opt.i[951,964] [2021-03-25 14:50:24,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:50:24,032 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:50:24,039 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/safe007_power.opt.i[951,964] [2021-03-25 14:50:24,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:50:24,142 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:50:24,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:24 WrapperNode [2021-03-25 14:50:24,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:50:24,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:50:24,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:50:24,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:50:24,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:24" (1/1) ... [2021-03-25 14:50:24,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:24" (1/1) ... [2021-03-25 14:50:24,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:50:24,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:50:24,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:50:24,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:50:24,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:24" (1/1) ... [2021-03-25 14:50:24,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:24" (1/1) ... [2021-03-25 14:50:24,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:24" (1/1) ... [2021-03-25 14:50:24,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:24" (1/1) ... [2021-03-25 14:50:24,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:24" (1/1) ... [2021-03-25 14:50:24,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:24" (1/1) ... [2021-03-25 14:50:24,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:24" (1/1) ... [2021-03-25 14:50:24,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:50:24,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:50:24,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:50:24,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:50:24,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:50:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 14:50:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:50:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:50:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:50:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:50:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:50:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:50:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:50:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:50:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:50:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:50:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:50:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:50:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:50:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:50:24,267 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:50:25,975 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:50:25,975 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:50:25,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:50:25 BoogieIcfgContainer [2021-03-25 14:50:25,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:50:25,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:50:25,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:50:25,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:50:25,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:50:23" (1/3) ... [2021-03-25 14:50:25,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac04463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:50:25, skipping insertion in model container [2021-03-25 14:50:25,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:24" (2/3) ... [2021-03-25 14:50:25,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac04463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:50:25, skipping insertion in model container [2021-03-25 14:50:25,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:50:25" (3/3) ... [2021-03-25 14:50:25,982 INFO L111 eAbstractionObserver]: Analyzing ICFG safe007_power.opt.i [2021-03-25 14:50:25,986 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:50:25,989 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:50:25,989 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:50:26,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,025 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,025 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,026 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,026 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,026 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,026 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,026 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,026 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,026 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,027 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,027 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,031 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,031 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,031 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,031 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,031 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,032 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,033 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,052 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,054 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,055 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,055 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:26,061 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:50:26,072 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:50:26,084 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:50:26,084 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:50:26,084 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:50:26,084 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:50:26,084 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:50:26,084 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:50:26,084 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:50:26,084 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:50:26,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2021-03-25 14:50:26,115 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:50:26,115 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:50:26,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 14:50:26,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2021-03-25 14:50:26,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2021-03-25 14:50:26,121 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:50:26,129 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2021-03-25 14:50:26,131 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2021-03-25 14:50:26,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2021-03-25 14:50:26,144 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:50:26,145 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:50:26,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 14:50:26,147 INFO L142 LiptonReduction]: Number of co-enabled transitions 1586 [2021-03-25 14:50:29,764 WARN L205 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 406 DAG size of output: 363 [2021-03-25 14:50:30,496 WARN L205 SmtUtils]: Spent 728.00 ms on a formula simplification that was a NOOP. DAG size: 360 [2021-03-25 14:50:34,517 WARN L205 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 566 DAG size of output: 529 [2021-03-25 14:50:36,104 WARN L205 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 525 [2021-03-25 14:50:36,447 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-25 14:50:36,872 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-25 14:50:37,021 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-25 14:50:38,630 INFO L154 LiptonReduction]: Checked pairs total: 2738 [2021-03-25 14:50:38,630 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-25 14:50:38,632 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12511 [2021-03-25 14:50:38,639 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-25 14:50:38,639 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:50:38,639 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:50:38,639 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:50:38,639 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:50:38,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:50:38,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1771816674, now seen corresponding path program 1 times [2021-03-25 14:50:38,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:50:38,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526309877] [2021-03-25 14:50:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:50:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:50:38,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:38,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:50:38,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:38,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:50:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:50:38,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526309877] [2021-03-25 14:50:38,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:50:38,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:50:38,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981875706] [2021-03-25 14:50:38,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:50:38,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:50:38,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:50:38,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:50:38,841 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 192 [2021-03-25 14:50:38,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:38,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:50:38,842 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 192 [2021-03-25 14:50:38,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:50:38,890 INFO L129 PetriNetUnfolder]: 16/87 cut-off events. [2021-03-25 14:50:38,891 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:50:38,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 87 events. 16/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 259 event pairs, 11 based on Foata normal form. 7/89 useless extension candidates. Maximal degree in co-relation 106. Up to 27 conditions per place. [2021-03-25 14:50:38,893 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 7 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2021-03-25 14:50:38,893 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 117 flow [2021-03-25 14:50:38,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:50:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:50:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2021-03-25 14:50:38,907 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9270833333333334 [2021-03-25 14:50:38,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2021-03-25 14:50:38,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2021-03-25 14:50:38,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:50:38,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2021-03-25 14:50:38,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:38,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:38,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:38,928 INFO L185 Difference]: Start difference. First operand has 54 places, 45 transitions, 99 flow. Second operand 3 states and 534 transitions. [2021-03-25 14:50:38,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 117 flow [2021-03-25 14:50:38,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:50:38,933 INFO L241 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2021-03-25 14:50:38,934 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2021-03-25 14:50:38,934 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2021-03-25 14:50:38,935 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:50:38,935 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 94 flow [2021-03-25 14:50:38,935 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 42 transitions, 94 flow [2021-03-25 14:50:38,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 94 flow [2021-03-25 14:50:38,945 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-03-25 14:50:38,945 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:50:38,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:50:38,946 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-25 14:50:39,312 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2021-03-25 14:50:41,560 INFO L154 LiptonReduction]: Checked pairs total: 1317 [2021-03-25 14:50:41,560 INFO L156 LiptonReduction]: Total number of compositions: 17 [2021-03-25 14:50:41,560 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2625 [2021-03-25 14:50:41,561 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-25 14:50:41,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:41,561 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:50:41,561 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, 1] [2021-03-25 14:50:41,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:50:41,562 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:50:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:50:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1068477175, now seen corresponding path program 1 times [2021-03-25 14:50:41,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:50:41,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830053987] [2021-03-25 14:50:41,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:50:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:50:41,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:41,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:50:41,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:41,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:50:41,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:41,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:50:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:50:41,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830053987] [2021-03-25 14:50:41,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:50:41,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:50:41,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490440077] [2021-03-25 14:50:41,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:50:41,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:50:41,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:50:41,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:50:41,644 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 209 [2021-03-25 14:50:41,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:41,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:50:41,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 209 [2021-03-25 14:50:41,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:50:41,670 INFO L129 PetriNetUnfolder]: 1/27 cut-off events. [2021-03-25 14:50:41,671 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:50:41,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 27 events. 1/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 32. Up to 3 conditions per place. [2021-03-25 14:50:41,671 INFO L132 encePairwiseOnDemand]: 205/209 looper letters, 1 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2021-03-25 14:50:41,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 76 flow [2021-03-25 14:50:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:50:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:50:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 932 transitions. [2021-03-25 14:50:41,673 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8918660287081339 [2021-03-25 14:50:41,673 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 932 transitions. [2021-03-25 14:50:41,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 932 transitions. [2021-03-25 14:50:41,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:50:41,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 932 transitions. [2021-03-25 14:50:41,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.4) internal successors, (932), 5 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:41,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:41,677 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:41,677 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 5 states and 932 transitions. [2021-03-25 14:50:41,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 76 flow [2021-03-25 14:50:41,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:50:41,678 INFO L241 Difference]: Finished difference. Result has 37 places, 23 transitions, 60 flow [2021-03-25 14:50:41,678 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2021-03-25 14:50:41,679 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2021-03-25 14:50:41,679 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:50:41,679 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 60 flow [2021-03-25 14:50:41,679 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 60 flow [2021-03-25 14:50:41,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-25 14:50:41,682 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 14:50:41,682 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:50:41,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:50:41,682 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-25 14:50:41,976 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2021-03-25 14:50:42,088 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-03-25 14:50:42,326 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2021-03-25 14:50:42,440 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-03-25 14:50:43,279 WARN L205 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 161 [2021-03-25 14:50:43,546 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2021-03-25 14:50:44,099 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 161 [2021-03-25 14:50:44,387 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2021-03-25 14:50:44,391 INFO L154 LiptonReduction]: Checked pairs total: 639 [2021-03-25 14:50:44,391 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:50:44,392 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2713 [2021-03-25 14:50:44,392 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-03-25 14:50:44,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:44,393 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:50:44,393 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:50:44,393 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:50:44,393 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:50:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:50:44,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1433771831, now seen corresponding path program 1 times [2021-03-25 14:50:44,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:50:44,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114253503] [2021-03-25 14:50:44,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:50:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:50:44,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:44,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:50:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:50:44,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114253503] [2021-03-25 14:50:44,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:50:44,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:50:44,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086902647] [2021-03-25 14:50:44,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:50:44,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:50:44,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:50:44,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:50:44,467 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 212 [2021-03-25 14:50:44,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:44,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:50:44,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 212 [2021-03-25 14:50:44,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:50:44,476 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-25 14:50:44,476 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 14:50:44,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 20 events. 0/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 1/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:50:44,476 INFO L132 encePairwiseOnDemand]: 209/212 looper letters, 1 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2021-03-25 14:50:44,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 20 transitions, 60 flow [2021-03-25 14:50:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:50:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:50:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2021-03-25 14:50:44,478 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8977987421383647 [2021-03-25 14:50:44,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 571 transitions. [2021-03-25 14:50:44,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions. [2021-03-25 14:50:44,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:50:44,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions. [2021-03-25 14:50:44,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:44,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:44,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:44,481 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 571 transitions. [2021-03-25 14:50:44,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 20 transitions, 60 flow [2021-03-25 14:50:44,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 20 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:50:44,481 INFO L241 Difference]: Finished difference. Result has 31 places, 20 transitions, 58 flow [2021-03-25 14:50:44,481 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2021-03-25 14:50:44,482 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -23 predicate places. [2021-03-25 14:50:44,482 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:50:44,482 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 58 flow [2021-03-25 14:50:44,482 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 58 flow [2021-03-25 14:50:44,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 58 flow [2021-03-25 14:50:44,484 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-25 14:50:44,484 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:50:44,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 20 events. 0/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 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-25 14:50:44,485 INFO L142 LiptonReduction]: Number of co-enabled transitions 182 [2021-03-25 14:50:44,485 INFO L154 LiptonReduction]: Checked pairs total: 198 [2021-03-25 14:50:44,486 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:50:44,486 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4 [2021-03-25 14:50:44,486 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2021-03-25 14:50:44,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:44,487 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:50:44,487 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:50:44,487 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:50:44,487 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:50:44,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:50:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1122423442, now seen corresponding path program 1 times [2021-03-25 14:50:44,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:50:44,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396826629] [2021-03-25 14:50:44,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:50:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:50:44,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:44,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:50:44,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:44,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:50:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:50:44,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396826629] [2021-03-25 14:50:44,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:50:44,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:50:44,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310811380] [2021-03-25 14:50:44,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:50:44,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:50:44,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:50:44,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:50:44,553 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2021-03-25 14:50:44,553 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:44,553 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:50:44,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2021-03-25 14:50:44,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:50:44,574 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-25 14:50:44,574 INFO L130 PetriNetUnfolder]: For 11/13 co-relation queries the response was YES. [2021-03-25 14:50:44,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 26 events. 0/26 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 3/28 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 14:50:44,575 INFO L132 encePairwiseOnDemand]: 208/212 looper letters, 1 selfloop transitions, 3 changer transitions 1/21 dead transitions. [2021-03-25 14:50:44,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 21 transitions, 73 flow [2021-03-25 14:50:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:50:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:50:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 727 transitions. [2021-03-25 14:50:44,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8573113207547169 [2021-03-25 14:50:44,577 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 727 transitions. [2021-03-25 14:50:44,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 727 transitions. [2021-03-25 14:50:44,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:50:44,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 727 transitions. [2021-03-25 14:50:44,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:44,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:44,580 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:44,580 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 4 states and 727 transitions. [2021-03-25 14:50:44,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 21 transitions, 73 flow [2021-03-25 14:50:44,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 21 transitions, 67 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:50:44,581 INFO L241 Difference]: Finished difference. Result has 34 places, 20 transitions, 68 flow [2021-03-25 14:50:44,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, 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=68, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2021-03-25 14:50:44,581 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -20 predicate places. [2021-03-25 14:50:44,581 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:50:44,581 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 20 transitions, 68 flow [2021-03-25 14:50:44,581 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 20 transitions, 68 flow [2021-03-25 14:50:44,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 20 transitions, 68 flow [2021-03-25 14:50:44,585 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-25 14:50:44,585 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 14:50:44,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 20 events. 0/20 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 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-25 14:50:44,585 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-25 14:50:45,432 WARN L205 SmtUtils]: Spent 846.00 ms on a formula simplification that was a NOOP. DAG size: 362 [2021-03-25 14:50:46,233 WARN L205 SmtUtils]: Spent 798.00 ms on a formula simplification that was a NOOP. DAG size: 362 [2021-03-25 14:50:47,895 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 527 [2021-03-25 14:50:49,632 WARN L205 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 527 [2021-03-25 14:50:49,745 INFO L154 LiptonReduction]: Checked pairs total: 304 [2021-03-25 14:50:49,745 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:50:49,745 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5164 [2021-03-25 14:50:49,746 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 66 flow [2021-03-25 14:50:49,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:49,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:50:49,747 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:50:49,747 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:50:49,747 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:50:49,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:50:49,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1320980210, now seen corresponding path program 1 times [2021-03-25 14:50:49,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:50:49,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129386349] [2021-03-25 14:50:49,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:50:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:50:49,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:49,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:50:49,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:49,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:50:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:50:49,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129386349] [2021-03-25 14:50:49,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:50:49,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:50:49,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378662915] [2021-03-25 14:50:49,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:50:49,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:50:49,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:50:49,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:50:49,790 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 213 [2021-03-25 14:50:49,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:49,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:50:49,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 213 [2021-03-25 14:50:49,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:50:49,806 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-25 14:50:49,806 INFO L130 PetriNetUnfolder]: For 29/31 co-relation queries the response was YES. [2021-03-25 14:50:49,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 25 events. 0/25 cut-off events. For 29/31 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 2/26 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 14:50:49,806 INFO L132 encePairwiseOnDemand]: 209/213 looper letters, 1 selfloop transitions, 3 changer transitions 1/20 dead transitions. [2021-03-25 14:50:49,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 20 transitions, 79 flow [2021-03-25 14:50:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:50:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:50:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 743 transitions. [2021-03-25 14:50:49,808 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8720657276995305 [2021-03-25 14:50:49,808 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 743 transitions. [2021-03-25 14:50:49,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 743 transitions. [2021-03-25 14:50:49,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:50:49,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 743 transitions. [2021-03-25 14:50:49,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:49,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:49,811 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:49,811 INFO L185 Difference]: Start difference. First operand has 33 places, 19 transitions, 66 flow. Second operand 4 states and 743 transitions. [2021-03-25 14:50:49,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 20 transitions, 79 flow [2021-03-25 14:50:49,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 20 transitions, 65 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-03-25 14:50:49,812 INFO L241 Difference]: Finished difference. Result has 33 places, 19 transitions, 66 flow [2021-03-25 14:50:49,812 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2021-03-25 14:50:49,812 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -21 predicate places. [2021-03-25 14:50:49,812 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:50:49,812 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 19 transitions, 66 flow [2021-03-25 14:50:49,813 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 19 transitions, 66 flow [2021-03-25 14:50:49,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 19 transitions, 66 flow [2021-03-25 14:50:49,815 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-25 14:50:49,815 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 14:50:49,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 19 events. 0/19 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:50:49,815 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-25 14:50:52,323 INFO L154 LiptonReduction]: Checked pairs total: 187 [2021-03-25 14:50:52,323 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:50:52,323 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2511 [2021-03-25 14:50:52,324 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 64 flow [2021-03-25 14:50:52,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:52,324 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:50:52,324 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:50:52,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:50:52,324 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:50:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:50:52,325 INFO L82 PathProgramCache]: Analyzing trace with hash -734413213, now seen corresponding path program 1 times [2021-03-25 14:50:52,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:50:52,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963723229] [2021-03-25 14:50:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:50:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:50:52,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:52,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 14:50:52,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:52,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 14:50:52,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:52,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:50:52,453 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.5 percent of original size [2021-03-25 14:50:52,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:50:52,467 INFO L142 QuantifierPusher]: treesize reduction 2, result has 88.9 percent of original size [2021-03-25 14:50:52,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:50:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:50:52,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963723229] [2021-03-25 14:50:52,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:50:52,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:50:52,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483820479] [2021-03-25 14:50:52,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:50:52,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:50:52,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:50:52,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:50:52,479 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 214 [2021-03-25 14:50:52,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 64 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:52,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:50:52,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 214 [2021-03-25 14:50:52,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:50:52,602 INFO L129 PetriNetUnfolder]: 16/56 cut-off events. [2021-03-25 14:50:52,602 INFO L130 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2021-03-25 14:50:52,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 56 events. 16/56 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 156 event pairs, 0 based on Foata normal form. 3/57 useless extension candidates. Maximal degree in co-relation 126. Up to 26 conditions per place. [2021-03-25 14:50:52,603 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 9 selfloop transitions, 6 changer transitions 0/24 dead transitions. [2021-03-25 14:50:52,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 24 transitions, 106 flow [2021-03-25 14:50:52,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:50:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:50:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2021-03-25 14:50:52,609 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5766355140186916 [2021-03-25 14:50:52,609 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2021-03-25 14:50:52,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2021-03-25 14:50:52,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:50:52,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2021-03-25 14:50:52,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:52,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:52,612 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:52,612 INFO L185 Difference]: Start difference. First operand has 32 places, 18 transitions, 64 flow. Second operand 5 states and 617 transitions. [2021-03-25 14:50:52,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 24 transitions, 106 flow [2021-03-25 14:50:52,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 24 transitions, 88 flow, removed 3 selfloop flow, removed 6 redundant places. [2021-03-25 14:50:52,613 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 80 flow [2021-03-25 14:50:52,613 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2021-03-25 14:50:52,613 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -22 predicate places. [2021-03-25 14:50:52,613 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:50:52,613 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 80 flow [2021-03-25 14:50:52,613 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 80 flow [2021-03-25 14:50:52,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 80 flow [2021-03-25 14:50:52,620 INFO L129 PetriNetUnfolder]: 15/53 cut-off events. [2021-03-25 14:50:52,620 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-25 14:50:52,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 53 events. 15/53 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 10 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 111. Up to 30 conditions per place. [2021-03-25 14:50:52,621 INFO L142 LiptonReduction]: Number of co-enabled transitions 78 [2021-03-25 14:50:52,847 INFO L154 LiptonReduction]: Checked pairs total: 61 [2021-03-25 14:50:52,847 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:50:52,848 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 235 [2021-03-25 14:50:52,848 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 78 flow [2021-03-25 14:50:52,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:52,848 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:50:52,849 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:50:52,849 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:50:52,849 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:50:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:50:52,849 INFO L82 PathProgramCache]: Analyzing trace with hash 966897415, now seen corresponding path program 1 times [2021-03-25 14:50:52,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:50:52,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087765846] [2021-03-25 14:50:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:50:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:50:52,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:52,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:50:52,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:52,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 14:50:53,003 INFO L142 QuantifierPusher]: treesize reduction 16, result has 48.4 percent of original size [2021-03-25 14:50:53,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:50:53,012 INFO L142 QuantifierPusher]: treesize reduction 22, result has 56.9 percent of original size [2021-03-25 14:50:53,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:50:53,033 INFO L142 QuantifierPusher]: treesize reduction 22, result has 59.3 percent of original size [2021-03-25 14:50:53,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 14:50:53,059 INFO L142 QuantifierPusher]: treesize reduction 8, result has 71.4 percent of original size [2021-03-25 14:50:53,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 14:50:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:50:53,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087765846] [2021-03-25 14:50:53,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:50:53,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:50:53,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8281544] [2021-03-25 14:50:53,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:50:53,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:50:53,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:50:53,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:50:53,077 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 215 [2021-03-25 14:50:53,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 78 flow. Second operand has 8 states, 8 states have (on average 127.875) internal successors, (1023), 8 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:53,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:50:53,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 215 [2021-03-25 14:50:53,078 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:50:53,194 INFO L129 PetriNetUnfolder]: 14/47 cut-off events. [2021-03-25 14:50:53,194 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-03-25 14:50:53,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 47 events. 14/47 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 114 event pairs, 1 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 141. Up to 31 conditions per place. [2021-03-25 14:50:53,195 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 12 selfloop transitions, 10 changer transitions 0/30 dead transitions. [2021-03-25 14:50:53,195 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 170 flow [2021-03-25 14:50:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:50:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:50:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2021-03-25 14:50:53,196 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6074418604651163 [2021-03-25 14:50:53,196 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2021-03-25 14:50:53,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2021-03-25 14:50:53,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:50:53,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2021-03-25 14:50:53,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:53,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:53,199 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:53,199 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 78 flow. Second operand 5 states and 653 transitions. [2021-03-25 14:50:53,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 170 flow [2021-03-25 14:50:53,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 150 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-25 14:50:53,200 INFO L241 Difference]: Finished difference. Result has 34 places, 29 transitions, 150 flow [2021-03-25 14:50:53,200 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2021-03-25 14:50:53,201 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -20 predicate places. [2021-03-25 14:50:53,201 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:50:53,201 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 29 transitions, 150 flow [2021-03-25 14:50:53,201 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 29 transitions, 150 flow [2021-03-25 14:50:53,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 150 flow [2021-03-25 14:50:53,206 INFO L129 PetriNetUnfolder]: 14/47 cut-off events. [2021-03-25 14:50:53,206 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-25 14:50:53,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 47 events. 14/47 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 120 event pairs, 2 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 129. Up to 28 conditions per place. [2021-03-25 14:50:53,207 INFO L142 LiptonReduction]: Number of co-enabled transitions 90 [2021-03-25 14:50:53,330 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-03-25 14:50:53,465 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-03-25 14:50:53,689 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-25 14:50:53,922 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-25 14:50:54,059 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 77 [2021-03-25 14:50:54,331 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 96 [2021-03-25 14:50:58,254 WARN L205 SmtUtils]: Spent 3.87 s on a formula simplification. DAG size of input: 436 DAG size of output: 411 [2021-03-25 14:50:59,354 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 398 [2021-03-25 14:51:07,642 WARN L205 SmtUtils]: Spent 8.28 s on a formula simplification. DAG size of input: 625 DAG size of output: 599 [2021-03-25 14:51:10,370 WARN L205 SmtUtils]: Spent 2.72 s on a formula simplification that was a NOOP. DAG size: 585 [2021-03-25 14:51:10,376 INFO L154 LiptonReduction]: Checked pairs total: 180 [2021-03-25 14:51:10,376 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:51:10,376 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17175 [2021-03-25 14:51:10,376 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 160 flow [2021-03-25 14:51:10,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 127.875) internal successors, (1023), 8 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:10,377 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:51:10,377 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:51:10,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:51:10,377 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:51:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:51:10,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1342035672, now seen corresponding path program 1 times [2021-03-25 14:51:10,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:51:10,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203857341] [2021-03-25 14:51:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:51:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:51:10,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:10,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 14:51:10,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:10,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:51:10,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:10,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 14:51:10,598 INFO L142 QuantifierPusher]: treesize reduction 14, result has 78.1 percent of original size [2021-03-25 14:51:10,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 14:51:10,640 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.5 percent of original size [2021-03-25 14:51:10,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:51:10,661 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.5 percent of original size [2021-03-25 14:51:10,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:51:10,684 INFO L142 QuantifierPusher]: treesize reduction 2, result has 88.9 percent of original size [2021-03-25 14:51:10,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:51:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:51:10,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203857341] [2021-03-25 14:51:10,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:51:10,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 14:51:10,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648356460] [2021-03-25 14:51:10,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 14:51:10,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:51:10,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 14:51:10,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-03-25 14:51:10,702 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 218 [2021-03-25 14:51:10,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 160 flow. Second operand has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:10,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:51:10,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 218 [2021-03-25 14:51:10,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:51:10,892 INFO L129 PetriNetUnfolder]: 13/49 cut-off events. [2021-03-25 14:51:10,893 INFO L130 PetriNetUnfolder]: For 34/35 co-relation queries the response was YES. [2021-03-25 14:51:10,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 49 events. 13/49 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 2 based on Foata normal form. 2/50 useless extension candidates. Maximal degree in co-relation 167. Up to 28 conditions per place. [2021-03-25 14:51:10,894 INFO L132 encePairwiseOnDemand]: 210/218 looper letters, 10 selfloop transitions, 12 changer transitions 0/30 dead transitions. [2021-03-25 14:51:10,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 206 flow [2021-03-25 14:51:10,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:51:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:51:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2021-03-25 14:51:10,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5614678899082569 [2021-03-25 14:51:10,906 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2021-03-25 14:51:10,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2021-03-25 14:51:10,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:51:10,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2021-03-25 14:51:10,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:10,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:10,909 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:10,910 INFO L185 Difference]: Start difference. First operand has 34 places, 29 transitions, 160 flow. Second operand 5 states and 612 transitions. [2021-03-25 14:51:10,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 206 flow [2021-03-25 14:51:10,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 190 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-25 14:51:10,913 INFO L241 Difference]: Finished difference. Result has 37 places, 28 transitions, 170 flow [2021-03-25 14:51:10,913 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2021-03-25 14:51:10,913 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -17 predicate places. [2021-03-25 14:51:10,913 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:51:10,913 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 170 flow [2021-03-25 14:51:10,914 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 170 flow [2021-03-25 14:51:10,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 170 flow [2021-03-25 14:51:10,920 INFO L129 PetriNetUnfolder]: 13/47 cut-off events. [2021-03-25 14:51:10,920 INFO L130 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2021-03-25 14:51:10,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 47 events. 13/47 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 1 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 153. Up to 25 conditions per place. [2021-03-25 14:51:10,921 INFO L142 LiptonReduction]: Number of co-enabled transitions 90 [2021-03-25 14:51:10,923 INFO L154 LiptonReduction]: Checked pairs total: 123 [2021-03-25 14:51:10,923 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:51:10,923 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 14:51:10,924 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 170 flow [2021-03-25 14:51:10,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:10,924 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:51:10,924 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:51:10,924 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:51:10,924 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:51:10,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:51:10,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1213473619, now seen corresponding path program 1 times [2021-03-25 14:51:10,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:51:10,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130646908] [2021-03-25 14:51:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:51:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:51:11,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:11,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:11,018 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:51:11,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:51:11,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:11,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:51:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:51:11,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130646908] [2021-03-25 14:51:11,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:51:11,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:51:11,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039629351] [2021-03-25 14:51:11,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:51:11,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:51:11,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:51:11,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:51:11,029 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 218 [2021-03-25 14:51:11,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:51:11,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 218 [2021-03-25 14:51:11,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:51:11,086 INFO L129 PetriNetUnfolder]: 67/155 cut-off events. [2021-03-25 14:51:11,086 INFO L130 PetriNetUnfolder]: For 188/229 co-relation queries the response was YES. [2021-03-25 14:51:11,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 155 events. 67/155 cut-off events. For 188/229 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 674 event pairs, 20 based on Foata normal form. 34/181 useless extension candidates. Maximal degree in co-relation 463. Up to 81 conditions per place. [2021-03-25 14:51:11,087 INFO L132 encePairwiseOnDemand]: 212/218 looper letters, 10 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2021-03-25 14:51:11,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 226 flow [2021-03-25 14:51:11,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:51:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:51:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 943 transitions. [2021-03-25 14:51:11,090 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.865137614678899 [2021-03-25 14:51:11,090 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 943 transitions. [2021-03-25 14:51:11,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 943 transitions. [2021-03-25 14:51:11,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:51:11,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 943 transitions. [2021-03-25 14:51:11,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 188.6) internal successors, (943), 5 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,093 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,093 INFO L185 Difference]: Start difference. First operand has 37 places, 28 transitions, 170 flow. Second operand 5 states and 943 transitions. [2021-03-25 14:51:11,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 226 flow [2021-03-25 14:51:11,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 206 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 14:51:11,095 INFO L241 Difference]: Finished difference. Result has 41 places, 35 transitions, 218 flow [2021-03-25 14:51:11,096 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2021-03-25 14:51:11,096 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2021-03-25 14:51:11,096 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:51:11,096 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 35 transitions, 218 flow [2021-03-25 14:51:11,096 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 218 flow [2021-03-25 14:51:11,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 218 flow [2021-03-25 14:51:11,110 INFO L129 PetriNetUnfolder]: 64/153 cut-off events. [2021-03-25 14:51:11,110 INFO L130 PetriNetUnfolder]: For 219/242 co-relation queries the response was YES. [2021-03-25 14:51:11,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 153 events. 64/153 cut-off events. For 219/242 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 662 event pairs, 16 based on Foata normal form. 6/154 useless extension candidates. Maximal degree in co-relation 510. Up to 84 conditions per place. [2021-03-25 14:51:11,111 INFO L142 LiptonReduction]: Number of co-enabled transitions 112 [2021-03-25 14:51:11,113 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:51:11,113 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:51:11,113 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-25 14:51:11,114 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 218 flow [2021-03-25 14:51:11,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,114 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:51:11,115 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:51:11,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:51:11,115 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:51:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:51:11,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1036340236, now seen corresponding path program 1 times [2021-03-25 14:51:11,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:51:11,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523306882] [2021-03-25 14:51:11,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:51:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:51:11,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:11,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:11,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:11,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:11,170 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:51:11,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:51:11,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:11,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:51:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:51:11,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523306882] [2021-03-25 14:51:11,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:51:11,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:51:11,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790024930] [2021-03-25 14:51:11,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:51:11,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:51:11,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:51:11,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:51:11,182 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 218 [2021-03-25 14:51:11,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:51:11,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 218 [2021-03-25 14:51:11,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:51:11,258 INFO L129 PetriNetUnfolder]: 35/107 cut-off events. [2021-03-25 14:51:11,258 INFO L130 PetriNetUnfolder]: For 277/363 co-relation queries the response was YES. [2021-03-25 14:51:11,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 107 events. 35/107 cut-off events. For 277/363 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 459 event pairs, 4 based on Foata normal form. 61/165 useless extension candidates. Maximal degree in co-relation 407. Up to 65 conditions per place. [2021-03-25 14:51:11,259 INFO L132 encePairwiseOnDemand]: 212/218 looper letters, 6 selfloop transitions, 13 changer transitions 5/41 dead transitions. [2021-03-25 14:51:11,259 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 289 flow [2021-03-25 14:51:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:51:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:51:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1320 transitions. [2021-03-25 14:51:11,263 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8650065530799476 [2021-03-25 14:51:11,263 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1320 transitions. [2021-03-25 14:51:11,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1320 transitions. [2021-03-25 14:51:11,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:51:11,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1320 transitions. [2021-03-25 14:51:11,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 188.57142857142858) internal successors, (1320), 7 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,268 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,268 INFO L185 Difference]: Start difference. First operand has 41 places, 35 transitions, 218 flow. Second operand 7 states and 1320 transitions. [2021-03-25 14:51:11,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 289 flow [2021-03-25 14:51:11,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 283 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 14:51:11,270 INFO L241 Difference]: Finished difference. Result has 49 places, 36 transitions, 263 flow [2021-03-25 14:51:11,271 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2021-03-25 14:51:11,271 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2021-03-25 14:51:11,271 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:51:11,271 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 263 flow [2021-03-25 14:51:11,272 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 263 flow [2021-03-25 14:51:11,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 263 flow [2021-03-25 14:51:11,280 INFO L129 PetriNetUnfolder]: 27/97 cut-off events. [2021-03-25 14:51:11,280 INFO L130 PetriNetUnfolder]: For 318/342 co-relation queries the response was YES. [2021-03-25 14:51:11,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 97 events. 27/97 cut-off events. For 318/342 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 420 event pairs, 4 based on Foata normal form. 6/101 useless extension candidates. Maximal degree in co-relation 403. Up to 56 conditions per place. [2021-03-25 14:51:11,281 INFO L142 LiptonReduction]: Number of co-enabled transitions 126 [2021-03-25 14:51:11,282 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:51:11,282 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:51:11,283 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-25 14:51:11,283 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 263 flow [2021-03-25 14:51:11,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,283 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:51:11,283 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:51:11,284 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:51:11,284 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:51:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:51:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2060973841, now seen corresponding path program 1 times [2021-03-25 14:51:11,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:51:11,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466406608] [2021-03-25 14:51:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:51:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:51:11,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:11,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:11,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:11,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:11,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:11,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:11,351 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:51:11,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:51:11,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:11,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:51:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:51:11,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466406608] [2021-03-25 14:51:11,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:51:11,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:51:11,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299755875] [2021-03-25 14:51:11,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:51:11,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:51:11,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:51:11,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:51:11,364 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 218 [2021-03-25 14:51:11,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:51:11,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 218 [2021-03-25 14:51:11,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:51:11,464 INFO L129 PetriNetUnfolder]: 17/75 cut-off events. [2021-03-25 14:51:11,464 INFO L130 PetriNetUnfolder]: For 400/482 co-relation queries the response was YES. [2021-03-25 14:51:11,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 75 events. 17/75 cut-off events. For 400/482 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 310 event pairs, 0 based on Foata normal form. 58/131 useless extension candidates. Maximal degree in co-relation 355. Up to 52 conditions per place. [2021-03-25 14:51:11,465 INFO L132 encePairwiseOnDemand]: 212/218 looper letters, 2 selfloop transitions, 17 changer transitions 3/38 dead transitions. [2021-03-25 14:51:11,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 38 transitions, 321 flow [2021-03-25 14:51:11,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:51:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:51:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1689 transitions. [2021-03-25 14:51:11,468 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8608562691131498 [2021-03-25 14:51:11,468 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1689 transitions. [2021-03-25 14:51:11,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1689 transitions. [2021-03-25 14:51:11,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:51:11,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1689 transitions. [2021-03-25 14:51:11,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 187.66666666666666) internal successors, (1689), 9 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,473 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 218.0) internal successors, (2180), 10 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:11,473 INFO L185 Difference]: Start difference. First operand has 49 places, 36 transitions, 263 flow. Second operand 9 states and 1689 transitions. [2021-03-25 14:51:11,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 38 transitions, 321 flow [2021-03-25 14:51:11,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 38 transitions, 271 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-03-25 14:51:11,475 INFO L241 Difference]: Finished difference. Result has 55 places, 35 transitions, 251 flow [2021-03-25 14:51:11,475 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=251, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2021-03-25 14:51:11,475 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2021-03-25 14:51:11,475 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:51:11,475 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 35 transitions, 251 flow [2021-03-25 14:51:11,475 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 35 transitions, 251 flow [2021-03-25 14:51:11,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 35 transitions, 251 flow [2021-03-25 14:51:11,481 INFO L129 PetriNetUnfolder]: 15/70 cut-off events. [2021-03-25 14:51:11,481 INFO L130 PetriNetUnfolder]: For 202/208 co-relation queries the response was YES. [2021-03-25 14:51:11,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 70 events. 15/70 cut-off events. For 202/208 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 291 event pairs, 0 based on Foata normal form. 3/71 useless extension candidates. Maximal degree in co-relation 270. Up to 24 conditions per place. [2021-03-25 14:51:11,482 INFO L142 LiptonReduction]: Number of co-enabled transitions 120 [2021-03-25 14:51:11,664 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-03-25 14:51:11,869 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-03-25 14:51:12,183 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-25 14:51:12,488 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-25 14:51:12,680 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2021-03-25 14:51:12,873 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2021-03-25 14:51:13,248 WARN L205 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2021-03-25 14:51:13,598 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2021-03-25 14:51:13,612 INFO L154 LiptonReduction]: Checked pairs total: 22 [2021-03-25 14:51:13,612 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:51:13,613 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2138 [2021-03-25 14:51:13,613 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 221 flow [2021-03-25 14:51:13,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 185.83333333333334) internal successors, (1115), 6 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:13,613 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:51:13,613 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:51:13,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:51:13,613 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:51:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:51:13,614 INFO L82 PathProgramCache]: Analyzing trace with hash -773108563, now seen corresponding path program 1 times [2021-03-25 14:51:13,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:51:13,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573580288] [2021-03-25 14:51:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:51:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:51:13,667 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:51:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:51:13,715 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:51:13,750 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:51:13,751 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:51:13,751 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:51:13,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:51:13 BasicIcfg [2021-03-25 14:51:13,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:51:13,826 INFO L168 Benchmark]: Toolchain (without parser) took 50103.81 ms. Allocated memory was 255.9 MB in the beginning and 578.8 MB in the end (delta: 323.0 MB). Free memory was 235.3 MB in the beginning and 268.2 MB in the end (delta: -32.9 MB). Peak memory consumption was 288.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:51:13,826 INFO L168 Benchmark]: CDTParser took 0.08 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:51:13,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.54 ms. Allocated memory was 255.9 MB in the beginning and 331.4 MB in the end (delta: 75.5 MB). Free memory was 235.3 MB in the beginning and 290.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:51:13,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.07 ms. Allocated memory is still 331.4 MB. Free memory was 290.3 MB in the beginning and 287.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:51:13,827 INFO L168 Benchmark]: Boogie Preprocessor took 22.34 ms. Allocated memory is still 331.4 MB. Free memory was 287.7 MB in the beginning and 285.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:51:13,827 INFO L168 Benchmark]: RCFGBuilder took 1762.16 ms. Allocated memory was 331.4 MB in the beginning and 398.5 MB in the end (delta: 67.1 MB). Free memory was 285.3 MB in the beginning and 335.2 MB in the end (delta: -49.9 MB). Peak memory consumption was 92.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:51:13,827 INFO L168 Benchmark]: TraceAbstraction took 47847.31 ms. Allocated memory was 398.5 MB in the beginning and 578.8 MB in the end (delta: 180.4 MB). Free memory was 334.2 MB in the beginning and 268.2 MB in the end (delta: 66.0 MB). Peak memory consumption was 245.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:51:13,828 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.08 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 421.54 ms. Allocated memory was 255.9 MB in the beginning and 331.4 MB in the end (delta: 75.5 MB). Free memory was 235.3 MB in the beginning and 290.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.07 ms. Allocated memory is still 331.4 MB. Free memory was 290.3 MB in the beginning and 287.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 22.34 ms. Allocated memory is still 331.4 MB. Free memory was 287.7 MB in the beginning and 285.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1762.16 ms. Allocated memory was 331.4 MB in the beginning and 398.5 MB in the end (delta: 67.1 MB). Free memory was 285.3 MB in the beginning and 335.2 MB in the end (delta: -49.9 MB). Peak memory consumption was 92.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 47847.31 ms. Allocated memory was 398.5 MB in the beginning and 578.8 MB in the end (delta: 180.4 MB). Free memory was 334.2 MB in the beginning and 268.2 MB in the end (delta: 66.0 MB). Peak memory consumption was 245.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12499.5ms, 121 PlacesBefore, 54 PlacesAfterwards, 113 TransitionsBefore, 45 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 4 FixpointIterations, 39 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 2738 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1350, positive: 1276, positive conditional: 0, positive unconditional: 1276, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 987, positive: 952, positive conditional: 0, positive unconditional: 952, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 987, positive: 952, positive conditional: 0, positive unconditional: 952, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 987, positive: 949, positive conditional: 0, positive unconditional: 949, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1140, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1134, negative conditional: 0, negative unconditional: 1134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1350, positive: 324, positive conditional: 0, positive unconditional: 324, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 987, unknown conditional: 0, unknown unconditional: 987] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2624.6ms, 51 PlacesBefore, 34 PlacesAfterwards, 42 TransitionsBefore, 25 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 4 FixpointIterations, 13 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 1317 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 385, positive: 294, positive conditional: 0, positive unconditional: 294, negative: 91, negative conditional: 0, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 90, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 90, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 675, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 670, negative conditional: 0, negative unconditional: 670, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 385, positive: 229, positive conditional: 0, positive unconditional: 229, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 90, unknown conditional: 0, unknown unconditional: 90] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2712.5ms, 37 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 639 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 215, positive: 161, positive conditional: 0, positive unconditional: 161, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 215, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6ms, 31 PlacesBefore, 31 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 198 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5163.8ms, 34 PlacesBefore, 33 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 304 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 101, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 108, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 108, negative conditional: 0, negative unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2510.6ms, 33 PlacesBefore, 32 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 187 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 2485, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2485, unknown conditional: 0, unknown unconditional: 2485] ], Cache Queries: [ total: 60, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 234.1ms, 32 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 61 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17174.9ms, 34 PlacesBefore, 34 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 180 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 135, positive: 118, positive conditional: 0, positive unconditional: 118, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 135, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.5ms, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.7ms, 41 PlacesBefore, 41 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.9ms, 49 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2136.9ms, 55 PlacesBefore, 52 PlacesAfterwards, 35 TransitionsBefore, 30 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 22 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1940; [L851] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={5: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, z=0] [L852] 0 pthread_t t1941; [L853] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={5: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, z=0] [L854] 0 pthread_t t1942; [L855] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={5: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, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L812] EXPR 3 !y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))) [L812] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L813] EXPR 3 !y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))) [L813] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L814] EXPR 3 !y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0))) [L814] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L814] 3 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_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L815] EXPR 3 !y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))) [L815] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L815] 3 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_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] EXPR 3 !y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))) [L816] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] EXPR 3 !y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))) [L817] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 \read(y) [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 [L825] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y={5: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, z=1] [L762] 1 __unbuffered_p0_EAX = z [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=1, weak$$choice2=0, x=1, y={5: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, z=1] [L777] 2 __unbuffered_p1_EAX = x [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L828] 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) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] 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) [L828] 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) [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L830] 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 [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L832] 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 [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L861] 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) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] 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) [L861] 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) [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L863] 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 [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L865] 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 [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=1, weak$$choice2=0, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 47670.3ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 943.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12551.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 32 SDtfs, 16 SDslu, 16 SDs, 0 SdLazy, 269 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 329.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 563.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=10, InterpolantAutomatonStates: 55, 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: 36.5ms SsaConstructionTime, 427.6ms SatisfiabilityAnalysisTime, 841.1ms InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 1259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...