/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-29 00:24:18,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-29 00:24:18,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-29 00:24:18,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-29 00:24:18,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-29 00:24:18,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-29 00:24:18,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-29 00:24:18,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-29 00:24:18,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-29 00:24:18,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-29 00:24:18,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-29 00:24:18,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-29 00:24:18,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-29 00:24:18,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-29 00:24:18,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-29 00:24:18,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-29 00:24:18,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-29 00:24:18,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-29 00:24:18,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-29 00:24:18,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-29 00:24:18,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-29 00:24:18,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-29 00:24:18,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-29 00:24:18,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-29 00:24:18,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-29 00:24:18,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-29 00:24:18,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-29 00:24:18,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-29 00:24:18,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-29 00:24:18,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-29 00:24:18,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-29 00:24:18,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-29 00:24:18,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-29 00:24:18,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-29 00:24:18,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-29 00:24:18,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-29 00:24:18,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-29 00:24:18,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-29 00:24:18,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-29 00:24:18,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-29 00:24:18,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-29 00:24:18,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-04-29 00:24:18,776 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-29 00:24:18,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-29 00:24:18,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-29 00:24:18,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-29 00:24:18,781 INFO L138 SettingsManager]: * Use SBE=true [2021-04-29 00:24:18,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-29 00:24:18,783 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-29 00:24:18,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-29 00:24:18,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-29 00:24:18,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-29 00:24:18,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-29 00:24:18,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-29 00:24:18,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-29 00:24:18,786 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-29 00:24:18,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-29 00:24:18,786 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-29 00:24:18,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-29 00:24:18,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-29 00:24:18,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-29 00:24:18,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-29 00:24:18,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-29 00:24:18,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 00:24:18,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-29 00:24:18,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-29 00:24:18,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-29 00:24:18,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-29 00:24:18,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-29 00:24:18,789 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-29 00:24:18,790 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-29 00:24:18,790 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-29 00:24:18,790 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-04-29 00:24:19,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-29 00:24:19,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-29 00:24:19,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-29 00:24:19,289 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-29 00:24:19,290 INFO L275 PluginConnector]: CDTParser initialized [2021-04-29 00:24:19,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i [2021-04-29 00:24:19,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/833be93f9/ac7c174b7d7844d4b42da37eee38b8ac/FLAGddd3b2b31 [2021-04-29 00:24:20,126 INFO L306 CDTParser]: Found 1 translation units. [2021-04-29 00:24:20,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i [2021-04-29 00:24:20,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/833be93f9/ac7c174b7d7844d4b42da37eee38b8ac/FLAGddd3b2b31 [2021-04-29 00:24:20,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/833be93f9/ac7c174b7d7844d4b42da37eee38b8ac [2021-04-29 00:24:20,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-29 00:24:20,406 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-29 00:24:20,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-29 00:24:20,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-29 00:24:20,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-29 00:24:20,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:24:20" (1/1) ... [2021-04-29 00:24:20,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b3da73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:20, skipping insertion in model container [2021-04-29 00:24:20,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:24:20" (1/1) ... [2021-04-29 00:24:20,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-29 00:24:20,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-29 00:24:20,688 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i[993,1006] [2021-04-29 00:24:20,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:24:20,917 INFO L203 MainTranslator]: Completed pre-run [2021-04-29 00:24:20,933 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_pso.oepc.i[993,1006] [2021-04-29 00:24:20,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:24:21,152 INFO L208 MainTranslator]: Completed translation [2021-04-29 00:24:21,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:21 WrapperNode [2021-04-29 00:24:21,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-29 00:24:21,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-29 00:24:21,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-29 00:24:21,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-29 00:24:21,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:21" (1/1) ... [2021-04-29 00:24:21,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:21" (1/1) ... [2021-04-29 00:24:21,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-29 00:24:21,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-29 00:24:21,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-29 00:24:21,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-29 00:24:21,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:21" (1/1) ... [2021-04-29 00:24:21,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:21" (1/1) ... [2021-04-29 00:24:21,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:21" (1/1) ... [2021-04-29 00:24:21,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:21" (1/1) ... [2021-04-29 00:24:21,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:21" (1/1) ... [2021-04-29 00:24:21,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:21" (1/1) ... [2021-04-29 00:24:21,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:21" (1/1) ... [2021-04-29 00:24:21,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-29 00:24:21,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-29 00:24:21,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-29 00:24:21,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-29 00:24:21,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:21" (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-04-29 00:24:21,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-29 00:24:21,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-29 00:24:21,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-29 00:24:21,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-29 00:24:21,425 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-29 00:24:21,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-29 00:24:21,425 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-29 00:24:21,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-29 00:24:21,425 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-29 00:24:21,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-29 00:24:21,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-29 00:24:21,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-29 00:24:21,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-29 00:24:21,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-29 00:24:21,428 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-29 00:24:23,730 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-29 00:24:23,730 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-29 00:24:23,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:24:23 BoogieIcfgContainer [2021-04-29 00:24:23,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-29 00:24:23,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-29 00:24:23,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-29 00:24:23,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-29 00:24:23,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 12:24:20" (1/3) ... [2021-04-29 00:24:23,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a22103d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:24:23, skipping insertion in model container [2021-04-29 00:24:23,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:24:21" (2/3) ... [2021-04-29 00:24:23,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a22103d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:24:23, skipping insertion in model container [2021-04-29 00:24:23,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:24:23" (3/3) ... [2021-04-29 00:24:23,744 INFO L111 eAbstractionObserver]: Analyzing ICFG safe024_pso.oepc.i [2021-04-29 00:24:23,752 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-29 00:24:23,762 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-29 00:24:23,763 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-29 00:24:23,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,818 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,818 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,819 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,819 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,824 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,846 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,846 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,847 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,849 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,868 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,868 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,869 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,869 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,879 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,881 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,890 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,890 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,900 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,900 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:24:23,903 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-29 00:24:23,928 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-29 00:24:23,976 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-29 00:24:23,976 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-29 00:24:23,976 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-29 00:24:23,977 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-29 00:24:23,977 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-29 00:24:23,977 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-29 00:24:23,977 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-29 00:24:23,977 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-29 00:24:23,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-04-29 00:24:24,073 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-04-29 00:24:24,074 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:24:24,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-04-29 00:24:24,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-04-29 00:24:24,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-04-29 00:24:24,096 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:24:24,118 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-04-29 00:24:24,122 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-04-29 00:24:24,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-04-29 00:24:24,171 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-04-29 00:24:24,172 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:24:24,173 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-04-29 00:24:24,179 INFO L146 LiptonReduction]: Number of co-enabled transitions 1586 [2021-04-29 00:24:27,030 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-04-29 00:24:27,147 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:24:27,743 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-04-29 00:24:27,974 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-29 00:24:29,585 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-29 00:24:29,800 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-29 00:24:41,968 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:24:42,368 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:24:42,481 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:24:42,592 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:24:42,704 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:24:42,911 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:24:43,015 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:24:43,121 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:24:43,382 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:24:44,205 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:24:44,317 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:24:44,434 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:24:44,546 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:24:44,655 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:24:44,765 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:24:44,875 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:24:44,985 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:24:45,422 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:24:45,718 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:24:45,920 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:24:46,054 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:24:48,519 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-29 00:24:48,670 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-29 00:24:48,820 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-29 00:24:48,970 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-29 00:24:50,567 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-04-29 00:24:50,693 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-04-29 00:24:50,822 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-04-29 00:24:50,949 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2021-04-29 00:24:51,293 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:24:52,721 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:24:52,831 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:24:52,941 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:24:53,055 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:24:53,578 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:24:53,718 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:24:53,853 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:24:53,983 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:24:54,105 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:24:54,257 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:24:54,379 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:24:54,506 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:24:55,013 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:24:55,168 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:24:55,320 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:24:55,471 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:24:55,620 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:24:55,782 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:24:55,934 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:24:56,088 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:24:56,561 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-04-29 00:24:56,783 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-04-29 00:24:57,315 WARN L205 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-04-29 00:24:57,547 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-04-29 00:24:57,719 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:24:57,893 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:24:58,075 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:24:58,246 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:24:58,418 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:24:58,590 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:24:58,762 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:24:58,931 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:24:59,121 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:24:59,316 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:24:59,504 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:24:59,703 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:24:59,857 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:25:00,017 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:25:00,181 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:25:00,365 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:25:00,539 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:25:00,712 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:25:00,891 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:25:01,061 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:25:01,232 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:25:01,403 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:25:01,560 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:25:01,709 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:25:01,878 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:25:02,044 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:25:02,221 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:25:02,396 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:25:02,586 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:25:02,774 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:25:02,959 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:25:03,146 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:25:03,345 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:25:03,537 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:25:03,737 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:25:03,934 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:25:04,129 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:25:04,338 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:25:04,537 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:25:04,735 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:25:04,918 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:25:05,101 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:25:05,282 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:25:05,463 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:25:05,946 WARN L205 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2021-04-29 00:25:06,171 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-04-29 00:25:06,653 WARN L205 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2021-04-29 00:25:06,869 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-04-29 00:25:07,067 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:25:07,258 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:25:07,449 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:25:07,637 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-29 00:25:07,692 INFO L158 LiptonReduction]: Checked pairs total: 16427 [2021-04-29 00:25:07,692 INFO L160 LiptonReduction]: Total number of compositions: 279 [2021-04-29 00:25:07,698 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43604 [2021-04-29 00:25:07,745 INFO L129 PetriNetUnfolder]: 0/66 cut-off events. [2021-04-29 00:25:07,746 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:25:07,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:25:07,747 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-04-29 00:25:07,747 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-04-29 00:25:07,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:25:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1100635038, now seen corresponding path program 1 times [2021-04-29 00:25:07,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:25:07,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249983350] [2021-04-29 00:25:07,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:25:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:25:08,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:08,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:25:08,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249983350] [2021-04-29 00:25:08,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:25:08,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:25:08,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071098358] [2021-04-29 00:25:08,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:25:08,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:25:08,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:25:08,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:25:08,174 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 377 [2021-04-29 00:25:08,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 127 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 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-04-29 00:25:08,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:25:08,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 377 [2021-04-29 00:25:08,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:25:08,345 INFO L129 PetriNetUnfolder]: 29/398 cut-off events. [2021-04-29 00:25:08,345 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:25:08,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 398 events. 29/398 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3232 event pairs, 15 based on Foata normal form. 23/104 useless extension candidates. Maximal degree in co-relation 398. Up to 41 conditions per place. [2021-04-29 00:25:08,351 INFO L132 encePairwiseOnDemand]: 357/377 looper letters, 7 selfloop transitions, 2 changer transitions 56/126 dead transitions. [2021-04-29 00:25:08,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 126 transitions, 307 flow [2021-04-29 00:25:08,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:25:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:25:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 900 transitions. [2021-04-29 00:25:08,372 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7957559681697612 [2021-04-29 00:25:08,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 900 transitions. [2021-04-29 00:25:08,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 900 transitions. [2021-04-29 00:25:08,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:25:08,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 900 transitions. [2021-04-29 00:25:08,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 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-04-29 00:25:08,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 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-04-29 00:25:08,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 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-04-29 00:25:08,402 INFO L185 Difference]: Start difference. First operand has 136 places, 127 transitions, 263 flow. Second operand 3 states and 900 transitions. [2021-04-29 00:25:08,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 126 transitions, 307 flow [2021-04-29 00:25:08,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 126 transitions, 304 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-29 00:25:08,410 INFO L241 Difference]: Finished difference. Result has 132 places, 67 transitions, 144 flow [2021-04-29 00:25:08,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=132, PETRI_TRANSITIONS=67} [2021-04-29 00:25:08,413 INFO L343 CegarLoopForPetriNet]: 136 programPoint places, -4 predicate places. [2021-04-29 00:25:08,413 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:25:08,414 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 67 transitions, 144 flow [2021-04-29 00:25:08,414 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 67 transitions, 144 flow [2021-04-29 00:25:08,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 67 transitions, 144 flow [2021-04-29 00:25:08,424 INFO L129 PetriNetUnfolder]: 0/67 cut-off events. [2021-04-29 00:25:08,424 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:25:08,424 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 67 events. 0/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 337 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-29 00:25:08,426 INFO L146 LiptonReduction]: Number of co-enabled transitions 1954 [2021-04-29 00:25:09,244 INFO L158 LiptonReduction]: Checked pairs total: 2480 [2021-04-29 00:25:09,245 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:25:09,245 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 832 [2021-04-29 00:25:09,247 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 144 flow [2021-04-29 00:25:09,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 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-04-29 00:25:09,249 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:25:09,249 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:25:09,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-29 00:25:09,249 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-04-29 00:25:09,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:25:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash -222576263, now seen corresponding path program 1 times [2021-04-29 00:25:09,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:25:09,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473047208] [2021-04-29 00:25:09,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:25:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:25:09,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:09,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:25:09,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473047208] [2021-04-29 00:25:09,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:25:09,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:25:09,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071161204] [2021-04-29 00:25:09,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:25:09,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:25:09,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:25:09,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:25:09,342 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 377 [2021-04-29 00:25:09,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 252.66666666666666) internal successors, (758), 3 states have internal predecessors, (758), 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-04-29 00:25:09,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:25:09,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 377 [2021-04-29 00:25:09,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:25:09,454 INFO L129 PetriNetUnfolder]: 22/111 cut-off events. [2021-04-29 00:25:09,454 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:25:09,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 111 events. 22/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 616 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 184. Up to 49 conditions per place. [2021-04-29 00:25:09,455 INFO L132 encePairwiseOnDemand]: 372/377 looper letters, 1 selfloop transitions, 2 changer transitions 61/89 dead transitions. [2021-04-29 00:25:09,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 286 flow [2021-04-29 00:25:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:25:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:25:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2021-04-29 00:25:09,459 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7108753315649867 [2021-04-29 00:25:09,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 804 transitions. [2021-04-29 00:25:09,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 804 transitions. [2021-04-29 00:25:09,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:25:09,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 804 transitions. [2021-04-29 00:25:09,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 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-04-29 00:25:09,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 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-04-29 00:25:09,469 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 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-04-29 00:25:09,469 INFO L185 Difference]: Start difference. First operand has 76 places, 67 transitions, 144 flow. Second operand 3 states and 804 transitions. [2021-04-29 00:25:09,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 286 flow [2021-04-29 00:25:09,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 89 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:25:09,472 INFO L241 Difference]: Finished difference. Result has 77 places, 28 transitions, 70 flow [2021-04-29 00:25:09,472 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=77, PETRI_TRANSITIONS=28} [2021-04-29 00:25:09,473 INFO L343 CegarLoopForPetriNet]: 136 programPoint places, -59 predicate places. [2021-04-29 00:25:09,473 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:25:09,473 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 28 transitions, 70 flow [2021-04-29 00:25:09,474 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 28 transitions, 70 flow [2021-04-29 00:25:09,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 70 flow [2021-04-29 00:25:09,479 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-04-29 00:25:09,479 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:25:09,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 64 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-04-29 00:25:09,480 INFO L146 LiptonReduction]: Number of co-enabled transitions 428 [2021-04-29 00:25:09,496 INFO L158 LiptonReduction]: Checked pairs total: 515 [2021-04-29 00:25:09,497 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:25:09,497 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-04-29 00:25:09,499 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 70 flow [2021-04-29 00:25:09,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 252.66666666666666) internal successors, (758), 3 states have internal predecessors, (758), 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-04-29 00:25:09,500 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:25:09,500 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:25:09,500 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-29 00:25:09,500 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-04-29 00:25:09,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:25:09,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1690067268, now seen corresponding path program 1 times [2021-04-29 00:25:09,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:25:09,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50290934] [2021-04-29 00:25:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:25:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:25:09,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:09,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:09,598 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-04-29 00:25:09,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:25:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:25:09,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50290934] [2021-04-29 00:25:09,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:25:09,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 00:25:09,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946106489] [2021-04-29 00:25:09,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:25:09,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:25:09,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:25:09,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:25:09,611 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 377 [2021-04-29 00:25:09,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 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-04-29 00:25:09,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:25:09,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 377 [2021-04-29 00:25:09,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:25:09,676 INFO L129 PetriNetUnfolder]: 20/107 cut-off events. [2021-04-29 00:25:09,677 INFO L130 PetriNetUnfolder]: For 13/17 co-relation queries the response was YES. [2021-04-29 00:25:09,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 107 events. 20/107 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 473 event pairs, 0 based on Foata normal form. 7/84 useless extension candidates. Maximal degree in co-relation 165. Up to 26 conditions per place. [2021-04-29 00:25:09,680 INFO L132 encePairwiseOnDemand]: 371/377 looper letters, 8 selfloop transitions, 9 changer transitions 0/39 dead transitions. [2021-04-29 00:25:09,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 137 flow [2021-04-29 00:25:09,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:25:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:25:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1104 transitions. [2021-04-29 00:25:09,685 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5856763925729443 [2021-04-29 00:25:09,686 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1104 transitions. [2021-04-29 00:25:09,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1104 transitions. [2021-04-29 00:25:09,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:25:09,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1104 transitions. [2021-04-29 00:25:09,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 220.8) internal successors, (1104), 5 states have internal predecessors, (1104), 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-04-29 00:25:09,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-04-29 00:25:09,701 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-04-29 00:25:09,701 INFO L185 Difference]: Start difference. First operand has 38 places, 28 transitions, 70 flow. Second operand 5 states and 1104 transitions. [2021-04-29 00:25:09,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 137 flow [2021-04-29 00:25:09,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:25:09,703 INFO L241 Difference]: Finished difference. Result has 43 places, 35 transitions, 129 flow [2021-04-29 00:25:09,703 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2021-04-29 00:25:09,704 INFO L343 CegarLoopForPetriNet]: 136 programPoint places, -93 predicate places. [2021-04-29 00:25:09,704 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:25:09,704 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 129 flow [2021-04-29 00:25:09,704 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 129 flow [2021-04-29 00:25:09,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 129 flow [2021-04-29 00:25:09,720 INFO L129 PetriNetUnfolder]: 14/96 cut-off events. [2021-04-29 00:25:09,720 INFO L130 PetriNetUnfolder]: For 24/27 co-relation queries the response was YES. [2021-04-29 00:25:09,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 96 events. 14/96 cut-off events. For 24/27 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 455 event pairs, 3 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 178. Up to 25 conditions per place. [2021-04-29 00:25:09,723 INFO L146 LiptonReduction]: Number of co-enabled transitions 530 [2021-04-29 00:25:09,963 INFO L158 LiptonReduction]: Checked pairs total: 406 [2021-04-29 00:25:09,963 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:25:09,963 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 259 [2021-04-29 00:25:09,965 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 129 flow [2021-04-29 00:25:09,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 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-04-29 00:25:09,966 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:25:09,967 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:25:09,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-29 00:25:09,967 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-04-29 00:25:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:25:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash 852473872, now seen corresponding path program 1 times [2021-04-29 00:25:09,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:25:09,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116356236] [2021-04-29 00:25:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:25:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:25:10,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:10,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:10,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:10,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:25:10,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116356236] [2021-04-29 00:25:10,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:25:10,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 00:25:10,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815874604] [2021-04-29 00:25:10,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:25:10,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:25:10,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:25:10,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:25:10,040 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 377 [2021-04-29 00:25:10,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 225.75) internal successors, (903), 4 states have internal predecessors, (903), 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-04-29 00:25:10,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:25:10,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 377 [2021-04-29 00:25:10,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:25:10,078 INFO L129 PetriNetUnfolder]: 13/104 cut-off events. [2021-04-29 00:25:10,079 INFO L130 PetriNetUnfolder]: For 68/79 co-relation queries the response was YES. [2021-04-29 00:25:10,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 104 events. 13/104 cut-off events. For 68/79 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 497 event pairs, 2 based on Foata normal form. 10/82 useless extension candidates. Maximal degree in co-relation 197. Up to 23 conditions per place. [2021-04-29 00:25:10,080 INFO L132 encePairwiseOnDemand]: 373/377 looper letters, 1 selfloop transitions, 5 changer transitions 5/36 dead transitions. [2021-04-29 00:25:10,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 152 flow [2021-04-29 00:25:10,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 00:25:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 00:25:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 907 transitions. [2021-04-29 00:25:10,084 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6014588859416445 [2021-04-29 00:25:10,084 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 907 transitions. [2021-04-29 00:25:10,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 907 transitions. [2021-04-29 00:25:10,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:25:10,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 907 transitions. [2021-04-29 00:25:10,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 226.75) internal successors, (907), 4 states have internal predecessors, (907), 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-04-29 00:25:10,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 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-04-29 00:25:10,094 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 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-04-29 00:25:10,094 INFO L185 Difference]: Start difference. First operand has 43 places, 35 transitions, 129 flow. Second operand 4 states and 907 transitions. [2021-04-29 00:25:10,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 152 flow [2021-04-29 00:25:10,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 147 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 00:25:10,097 INFO L241 Difference]: Finished difference. Result has 47 places, 31 transitions, 126 flow [2021-04-29 00:25:10,097 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2021-04-29 00:25:10,097 INFO L343 CegarLoopForPetriNet]: 136 programPoint places, -89 predicate places. [2021-04-29 00:25:10,098 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:25:10,098 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 31 transitions, 126 flow [2021-04-29 00:25:10,098 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 31 transitions, 126 flow [2021-04-29 00:25:10,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 31 transitions, 126 flow [2021-04-29 00:25:10,109 INFO L129 PetriNetUnfolder]: 7/61 cut-off events. [2021-04-29 00:25:10,109 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2021-04-29 00:25:10,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 61 events. 7/61 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 5 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 118. Up to 16 conditions per place. [2021-04-29 00:25:10,110 INFO L146 LiptonReduction]: Number of co-enabled transitions 396 [2021-04-29 00:25:10,263 INFO L158 LiptonReduction]: Checked pairs total: 335 [2021-04-29 00:25:10,263 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:25:10,264 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 166 [2021-04-29 00:25:10,265 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 126 flow [2021-04-29 00:25:10,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 225.75) internal successors, (903), 4 states have internal predecessors, (903), 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-04-29 00:25:10,266 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:25:10,266 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:25:10,267 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-29 00:25:10,267 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-04-29 00:25:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:25:10,267 INFO L82 PathProgramCache]: Analyzing trace with hash -590710551, now seen corresponding path program 1 times [2021-04-29 00:25:10,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:25:10,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532978327] [2021-04-29 00:25:10,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:25:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:25:10,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:10,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:10,343 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:25:10,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:25:10,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:10,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:25:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:25:10,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532978327] [2021-04-29 00:25:10,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:25:10,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:25:10,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695784908] [2021-04-29 00:25:10,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:25:10,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:25:10,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:25:10,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:25:10,358 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 377 [2021-04-29 00:25:10,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 275.75) internal successors, (1103), 4 states have internal predecessors, (1103), 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-04-29 00:25:10,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:25:10,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 377 [2021-04-29 00:25:10,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:25:10,545 INFO L129 PetriNetUnfolder]: 597/1044 cut-off events. [2021-04-29 00:25:10,546 INFO L130 PetriNetUnfolder]: For 1007/1068 co-relation queries the response was YES. [2021-04-29 00:25:10,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 1044 events. 597/1044 cut-off events. For 1007/1068 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 6762 event pairs, 306 based on Foata normal form. 80/585 useless extension candidates. Maximal degree in co-relation 2487. Up to 712 conditions per place. [2021-04-29 00:25:10,557 INFO L132 encePairwiseOnDemand]: 365/377 looper letters, 17 selfloop transitions, 17 changer transitions 6/59 dead transitions. [2021-04-29 00:25:10,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 262 flow [2021-04-29 00:25:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:25:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:25:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1417 transitions. [2021-04-29 00:25:10,563 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7517241379310344 [2021-04-29 00:25:10,564 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1417 transitions. [2021-04-29 00:25:10,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1417 transitions. [2021-04-29 00:25:10,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:25:10,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1417 transitions. [2021-04-29 00:25:10,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 283.4) internal successors, (1417), 5 states have internal predecessors, (1417), 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-04-29 00:25:10,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-04-29 00:25:10,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-04-29 00:25:10,577 INFO L185 Difference]: Start difference. First operand has 46 places, 31 transitions, 126 flow. Second operand 5 states and 1417 transitions. [2021-04-29 00:25:10,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 262 flow [2021-04-29 00:25:10,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 241 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-04-29 00:25:10,584 INFO L241 Difference]: Finished difference. Result has 48 places, 47 transitions, 237 flow [2021-04-29 00:25:10,585 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2021-04-29 00:25:10,585 INFO L343 CegarLoopForPetriNet]: 136 programPoint places, -88 predicate places. [2021-04-29 00:25:10,585 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:25:10,585 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 47 transitions, 237 flow [2021-04-29 00:25:10,586 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 47 transitions, 237 flow [2021-04-29 00:25:10,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 237 flow [2021-04-29 00:25:10,707 INFO L129 PetriNetUnfolder]: 564/1008 cut-off events. [2021-04-29 00:25:10,708 INFO L130 PetriNetUnfolder]: For 560/966 co-relation queries the response was YES. [2021-04-29 00:25:10,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 1008 events. 564/1008 cut-off events. For 560/966 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 7088 event pairs, 291 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 2978. Up to 752 conditions per place. [2021-04-29 00:25:10,725 INFO L146 LiptonReduction]: Number of co-enabled transitions 504 [2021-04-29 00:25:10,824 INFO L158 LiptonReduction]: Checked pairs total: 615 [2021-04-29 00:25:10,824 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:25:10,825 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 240 [2021-04-29 00:25:10,826 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 237 flow [2021-04-29 00:25:10,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 275.75) internal successors, (1103), 4 states have internal predecessors, (1103), 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-04-29 00:25:10,827 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:25:10,827 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:25:10,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-29 00:25:10,827 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-04-29 00:25:10,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:25:10,828 INFO L82 PathProgramCache]: Analyzing trace with hash 507547272, now seen corresponding path program 1 times [2021-04-29 00:25:10,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:25:10,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699717171] [2021-04-29 00:25:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:25:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:25:10,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:10,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:10,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:10,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:10,919 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:25:10,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:25:10,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:10,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:25:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:25:10,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699717171] [2021-04-29 00:25:10,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:25:10,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:25:10,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346908934] [2021-04-29 00:25:10,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:25:10,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:25:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:25:10,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:25:10,935 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 377 [2021-04-29 00:25:10,937 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 275.8) internal successors, (1379), 5 states have internal predecessors, (1379), 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-04-29 00:25:10,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:25:10,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 377 [2021-04-29 00:25:10,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:25:11,234 INFO L129 PetriNetUnfolder]: 462/921 cut-off events. [2021-04-29 00:25:11,234 INFO L130 PetriNetUnfolder]: For 664/1754 co-relation queries the response was YES. [2021-04-29 00:25:11,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3529 conditions, 921 events. 462/921 cut-off events. For 664/1754 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 6249 event pairs, 90 based on Foata normal form. 105/546 useless extension candidates. Maximal degree in co-relation 3513. Up to 725 conditions per place. [2021-04-29 00:25:11,243 INFO L132 encePairwiseOnDemand]: 365/377 looper letters, 11 selfloop transitions, 33 changer transitions 12/75 dead transitions. [2021-04-29 00:25:11,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 515 flow [2021-04-29 00:25:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:25:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:25:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1983 transitions. [2021-04-29 00:25:11,250 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7514209928003032 [2021-04-29 00:25:11,251 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1983 transitions. [2021-04-29 00:25:11,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1983 transitions. [2021-04-29 00:25:11,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:25:11,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1983 transitions. [2021-04-29 00:25:11,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 283.2857142857143) internal successors, (1983), 7 states have internal predecessors, (1983), 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-04-29 00:25:11,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 377.0) internal successors, (3016), 8 states have internal predecessors, (3016), 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-04-29 00:25:11,265 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 377.0) internal successors, (3016), 8 states have internal predecessors, (3016), 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-04-29 00:25:11,265 INFO L185 Difference]: Start difference. First operand has 48 places, 47 transitions, 237 flow. Second operand 7 states and 1983 transitions. [2021-04-29 00:25:11,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 515 flow [2021-04-29 00:25:11,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 505 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 00:25:11,276 INFO L241 Difference]: Finished difference. Result has 56 places, 63 transitions, 455 flow [2021-04-29 00:25:11,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=56, PETRI_TRANSITIONS=63} [2021-04-29 00:25:11,277 INFO L343 CegarLoopForPetriNet]: 136 programPoint places, -80 predicate places. [2021-04-29 00:25:11,277 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:25:11,277 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 63 transitions, 455 flow [2021-04-29 00:25:11,278 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 63 transitions, 455 flow [2021-04-29 00:25:11,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 63 transitions, 455 flow [2021-04-29 00:25:11,389 INFO L129 PetriNetUnfolder]: 342/821 cut-off events. [2021-04-29 00:25:11,389 INFO L130 PetriNetUnfolder]: For 1332/1700 co-relation queries the response was YES. [2021-04-29 00:25:11,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3518 conditions, 821 events. 342/821 cut-off events. For 1332/1700 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 6271 event pairs, 79 based on Foata normal form. 4/432 useless extension candidates. Maximal degree in co-relation 3500. Up to 623 conditions per place. [2021-04-29 00:25:11,402 INFO L146 LiptonReduction]: Number of co-enabled transitions 570 [2021-04-29 00:25:11,542 INFO L158 LiptonReduction]: Checked pairs total: 1070 [2021-04-29 00:25:11,542 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:25:11,542 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 265 [2021-04-29 00:25:11,544 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 63 transitions, 455 flow [2021-04-29 00:25:11,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 275.8) internal successors, (1379), 5 states have internal predecessors, (1379), 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-04-29 00:25:11,545 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:25:11,545 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:25:11,545 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-29 00:25:11,545 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-04-29 00:25:11,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:25:11,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1860864757, now seen corresponding path program 1 times [2021-04-29 00:25:11,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:25:11,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147689820] [2021-04-29 00:25:11,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:25:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:25:11,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:11,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:11,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:11,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:11,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:11,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:11,799 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:25:11,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:25:11,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:11,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:25:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:25:11,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147689820] [2021-04-29 00:25:11,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:25:11,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:25:11,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829713795] [2021-04-29 00:25:11,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:25:11,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:25:11,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:25:11,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:25:11,826 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 377 [2021-04-29 00:25:11,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 63 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 275.8333333333333) internal successors, (1655), 6 states have internal predecessors, (1655), 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-04-29 00:25:11,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:25:11,828 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 377 [2021-04-29 00:25:11,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:25:12,099 INFO L129 PetriNetUnfolder]: 183/561 cut-off events. [2021-04-29 00:25:12,099 INFO L130 PetriNetUnfolder]: For 1256/3310 co-relation queries the response was YES. [2021-04-29 00:25:12,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2946 conditions, 561 events. 183/561 cut-off events. For 1256/3310 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 4157 event pairs, 0 based on Foata normal form. 106/364 useless extension candidates. Maximal degree in co-relation 2926. Up to 473 conditions per place. [2021-04-29 00:25:12,104 INFO L132 encePairwiseOnDemand]: 365/377 looper letters, 2 selfloop transitions, 43 changer transitions 9/73 dead transitions. [2021-04-29 00:25:12,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 647 flow [2021-04-29 00:25:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:25:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:25:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2531 transitions. [2021-04-29 00:25:12,113 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7459475390509873 [2021-04-29 00:25:12,113 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2531 transitions. [2021-04-29 00:25:12,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2531 transitions. [2021-04-29 00:25:12,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:25:12,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2531 transitions. [2021-04-29 00:25:12,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 281.22222222222223) internal successors, (2531), 9 states have internal predecessors, (2531), 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-04-29 00:25:12,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 377.0) internal successors, (3770), 10 states have internal predecessors, (3770), 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-04-29 00:25:12,134 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 377.0) internal successors, (3770), 10 states have internal predecessors, (3770), 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-04-29 00:25:12,134 INFO L185 Difference]: Start difference. First operand has 56 places, 63 transitions, 455 flow. Second operand 9 states and 2531 transitions. [2021-04-29 00:25:12,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 647 flow [2021-04-29 00:25:12,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 558 flow, removed 34 selfloop flow, removed 3 redundant places. [2021-04-29 00:25:12,153 INFO L241 Difference]: Finished difference. Result has 64 places, 64 transitions, 490 flow [2021-04-29 00:25:12,153 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=490, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2021-04-29 00:25:12,153 INFO L343 CegarLoopForPetriNet]: 136 programPoint places, -72 predicate places. [2021-04-29 00:25:12,153 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:25:12,154 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 64 transitions, 490 flow [2021-04-29 00:25:12,154 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 64 transitions, 490 flow [2021-04-29 00:25:12,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 64 transitions, 490 flow [2021-04-29 00:25:12,209 INFO L129 PetriNetUnfolder]: 138/464 cut-off events. [2021-04-29 00:25:12,209 INFO L130 PetriNetUnfolder]: For 1041/1171 co-relation queries the response was YES. [2021-04-29 00:25:12,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 464 events. 138/464 cut-off events. For 1041/1171 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 3545 event pairs, 1 based on Foata normal form. 2/248 useless extension candidates. Maximal degree in co-relation 2052. Up to 208 conditions per place. [2021-04-29 00:25:12,217 INFO L146 LiptonReduction]: Number of co-enabled transitions 530 [2021-04-29 00:25:12,397 INFO L158 LiptonReduction]: Checked pairs total: 1002 [2021-04-29 00:25:12,397 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:25:12,397 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 244 [2021-04-29 00:25:12,398 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 490 flow [2021-04-29 00:25:12,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 275.8333333333333) internal successors, (1655), 6 states have internal predecessors, (1655), 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-04-29 00:25:12,400 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:25:12,400 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:25:12,400 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-29 00:25:12,400 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-04-29 00:25:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:25:12,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1722030608, now seen corresponding path program 1 times [2021-04-29 00:25:12,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:25:12,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229140536] [2021-04-29 00:25:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:25:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:25:12,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:12,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:25:12,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:12,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:12,548 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-04-29 00:25:12,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:25:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:25:12,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229140536] [2021-04-29 00:25:12,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:25:12,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:25:12,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652334022] [2021-04-29 00:25:12,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:25:12,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:25:12,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:25:12,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:25:12,565 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 377 [2021-04-29 00:25:12,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 490 flow. Second operand has 4 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 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-04-29 00:25:12,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:25:12,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 377 [2021-04-29 00:25:12,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:25:12,720 INFO L129 PetriNetUnfolder]: 229/717 cut-off events. [2021-04-29 00:25:12,721 INFO L130 PetriNetUnfolder]: For 1873/2250 co-relation queries the response was YES. [2021-04-29 00:25:12,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3406 conditions, 717 events. 229/717 cut-off events. For 1873/2250 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 5741 event pairs, 0 based on Foata normal form. 33/397 useless extension candidates. Maximal degree in co-relation 3383. Up to 319 conditions per place. [2021-04-29 00:25:12,729 INFO L132 encePairwiseOnDemand]: 371/377 looper letters, 3 selfloop transitions, 7 changer transitions 4/68 dead transitions. [2021-04-29 00:25:12,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 535 flow [2021-04-29 00:25:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:25:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:25:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1107 transitions. [2021-04-29 00:25:12,735 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5872679045092838 [2021-04-29 00:25:12,736 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1107 transitions. [2021-04-29 00:25:12,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1107 transitions. [2021-04-29 00:25:12,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:25:12,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1107 transitions. [2021-04-29 00:25:12,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 221.4) internal successors, (1107), 5 states have internal predecessors, (1107), 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-04-29 00:25:12,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-04-29 00:25:12,749 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 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-04-29 00:25:12,749 INFO L185 Difference]: Start difference. First operand has 63 places, 64 transitions, 490 flow. Second operand 5 states and 1107 transitions. [2021-04-29 00:25:12,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 535 flow [2021-04-29 00:25:12,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 391 flow, removed 34 selfloop flow, removed 8 redundant places. [2021-04-29 00:25:12,796 INFO L241 Difference]: Finished difference. Result has 61 places, 64 transitions, 375 flow [2021-04-29 00:25:12,796 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=375, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2021-04-29 00:25:12,796 INFO L343 CegarLoopForPetriNet]: 136 programPoint places, -75 predicate places. [2021-04-29 00:25:12,796 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:25:12,797 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 64 transitions, 375 flow [2021-04-29 00:25:12,797 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 64 transitions, 375 flow [2021-04-29 00:25:12,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 64 transitions, 375 flow [2021-04-29 00:25:12,874 INFO L129 PetriNetUnfolder]: 227/703 cut-off events. [2021-04-29 00:25:12,874 INFO L130 PetriNetUnfolder]: For 695/705 co-relation queries the response was YES. [2021-04-29 00:25:12,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2244 conditions, 703 events. 227/703 cut-off events. For 695/705 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 5973 event pairs, 0 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 2224. Up to 280 conditions per place. [2021-04-29 00:25:12,882 INFO L146 LiptonReduction]: Number of co-enabled transitions 490 [2021-04-29 00:25:13,184 INFO L158 LiptonReduction]: Checked pairs total: 1775 [2021-04-29 00:25:13,185 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-29 00:25:13,185 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 389 [2021-04-29 00:25:13,186 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 375 flow [2021-04-29 00:25:13,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 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-04-29 00:25:13,187 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:25:13,187 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:25:13,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-29 00:25:13,188 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-04-29 00:25:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:25:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash -663945496, now seen corresponding path program 1 times [2021-04-29 00:25:13,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:25:13,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514161532] [2021-04-29 00:25:13,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:25:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:25:13,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:13,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:25:13,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:13,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:13,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:13,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:13,298 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-04-29 00:25:13,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:25:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:25:13,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514161532] [2021-04-29 00:25:13,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:25:13,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:25:13,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779942676] [2021-04-29 00:25:13,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:25:13,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:25:13,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:25:13,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:25:13,313 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 378 [2021-04-29 00:25:13,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 375 flow. Second operand has 5 states, 5 states have (on average 221.2) internal successors, (1106), 5 states have internal predecessors, (1106), 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-04-29 00:25:13,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:25:13,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 378 [2021-04-29 00:25:13,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:25:13,469 INFO L129 PetriNetUnfolder]: 298/916 cut-off events. [2021-04-29 00:25:13,469 INFO L130 PetriNetUnfolder]: For 1047/1067 co-relation queries the response was YES. [2021-04-29 00:25:13,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 916 events. 298/916 cut-off events. For 1047/1067 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 7999 event pairs, 0 based on Foata normal form. 29/512 useless extension candidates. Maximal degree in co-relation 2919. Up to 406 conditions per place. [2021-04-29 00:25:13,475 INFO L132 encePairwiseOnDemand]: 373/378 looper letters, 3 selfloop transitions, 3 changer transitions 20/64 dead transitions. [2021-04-29 00:25:13,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 395 flow [2021-04-29 00:25:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:25:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:25:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1331 transitions. [2021-04-29 00:25:13,484 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5868606701940036 [2021-04-29 00:25:13,484 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1331 transitions. [2021-04-29 00:25:13,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1331 transitions. [2021-04-29 00:25:13,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:25:13,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1331 transitions. [2021-04-29 00:25:13,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 221.83333333333334) internal successors, (1331), 6 states have internal predecessors, (1331), 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-04-29 00:25:13,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 378.0) internal successors, (2646), 7 states have internal predecessors, (2646), 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-04-29 00:25:13,505 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 378.0) internal successors, (2646), 7 states have internal predecessors, (2646), 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-04-29 00:25:13,506 INFO L185 Difference]: Start difference. First operand has 60 places, 64 transitions, 375 flow. Second operand 6 states and 1331 transitions. [2021-04-29 00:25:13,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 395 flow [2021-04-29 00:25:13,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:25:13,557 INFO L241 Difference]: Finished difference. Result has 64 places, 44 transitions, 235 flow [2021-04-29 00:25:13,557 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2021-04-29 00:25:13,557 INFO L343 CegarLoopForPetriNet]: 136 programPoint places, -72 predicate places. [2021-04-29 00:25:13,557 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:25:13,558 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 44 transitions, 235 flow [2021-04-29 00:25:13,558 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 44 transitions, 235 flow [2021-04-29 00:25:13,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 44 transitions, 235 flow [2021-04-29 00:25:13,588 INFO L129 PetriNetUnfolder]: 90/262 cut-off events. [2021-04-29 00:25:13,588 INFO L130 PetriNetUnfolder]: For 312/312 co-relation queries the response was YES. [2021-04-29 00:25:13,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 262 events. 90/262 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1552 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 774. Up to 109 conditions per place. [2021-04-29 00:25:13,591 INFO L146 LiptonReduction]: Number of co-enabled transitions 184 [2021-04-29 00:25:14,899 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-04-29 00:25:15,414 WARN L205 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-04-29 00:25:17,696 WARN L205 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-04-29 00:25:18,781 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 255 [2021-04-29 00:25:18,792 INFO L158 LiptonReduction]: Checked pairs total: 662 [2021-04-29 00:25:18,792 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-29 00:25:18,792 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5235 [2021-04-29 00:25:18,793 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 240 flow [2021-04-29 00:25:18,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 221.2) internal successors, (1106), 5 states have internal predecessors, (1106), 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-04-29 00:25:18,795 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:25:18,795 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:25:18,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-29 00:25:18,795 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-04-29 00:25:18,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:25:18,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1555917975, now seen corresponding path program 1 times [2021-04-29 00:25:18,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:25:18,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207597520] [2021-04-29 00:25:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:25:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:25:18,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:18,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:18,880 INFO L142 QuantifierPusher]: treesize reduction 5, result has 76.2 percent of original size [2021-04-29 00:25:18,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:25:18,898 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-04-29 00:25:18,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:25:18,915 INFO L142 QuantifierPusher]: treesize reduction 12, result has 80.3 percent of original size [2021-04-29 00:25:18,918 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.6 percent of original size 40 [2021-04-29 00:25:18,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:18,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:25:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:25:18,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207597520] [2021-04-29 00:25:18,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:25:18,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:25:18,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434681221] [2021-04-29 00:25:18,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:25:18,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:25:18,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:25:18,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:25:18,962 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 379 [2021-04-29 00:25:18,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 181.28571428571428) internal successors, (1269), 7 states have internal predecessors, (1269), 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-04-29 00:25:18,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:25:18,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 379 [2021-04-29 00:25:18,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:25:19,283 INFO L129 PetriNetUnfolder]: 311/743 cut-off events. [2021-04-29 00:25:19,284 INFO L130 PetriNetUnfolder]: For 1312/1313 co-relation queries the response was YES. [2021-04-29 00:25:19,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2374 conditions, 743 events. 311/743 cut-off events. For 1312/1313 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 5297 event pairs, 0 based on Foata normal form. 28/400 useless extension candidates. Maximal degree in co-relation 2350. Up to 325 conditions per place. [2021-04-29 00:25:19,290 INFO L132 encePairwiseOnDemand]: 371/379 looper letters, 8 selfloop transitions, 8 changer transitions 4/55 dead transitions. [2021-04-29 00:25:19,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 352 flow [2021-04-29 00:25:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-04-29 00:25:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-04-29 00:25:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1461 transitions. [2021-04-29 00:25:19,296 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.48186015831134565 [2021-04-29 00:25:19,297 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1461 transitions. [2021-04-29 00:25:19,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1461 transitions. [2021-04-29 00:25:19,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:25:19,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1461 transitions. [2021-04-29 00:25:19,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 182.625) internal successors, (1461), 8 states have internal predecessors, (1461), 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-04-29 00:25:19,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 379.0) internal successors, (3411), 9 states have internal predecessors, (3411), 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-04-29 00:25:19,308 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 379.0) internal successors, (3411), 9 states have internal predecessors, (3411), 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-04-29 00:25:19,308 INFO L185 Difference]: Start difference. First operand has 55 places, 44 transitions, 240 flow. Second operand 8 states and 1461 transitions. [2021-04-29 00:25:19,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 55 transitions, 352 flow [2021-04-29 00:25:19,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 305 flow, removed 17 selfloop flow, removed 9 redundant places. [2021-04-29 00:25:19,319 INFO L241 Difference]: Finished difference. Result has 57 places, 49 transitions, 279 flow [2021-04-29 00:25:19,319 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=279, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2021-04-29 00:25:19,320 INFO L343 CegarLoopForPetriNet]: 136 programPoint places, -79 predicate places. [2021-04-29 00:25:19,320 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:25:19,320 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 49 transitions, 279 flow [2021-04-29 00:25:19,320 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 49 transitions, 279 flow [2021-04-29 00:25:19,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 49 transitions, 279 flow [2021-04-29 00:25:19,361 INFO L129 PetriNetUnfolder]: 208/440 cut-off events. [2021-04-29 00:25:19,362 INFO L130 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2021-04-29 00:25:19,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 440 events. 208/440 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2353 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 1135. Up to 190 conditions per place. [2021-04-29 00:25:19,366 INFO L146 LiptonReduction]: Number of co-enabled transitions 206 [2021-04-29 00:25:19,369 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:25:19,369 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:25:19,369 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-04-29 00:25:19,370 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 279 flow [2021-04-29 00:25:19,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 181.28571428571428) internal successors, (1269), 7 states have internal predecessors, (1269), 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-04-29 00:25:19,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:25:19,371 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:25:19,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-29 00:25:19,371 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-04-29 00:25:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:25:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1839960356, now seen corresponding path program 1 times [2021-04-29 00:25:19,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:25:19,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388948993] [2021-04-29 00:25:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:25:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:25:19,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:19,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:25:19,453 INFO L142 QuantifierPusher]: treesize reduction 12, result has 63.6 percent of original size [2021-04-29 00:25:19,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-29 00:25:19,472 INFO L142 QuantifierPusher]: treesize reduction 8, result has 85.2 percent of original size [2021-04-29 00:25:19,474 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.4 percent of original size 37 [2021-04-29 00:25:19,512 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.7 percent of original size [2021-04-29 00:25:19,516 INFO L147 QuantifierPusher]: treesize reduction 9, result has 78.0 percent of original size 32 [2021-04-29 00:25:19,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:25:19,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-29 00:25:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:25:19,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388948993] [2021-04-29 00:25:19,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:25:19,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:25:19,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236790387] [2021-04-29 00:25:19,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:25:19,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:25:19,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:25:19,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:25:19,560 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 379 [2021-04-29 00:25:19,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 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-04-29 00:25:19,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:25:19,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 379 [2021-04-29 00:25:19,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:25:19,745 INFO L129 PetriNetUnfolder]: 192/522 cut-off events. [2021-04-29 00:25:19,745 INFO L130 PetriNetUnfolder]: For 352/352 co-relation queries the response was YES. [2021-04-29 00:25:19,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 522 events. 192/522 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 3632 event pairs, 0 based on Foata normal form. 27/302 useless extension candidates. Maximal degree in co-relation 1480. Up to 217 conditions per place. [2021-04-29 00:25:19,748 INFO L132 encePairwiseOnDemand]: 373/379 looper letters, 5 selfloop transitions, 3 changer transitions 8/51 dead transitions. [2021-04-29 00:25:19,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 51 transitions, 315 flow [2021-04-29 00:25:19,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:25:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:25:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1280 transitions. [2021-04-29 00:25:19,754 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4824726724462872 [2021-04-29 00:25:19,754 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1280 transitions. [2021-04-29 00:25:19,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1280 transitions. [2021-04-29 00:25:19,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:25:19,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1280 transitions. [2021-04-29 00:25:19,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.85714285714286) internal successors, (1280), 7 states have internal predecessors, (1280), 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-04-29 00:25:19,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 379.0) internal successors, (3032), 8 states have internal predecessors, (3032), 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-04-29 00:25:19,764 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 379.0) internal successors, (3032), 8 states have internal predecessors, (3032), 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-04-29 00:25:19,764 INFO L185 Difference]: Start difference. First operand has 57 places, 49 transitions, 279 flow. Second operand 7 states and 1280 transitions. [2021-04-29 00:25:19,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 51 transitions, 315 flow [2021-04-29 00:25:19,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 51 transitions, 295 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-04-29 00:25:19,771 INFO L241 Difference]: Finished difference. Result has 60 places, 42 transitions, 229 flow [2021-04-29 00:25:19,772 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2021-04-29 00:25:19,772 INFO L343 CegarLoopForPetriNet]: 136 programPoint places, -76 predicate places. [2021-04-29 00:25:19,772 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:25:19,772 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 42 transitions, 229 flow [2021-04-29 00:25:19,772 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 42 transitions, 229 flow [2021-04-29 00:25:19,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 229 flow [2021-04-29 00:25:19,800 INFO L129 PetriNetUnfolder]: 90/263 cut-off events. [2021-04-29 00:25:19,800 INFO L130 PetriNetUnfolder]: For 125/125 co-relation queries the response was YES. [2021-04-29 00:25:19,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 263 events. 90/263 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1481 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 681. Up to 109 conditions per place. [2021-04-29 00:25:19,803 INFO L146 LiptonReduction]: Number of co-enabled transitions 62 [2021-04-29 00:25:19,805 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:25:19,805 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:25:19,805 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-04-29 00:25:19,806 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 229 flow [2021-04-29 00:25:19,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 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-04-29 00:25:19,807 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:25:19,807 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:25:19,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-29 00:25:19,808 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-04-29 00:25:19,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:25:19,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1550556804, now seen corresponding path program 2 times [2021-04-29 00:25:19,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:25:19,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007826383] [2021-04-29 00:25:19,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:25:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:25:19,857 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:25:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:25:19,914 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:25:19,953 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-29 00:25:19,953 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-29 00:25:19,953 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-29 00:25:20,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 12:25:20 BasicIcfg [2021-04-29 00:25:20,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-29 00:25:20,049 INFO L168 Benchmark]: Toolchain (without parser) took 59689.94 ms. Allocated memory was 302.0 MB in the beginning and 843.1 MB in the end (delta: 541.1 MB). Free memory was 276.8 MB in the beginning and 651.4 MB in the end (delta: -374.5 MB). Peak memory consumption was 169.4 MB. Max. memory is 16.0 GB. [2021-04-29 00:25:20,049 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 302.0 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 00:25:20,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.69 ms. Allocated memory is still 302.0 MB. Free memory was 273.7 MB in the beginning and 277.6 MB in the end (delta: -3.9 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.0 GB. [2021-04-29 00:25:20,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.88 ms. Allocated memory is still 302.0 MB. Free memory was 277.6 MB in the beginning and 275.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:25:20,050 INFO L168 Benchmark]: Boogie Preprocessor took 87.46 ms. Allocated memory is still 302.0 MB. Free memory was 275.5 MB in the beginning and 273.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:25:20,050 INFO L168 Benchmark]: RCFGBuilder took 2415.09 ms. Allocated memory was 302.0 MB in the beginning and 367.0 MB in the end (delta: 65.0 MB). Free memory was 273.4 MB in the beginning and 309.4 MB in the end (delta: -36.0 MB). Peak memory consumption was 169.6 MB. Max. memory is 16.0 GB. [2021-04-29 00:25:20,051 INFO L168 Benchmark]: TraceAbstraction took 56312.33 ms. Allocated memory was 367.0 MB in the beginning and 843.1 MB in the end (delta: 476.1 MB). Free memory was 308.3 MB in the beginning and 651.4 MB in the end (delta: -343.0 MB). Peak memory consumption was 134.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:25:20,052 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.23 ms. Allocated memory is still 302.0 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 746.69 ms. Allocated memory is still 302.0 MB. Free memory was 273.7 MB in the beginning and 277.6 MB in the end (delta: -3.9 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 71.88 ms. Allocated memory is still 302.0 MB. Free memory was 277.6 MB in the beginning and 275.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 87.46 ms. Allocated memory is still 302.0 MB. Free memory was 275.5 MB in the beginning and 273.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2415.09 ms. Allocated memory was 302.0 MB in the beginning and 367.0 MB in the end (delta: 65.0 MB). Free memory was 273.4 MB in the beginning and 309.4 MB in the end (delta: -36.0 MB). Peak memory consumption was 169.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 56312.33 ms. Allocated memory was 367.0 MB in the beginning and 843.1 MB in the end (delta: 476.1 MB). Free memory was 308.3 MB in the beginning and 651.4 MB in the end (delta: -343.0 MB). Peak memory consumption was 134.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43570.1ms, 103 PlacesBefore, 136 PlacesAfterwards, 95 TransitionsBefore, 127 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 9 FixpointIterations, 175 TrivialSequentialCompositions, 102 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 279 TotalNumberOfCompositions, 16427 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4831, positive: 4553, positive conditional: 4553, positive unconditional: 0, negative: 278, negative conditional: 278, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2178, positive: 2114, positive conditional: 0, positive unconditional: 2114, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2178, positive: 2114, positive conditional: 0, positive unconditional: 2114, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2178, positive: 2079, positive conditional: 0, positive unconditional: 2079, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 99, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1265, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 1133, negative conditional: 0, negative unconditional: 1133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4831, positive: 2439, positive conditional: 2439, positive unconditional: 0, negative: 214, negative conditional: 214, negative unconditional: 0, unknown: 2178, unknown conditional: 2178, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2156, Positive cache size: 2097, Positive conditional cache size: 2097, Positive unconditional cache size: 0, Negative cache size: 59, Negative conditional cache size: 59, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 831.0ms, 132 PlacesBefore, 76 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1954 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2480 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 397, positive: 319, positive conditional: 319, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 92, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 92, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 803, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 803, negative conditional: 0, negative unconditional: 803, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 397, positive: 249, positive conditional: 249, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 92, unknown conditional: 92, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2248, Positive cache size: 2167, Positive conditional cache size: 2167, Positive unconditional cache size: 0, Negative cache size: 81, Negative conditional cache size: 81, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.0ms, 77 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 515 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 165, positive: 136, positive conditional: 136, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 7, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, positive: 102, positive conditional: 102, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2285, Positive cache size: 2201, Positive conditional cache size: 2201, Positive unconditional cache size: 0, Negative cache size: 84, Negative conditional cache size: 84, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 258.7ms, 43 PlacesBefore, 43 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 406 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 20, positive conditional: 6, positive unconditional: 14, negative: 6, negative conditional: 1, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 20, positive conditional: 6, positive unconditional: 14, negative: 6, negative conditional: 1, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 1, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 236, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 236, negative conditional: 4, negative unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2311, Positive cache size: 2221, Positive conditional cache size: 2221, Positive unconditional cache size: 0, Negative cache size: 90, Negative conditional cache size: 90, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 165.4ms, 47 PlacesBefore, 46 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 335 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 15, positive unconditional: 1, negative: 4, negative conditional: 1, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 15, positive unconditional: 1, negative: 4, negative conditional: 1, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 1, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 149, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 149, negative conditional: 51, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2331, Positive cache size: 2237, Positive conditional cache size: 2237, Positive unconditional cache size: 0, Negative cache size: 94, Negative conditional cache size: 94, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 238.7ms, 48 PlacesBefore, 48 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 615 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 155, positive: 131, positive conditional: 131, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, positive: 27, positive conditional: 14, positive unconditional: 13, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, positive: 27, positive conditional: 14, positive unconditional: 13, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, positive: 104, positive conditional: 104, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2361, Positive cache size: 2264, Positive conditional cache size: 2264, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 264.4ms, 56 PlacesBefore, 56 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1070 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 392, positive: 356, positive conditional: 356, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, positive: 51, positive conditional: 48, positive unconditional: 3, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 54, positive: 51, positive conditional: 48, positive unconditional: 3, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 54, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 113, negative conditional: 56, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 392, positive: 305, positive conditional: 305, positive unconditional: 0, negative: 33, negative conditional: 33, negative unconditional: 0, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2415, Positive cache size: 2315, Positive conditional cache size: 2315, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 243.3ms, 64 PlacesBefore, 63 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1002 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 235, positive: 199, positive conditional: 199, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 142, negative conditional: 142, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 235, positive: 174, positive conditional: 174, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2442, Positive cache size: 2340, Positive conditional cache size: 2340, Positive unconditional cache size: 0, Negative cache size: 102, Negative conditional cache size: 102, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 387.9ms, 61 PlacesBefore, 60 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1775 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 575, positive: 515, positive conditional: 515, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 18, positive unconditional: 0, 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: 19, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, 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: 62, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 575, positive: 497, positive conditional: 497, positive unconditional: 0, negative: 59, negative conditional: 59, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2461, Positive cache size: 2358, Positive conditional cache size: 2358, Positive unconditional cache size: 0, Negative cache size: 103, Negative conditional cache size: 103, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5234.3ms, 64 PlacesBefore, 55 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 662 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 329, positive: 293, positive conditional: 293, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 22, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 22, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 329, positive: 267, positive conditional: 267, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2487, Positive cache size: 2384, Positive conditional cache size: 2384, Positive unconditional cache size: 0, Negative cache size: 103, Negative conditional cache size: 103, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.1ms, 57 PlacesBefore, 57 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 206 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): 2487, Positive cache size: 2384, Positive conditional cache size: 2384, Positive unconditional cache size: 0, Negative cache size: 103, Negative conditional cache size: 103, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.7ms, 60 PlacesBefore, 53 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 62 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): 2487, Positive cache size: 2384, Positive conditional cache size: 2384, Positive unconditional cache size: 0, Negative cache size: 103, Negative conditional cache size: 103, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2351; [L834] FCALL, FORK 0 pthread_create(&t2351, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2352; [L836] FCALL, FORK 0 pthread_create(&t2352, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t2353; [L838] FCALL, FORK 0 pthread_create(&t2353, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L746] 1 z = 1 [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L756] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L757] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L758] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L760] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L761] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L844] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 29.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 55987.9ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2492.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 43739.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 82 SDtfs, 79 SDslu, 39 SDs, 0 SdLazy, 366 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 521.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 435.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=7, InterpolantAutomatonStates: 62, 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: 59.6ms SsaConstructionTime, 531.6ms SatisfiabilityAnalysisTime, 972.8ms InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 776 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...