/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:43:10,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:43:10,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:43:10,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:43:10,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:43:10,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:43:10,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:43:10,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:43:10,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:43:10,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:43:10,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:43:10,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:43:10,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:43:10,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:43:10,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:43:10,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:43:10,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:43:10,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:43:10,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:43:10,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:43:10,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:43:10,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:43:10,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:43:10,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:43:10,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:43:10,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:43:10,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:43:10,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:43:10,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:43:10,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:43:10,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:43:10,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:43:10,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:43:10,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:43:10,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:43:10,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:43:10,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:43:10,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:43:10,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:43:10,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:43:10,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:43:10,761 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-SemanticLbe-SemanticLooper.epf [2020-10-16 04:43:10,800 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:43:10,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:43:10,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:43:10,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:43:10,802 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:43:10,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:43:10,802 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:43:10,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:43:10,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:43:10,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:43:10,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:43:10,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:43:10,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:43:10,805 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:43:10,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:43:10,805 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:43:10,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:43:10,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:43:10,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:43:10,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:43:10,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:43:10,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:43:10,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:43:10,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:43:10,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:43:10,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:43:10,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:43:10,807 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:43:10,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:43:11,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:43:11,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:43:11,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:43:11,103 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:43:11,103 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:43:11,104 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.opt.i [2020-10-16 04:43:11,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21dd34902/3492139358f64846817f3dedd009f392/FLAG5ce4ab7ae [2020-10-16 04:43:11,714 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:43:11,716 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.opt.i [2020-10-16 04:43:11,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21dd34902/3492139358f64846817f3dedd009f392/FLAG5ce4ab7ae [2020-10-16 04:43:11,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21dd34902/3492139358f64846817f3dedd009f392 [2020-10-16 04:43:11,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:43:11,946 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:43:11,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:43:11,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:43:11,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:43:11,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:43:11" (1/1) ... [2020-10-16 04:43:11,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4883ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:11, skipping insertion in model container [2020-10-16 04:43:11,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:43:11" (1/1) ... [2020-10-16 04:43:11,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:43:12,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:43:12,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:43:12,584 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:43:12,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:43:12,720 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:43:12,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:12 WrapperNode [2020-10-16 04:43:12,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:43:12,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:43:12,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:43:12,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:43:12,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:12" (1/1) ... [2020-10-16 04:43:12,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:12" (1/1) ... [2020-10-16 04:43:12,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:43:12,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:43:12,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:43:12,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:43:12,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:12" (1/1) ... [2020-10-16 04:43:12,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:12" (1/1) ... [2020-10-16 04:43:12,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:12" (1/1) ... [2020-10-16 04:43:12,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:12" (1/1) ... [2020-10-16 04:43:12,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:12" (1/1) ... [2020-10-16 04:43:12,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:12" (1/1) ... [2020-10-16 04:43:12,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:12" (1/1) ... [2020-10-16 04:43:12,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:43:12,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:43:12,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:43:12,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:43:12,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:12" (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 [2020-10-16 04:43:12,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:43:12,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:43:12,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:43:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:43:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:43:12,924 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:43:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:43:12,924 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:43:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:43:12,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:43:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:43:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:43:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:43:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:43:12,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:43:12,931 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:43:15,400 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:43:15,400 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:43:15,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:43:15 BoogieIcfgContainer [2020-10-16 04:43:15,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:43:15,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:43:15,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:43:15,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:43:15,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:43:11" (1/3) ... [2020-10-16 04:43:15,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5696bb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:43:15, skipping insertion in model container [2020-10-16 04:43:15,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:12" (2/3) ... [2020-10-16 04:43:15,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5696bb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:43:15, skipping insertion in model container [2020-10-16 04:43:15,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:43:15" (3/3) ... [2020-10-16 04:43:15,411 INFO L111 eAbstractionObserver]: Analyzing ICFG mix018_tso.opt.i [2020-10-16 04:43:15,422 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:43:15,431 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:43:15,432 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:43:15,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,468 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,468 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,469 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,469 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,471 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,471 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,480 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,480 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,480 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,481 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,501 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,507 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,508 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,511 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,516 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,516 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:15,533 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:43:15,553 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:43:15,553 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:43:15,554 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:43:15,554 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:43:15,554 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:43:15,554 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:43:15,554 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:43:15,554 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:43:15,568 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow [2020-10-16 04:43:15,615 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-16 04:43:15,615 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:43:15,620 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 04:43:15,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 110 transitions, 240 flow [2020-10-16 04:43:15,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 106 transitions, 224 flow [2020-10-16 04:43:15,630 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:43:15,632 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 106 transitions, 224 flow [2020-10-16 04:43:15,635 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 106 transitions, 224 flow [2020-10-16 04:43:15,635 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 117 places, 106 transitions, 224 flow [2020-10-16 04:43:15,659 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-16 04:43:15,660 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:43:15,661 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 04:43:15,664 INFO L117 LiptonReduction]: Number of co-enabled transitions 2340 [2020-10-16 04:43:15,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:15,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:15,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:15,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:15,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:15,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:15,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:15,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:15,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:15,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:15,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:15,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:15,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:15,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:15,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:15,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,176 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2020-10-16 04:43:16,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:16,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:16,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:16,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:16,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:16,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:16,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:43:16,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:16,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:16,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:16,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:16,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:16,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:16,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:43:16,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:16,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:16,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:17,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:17,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:17,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:17,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:17,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:17,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:17,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:17,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:17,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:17,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:17,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:17,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:17,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:17,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:17,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:43:17,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:43:17,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:17,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:43:17,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:17,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:43:17,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:18,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:18,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:18,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:18,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:18,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:18,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:18,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:43:18,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:19,568 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 04:43:19,685 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 04:43:19,816 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 04:43:19,951 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 04:43:19,960 INFO L132 LiptonReduction]: Checked pairs total: 5958 [2020-10-16 04:43:19,961 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-16 04:43:19,989 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4361 [2020-10-16 04:43:20,002 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2020-10-16 04:43:20,003 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:43:20,003 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:20,004 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:20,004 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2017444172, now seen corresponding path program 1 times [2020-10-16 04:43:20,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:20,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359527694] [2020-10-16 04:43:20,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:20,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359527694] [2020-10-16 04:43:20,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:20,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:43:20,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323289936] [2020-10-16 04:43:20,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:43:20,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:20,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:43:20,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:43:20,301 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 199 [2020-10-16 04:43:20,303 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states. [2020-10-16 04:43:20,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:20,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 199 [2020-10-16 04:43:20,305 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:20,368 INFO L129 PetriNetUnfolder]: 13/57 cut-off events. [2020-10-16 04:43:20,369 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:43:20,369 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 57 events. 13/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 147 event pairs, 1 based on Foata normal form. 8/63 useless extension candidates. Maximal degree in co-relation 89. Up to 25 conditions per place. [2020-10-16 04:43:20,371 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 6 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2020-10-16 04:43:20,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 86 flow [2020-10-16 04:43:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:43:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:43:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2020-10-16 04:43:20,389 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8777219430485762 [2020-10-16 04:43:20,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2020-10-16 04:43:20,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2020-10-16 04:43:20,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:20,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2020-10-16 04:43:20,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:43:20,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:43:20,407 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:43:20,409 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 524 transitions. [2020-10-16 04:43:20,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 86 flow [2020-10-16 04:43:20,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 82 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:43:20,415 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 66 flow [2020-10-16 04:43:20,417 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2020-10-16 04:43:20,418 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2020-10-16 04:43:20,418 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2020-10-16 04:43:20,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:43:20,419 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:20,419 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:20,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:43:20,419 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:20,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2095083106, now seen corresponding path program 1 times [2020-10-16 04:43:20,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:20,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778737775] [2020-10-16 04:43:20,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:20,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778737775] [2020-10-16 04:43:20,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:20,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:43:20,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608507605] [2020-10-16 04:43:20,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:43:20,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:20,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:43:20,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:43:20,534 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2020-10-16 04:43:20,536 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand 4 states. [2020-10-16 04:43:20,536 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:20,536 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2020-10-16 04:43:20,536 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:20,595 INFO L129 PetriNetUnfolder]: 13/61 cut-off events. [2020-10-16 04:43:20,595 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:43:20,596 INFO L80 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 61 events. 13/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 170 event pairs, 2 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 96. Up to 15 conditions per place. [2020-10-16 04:43:20,596 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 4 selfloop transitions, 3 changer transitions 8/36 dead transitions. [2020-10-16 04:43:20,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 114 flow [2020-10-16 04:43:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:43:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:43:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 847 transitions. [2020-10-16 04:43:20,600 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8512562814070351 [2020-10-16 04:43:20,601 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 847 transitions. [2020-10-16 04:43:20,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 847 transitions. [2020-10-16 04:43:20,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:20,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 847 transitions. [2020-10-16 04:43:20,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:43:20,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:43:20,607 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:43:20,607 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 5 states and 847 transitions. [2020-10-16 04:43:20,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 114 flow [2020-10-16 04:43:20,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:43:20,609 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 87 flow [2020-10-16 04:43:20,609 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2020-10-16 04:43:20,609 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2020-10-16 04:43:20,610 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 87 flow [2020-10-16 04:43:20,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:43:20,610 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:20,610 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:20,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:43:20,610 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:20,611 INFO L82 PathProgramCache]: Analyzing trace with hash -729486292, now seen corresponding path program 1 times [2020-10-16 04:43:20,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:20,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078103281] [2020-10-16 04:43:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:20,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078103281] [2020-10-16 04:43:20,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:20,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:43:20,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637905277] [2020-10-16 04:43:20,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:43:20,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:20,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:43:20,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:43:20,724 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:43:20,725 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 87 flow. Second operand 4 states. [2020-10-16 04:43:20,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:20,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:43:20,725 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:20,774 INFO L129 PetriNetUnfolder]: 7/55 cut-off events. [2020-10-16 04:43:20,774 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2020-10-16 04:43:20,774 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 55 events. 7/55 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 3 based on Foata normal form. 5/56 useless extension candidates. Maximal degree in co-relation 103. Up to 17 conditions per place. [2020-10-16 04:43:20,775 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 2 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2020-10-16 04:43:20,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 105 flow [2020-10-16 04:43:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:43:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:43:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 848 transitions. [2020-10-16 04:43:20,778 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8522613065326633 [2020-10-16 04:43:20,778 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 848 transitions. [2020-10-16 04:43:20,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 848 transitions. [2020-10-16 04:43:20,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:20,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 848 transitions. [2020-10-16 04:43:20,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:43:20,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:43:20,783 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:43:20,783 INFO L185 Difference]: Start difference. First operand has 43 places, 28 transitions, 87 flow. Second operand 5 states and 848 transitions. [2020-10-16 04:43:20,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 105 flow [2020-10-16 04:43:20,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 30 transitions, 100 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:43:20,785 INFO L241 Difference]: Finished difference. Result has 45 places, 28 transitions, 94 flow [2020-10-16 04:43:20,786 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2020-10-16 04:43:20,786 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2020-10-16 04:43:20,786 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 94 flow [2020-10-16 04:43:20,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:43:20,786 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:20,786 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:20,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:43:20,787 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:20,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:20,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1848503123, now seen corresponding path program 1 times [2020-10-16 04:43:20,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:20,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398837512] [2020-10-16 04:43:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:20,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398837512] [2020-10-16 04:43:20,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:20,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:43:20,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025898017] [2020-10-16 04:43:20,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:43:20,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:20,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:43:20,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:43:20,915 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2020-10-16 04:43:20,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 94 flow. Second operand 4 states. [2020-10-16 04:43:20,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:20,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2020-10-16 04:43:20,916 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:21,006 INFO L129 PetriNetUnfolder]: 152/310 cut-off events. [2020-10-16 04:43:21,007 INFO L130 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2020-10-16 04:43:21,010 INFO L80 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 310 events. 152/310 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1586 event pairs, 78 based on Foata normal form. 20/294 useless extension candidates. Maximal degree in co-relation 711. Up to 160 conditions per place. [2020-10-16 04:43:21,012 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 9 selfloop transitions, 9 changer transitions 2/41 dead transitions. [2020-10-16 04:43:21,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 160 flow [2020-10-16 04:43:21,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:43:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:43:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 832 transitions. [2020-10-16 04:43:21,015 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8361809045226131 [2020-10-16 04:43:21,016 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 832 transitions. [2020-10-16 04:43:21,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 832 transitions. [2020-10-16 04:43:21,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:21,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 832 transitions. [2020-10-16 04:43:21,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:43:21,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:43:21,020 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:43:21,020 INFO L185 Difference]: Start difference. First operand has 45 places, 28 transitions, 94 flow. Second operand 5 states and 832 transitions. [2020-10-16 04:43:21,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 160 flow [2020-10-16 04:43:21,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 152 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:43:21,024 INFO L241 Difference]: Finished difference. Result has 46 places, 36 transitions, 155 flow [2020-10-16 04:43:21,024 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2020-10-16 04:43:21,025 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2020-10-16 04:43:21,025 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 155 flow [2020-10-16 04:43:21,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:43:21,025 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:21,025 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:21,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:43:21,026 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:21,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash -719775698, now seen corresponding path program 1 times [2020-10-16 04:43:21,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:21,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247469785] [2020-10-16 04:43:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:21,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247469785] [2020-10-16 04:43:21,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:21,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:43:21,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063005211] [2020-10-16 04:43:21,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:43:21,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:21,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:43:21,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:43:21,111 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2020-10-16 04:43:21,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 155 flow. Second operand 4 states. [2020-10-16 04:43:21,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:21,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2020-10-16 04:43:21,112 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:21,199 INFO L129 PetriNetUnfolder]: 202/445 cut-off events. [2020-10-16 04:43:21,199 INFO L130 PetriNetUnfolder]: For 345/488 co-relation queries the response was YES. [2020-10-16 04:43:21,202 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 445 events. 202/445 cut-off events. For 345/488 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2724 event pairs, 105 based on Foata normal form. 31/428 useless extension candidates. Maximal degree in co-relation 1332. Up to 293 conditions per place. [2020-10-16 04:43:21,205 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 5 selfloop transitions, 5 changer transitions 4/39 dead transitions. [2020-10-16 04:43:21,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 191 flow [2020-10-16 04:43:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:43:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:43:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 841 transitions. [2020-10-16 04:43:21,208 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8452261306532663 [2020-10-16 04:43:21,208 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 841 transitions. [2020-10-16 04:43:21,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 841 transitions. [2020-10-16 04:43:21,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:21,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 841 transitions. [2020-10-16 04:43:21,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:43:21,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:43:21,213 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:43:21,213 INFO L185 Difference]: Start difference. First operand has 46 places, 36 transitions, 155 flow. Second operand 5 states and 841 transitions. [2020-10-16 04:43:21,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 191 flow [2020-10-16 04:43:21,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 182 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 04:43:21,217 INFO L241 Difference]: Finished difference. Result has 52 places, 34 transitions, 157 flow [2020-10-16 04:43:21,217 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2020-10-16 04:43:21,217 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2020-10-16 04:43:21,218 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 157 flow [2020-10-16 04:43:21,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:43:21,218 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:21,218 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:21,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:43:21,218 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:21,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:21,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1009352506, now seen corresponding path program 1 times [2020-10-16 04:43:21,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:21,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6660712] [2020-10-16 04:43:21,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:21,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6660712] [2020-10-16 04:43:21,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:21,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:43:21,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984036620] [2020-10-16 04:43:21,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:43:21,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:21,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:43:21,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:43:21,343 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2020-10-16 04:43:21,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 157 flow. Second operand 5 states. [2020-10-16 04:43:21,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:21,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2020-10-16 04:43:21,345 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:21,453 INFO L129 PetriNetUnfolder]: 140/326 cut-off events. [2020-10-16 04:43:21,453 INFO L130 PetriNetUnfolder]: For 492/747 co-relation queries the response was YES. [2020-10-16 04:43:21,455 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 326 events. 140/326 cut-off events. For 492/747 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1750 event pairs, 34 based on Foata normal form. 36/331 useless extension candidates. Maximal degree in co-relation 1225. Up to 220 conditions per place. [2020-10-16 04:43:21,458 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 6 selfloop transitions, 9 changer transitions 9/47 dead transitions. [2020-10-16 04:43:21,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 281 flow [2020-10-16 04:43:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:43:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:43:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 998 transitions. [2020-10-16 04:43:21,462 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8358458961474037 [2020-10-16 04:43:21,462 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 998 transitions. [2020-10-16 04:43:21,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 998 transitions. [2020-10-16 04:43:21,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:21,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 998 transitions. [2020-10-16 04:43:21,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:43:21,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:43:21,468 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:43:21,468 INFO L185 Difference]: Start difference. First operand has 52 places, 34 transitions, 157 flow. Second operand 6 states and 998 transitions. [2020-10-16 04:43:21,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 281 flow [2020-10-16 04:43:21,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 270 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 04:43:21,474 INFO L241 Difference]: Finished difference. Result has 56 places, 38 transitions, 218 flow [2020-10-16 04:43:21,475 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2020-10-16 04:43:21,475 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2020-10-16 04:43:21,475 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 218 flow [2020-10-16 04:43:21,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:43:21,475 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:21,475 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:21,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:43:21,476 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1750769569, now seen corresponding path program 1 times [2020-10-16 04:43:21,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:21,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22492545] [2020-10-16 04:43:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:21,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22492545] [2020-10-16 04:43:21,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:21,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:43:21,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031163445] [2020-10-16 04:43:21,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:43:21,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:43:21,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:43:21,637 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2020-10-16 04:43:21,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 218 flow. Second operand 6 states. [2020-10-16 04:43:21,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:21,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2020-10-16 04:43:21,638 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:21,720 INFO L129 PetriNetUnfolder]: 72/185 cut-off events. [2020-10-16 04:43:21,721 INFO L130 PetriNetUnfolder]: For 517/900 co-relation queries the response was YES. [2020-10-16 04:43:21,721 INFO L80 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 185 events. 72/185 cut-off events. For 517/900 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 767 event pairs, 5 based on Foata normal form. 37/205 useless extension candidates. Maximal degree in co-relation 903. Up to 132 conditions per place. [2020-10-16 04:43:21,723 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 6 selfloop transitions, 13 changer transitions 11/51 dead transitions. [2020-10-16 04:43:21,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 51 transitions, 400 flow [2020-10-16 04:43:21,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:43:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:43:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1164 transitions. [2020-10-16 04:43:21,727 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8356066044508256 [2020-10-16 04:43:21,727 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1164 transitions. [2020-10-16 04:43:21,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1164 transitions. [2020-10-16 04:43:21,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:21,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1164 transitions. [2020-10-16 04:43:21,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:43:21,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:43:21,733 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:43:21,733 INFO L185 Difference]: Start difference. First operand has 56 places, 38 transitions, 218 flow. Second operand 7 states and 1164 transitions. [2020-10-16 04:43:21,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 51 transitions, 400 flow [2020-10-16 04:43:21,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 338 flow, removed 26 selfloop flow, removed 4 redundant places. [2020-10-16 04:43:21,737 INFO L241 Difference]: Finished difference. Result has 59 places, 40 transitions, 254 flow [2020-10-16 04:43:21,737 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2020-10-16 04:43:21,737 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2020-10-16 04:43:21,737 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 254 flow [2020-10-16 04:43:21,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:43:21,738 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:21,738 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:21,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:43:21,738 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:21,739 INFO L82 PathProgramCache]: Analyzing trace with hash 45172589, now seen corresponding path program 1 times [2020-10-16 04:43:21,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:21,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948537451] [2020-10-16 04:43:21,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:21,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948537451] [2020-10-16 04:43:21,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:21,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:43:21,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437716836] [2020-10-16 04:43:21,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:43:21,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:21,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:43:21,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:43:21,808 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2020-10-16 04:43:21,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 254 flow. Second operand 5 states. [2020-10-16 04:43:21,809 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:21,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2020-10-16 04:43:21,809 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:21,869 INFO L129 PetriNetUnfolder]: 101/250 cut-off events. [2020-10-16 04:43:21,869 INFO L130 PetriNetUnfolder]: For 1042/1244 co-relation queries the response was YES. [2020-10-16 04:43:21,870 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 250 events. 101/250 cut-off events. For 1042/1244 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1163 event pairs, 9 based on Foata normal form. 15/235 useless extension candidates. Maximal degree in co-relation 1112. Up to 163 conditions per place. [2020-10-16 04:43:21,872 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 7 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2020-10-16 04:43:21,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 308 flow [2020-10-16 04:43:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:43:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:43:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2020-10-16 04:43:21,875 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8251256281407036 [2020-10-16 04:43:21,876 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2020-10-16 04:43:21,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2020-10-16 04:43:21,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:21,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2020-10-16 04:43:21,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:43:21,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:43:21,880 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:43:21,880 INFO L185 Difference]: Start difference. First operand has 59 places, 40 transitions, 254 flow. Second operand 5 states and 821 transitions. [2020-10-16 04:43:21,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 308 flow [2020-10-16 04:43:21,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 242 flow, removed 24 selfloop flow, removed 7 redundant places. [2020-10-16 04:43:21,885 INFO L241 Difference]: Finished difference. Result has 55 places, 41 transitions, 211 flow [2020-10-16 04:43:21,885 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2020-10-16 04:43:21,885 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2020-10-16 04:43:21,886 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 211 flow [2020-10-16 04:43:21,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:43:21,886 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:21,886 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:21,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:43:21,886 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:21,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:21,887 INFO L82 PathProgramCache]: Analyzing trace with hash 392317353, now seen corresponding path program 2 times [2020-10-16 04:43:21,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:21,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52781114] [2020-10-16 04:43:21,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:22,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52781114] [2020-10-16 04:43:22,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:22,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:43:22,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415412666] [2020-10-16 04:43:22,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:43:22,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:22,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:43:22,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:43:22,096 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2020-10-16 04:43:22,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 211 flow. Second operand 7 states. [2020-10-16 04:43:22,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:22,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2020-10-16 04:43:22,097 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:22,197 INFO L129 PetriNetUnfolder]: 77/185 cut-off events. [2020-10-16 04:43:22,197 INFO L130 PetriNetUnfolder]: For 444/799 co-relation queries the response was YES. [2020-10-16 04:43:22,198 INFO L80 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 185 events. 77/185 cut-off events. For 444/799 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 740 event pairs, 0 based on Foata normal form. 65/220 useless extension candidates. Maximal degree in co-relation 716. Up to 101 conditions per place. [2020-10-16 04:43:22,199 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 2 selfloop transitions, 17 changer transitions 7/46 dead transitions. [2020-10-16 04:43:22,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 46 transitions, 307 flow [2020-10-16 04:43:22,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:43:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:43:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1322 transitions. [2020-10-16 04:43:22,203 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8304020100502513 [2020-10-16 04:43:22,203 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1322 transitions. [2020-10-16 04:43:22,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1322 transitions. [2020-10-16 04:43:22,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:22,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1322 transitions. [2020-10-16 04:43:22,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:43:22,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:43:22,210 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:43:22,210 INFO L185 Difference]: Start difference. First operand has 55 places, 41 transitions, 211 flow. Second operand 8 states and 1322 transitions. [2020-10-16 04:43:22,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 46 transitions, 307 flow [2020-10-16 04:43:22,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 46 transitions, 278 flow, removed 13 selfloop flow, removed 4 redundant places. [2020-10-16 04:43:22,215 INFO L241 Difference]: Finished difference. Result has 60 places, 39 transitions, 228 flow [2020-10-16 04:43:22,215 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=228, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2020-10-16 04:43:22,215 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2020-10-16 04:43:22,216 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 228 flow [2020-10-16 04:43:22,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:43:22,216 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:22,216 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:22,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:43:22,218 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:22,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:22,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1020145348, now seen corresponding path program 1 times [2020-10-16 04:43:22,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:22,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114324949] [2020-10-16 04:43:22,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:22,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114324949] [2020-10-16 04:43:22,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:22,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:43:22,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427171375] [2020-10-16 04:43:22,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:43:22,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:22,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:43:22,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:43:22,318 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 199 [2020-10-16 04:43:22,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 228 flow. Second operand 5 states. [2020-10-16 04:43:22,319 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:22,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 199 [2020-10-16 04:43:22,319 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:22,364 INFO L129 PetriNetUnfolder]: 66/160 cut-off events. [2020-10-16 04:43:22,364 INFO L130 PetriNetUnfolder]: For 255/309 co-relation queries the response was YES. [2020-10-16 04:43:22,365 INFO L80 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 160 events. 66/160 cut-off events. For 255/309 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 641 event pairs, 0 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 559. Up to 69 conditions per place. [2020-10-16 04:43:22,366 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 4 selfloop transitions, 1 changer transitions 2/41 dead transitions. [2020-10-16 04:43:22,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 41 transitions, 250 flow [2020-10-16 04:43:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:43:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:43:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 833 transitions. [2020-10-16 04:43:22,369 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8371859296482412 [2020-10-16 04:43:22,369 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 833 transitions. [2020-10-16 04:43:22,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 833 transitions. [2020-10-16 04:43:22,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:22,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 833 transitions. [2020-10-16 04:43:22,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:43:22,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:43:22,373 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:43:22,373 INFO L185 Difference]: Start difference. First operand has 60 places, 39 transitions, 228 flow. Second operand 5 states and 833 transitions. [2020-10-16 04:43:22,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 41 transitions, 250 flow [2020-10-16 04:43:22,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 184 flow, removed 17 selfloop flow, removed 10 redundant places. [2020-10-16 04:43:22,376 INFO L241 Difference]: Finished difference. Result has 55 places, 39 transitions, 173 flow [2020-10-16 04:43:22,377 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2020-10-16 04:43:22,377 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2020-10-16 04:43:22,377 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 173 flow [2020-10-16 04:43:22,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:43:22,377 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:22,377 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:22,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:43:22,378 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:22,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1848118636, now seen corresponding path program 2 times [2020-10-16 04:43:22,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:22,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694998933] [2020-10-16 04:43:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:22,664 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 25 [2020-10-16 04:43:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:22,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694998933] [2020-10-16 04:43:22,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:22,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:43:22,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032022009] [2020-10-16 04:43:22,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:43:22,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:22,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:43:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:43:22,768 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 199 [2020-10-16 04:43:22,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 173 flow. Second operand 8 states. [2020-10-16 04:43:22,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:22,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 199 [2020-10-16 04:43:22,769 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:23,152 INFO L129 PetriNetUnfolder]: 104/255 cut-off events. [2020-10-16 04:43:23,152 INFO L130 PetriNetUnfolder]: For 213/225 co-relation queries the response was YES. [2020-10-16 04:43:23,153 INFO L80 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 255 events. 104/255 cut-off events. For 213/225 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1224 event pairs, 0 based on Foata normal form. 2/236 useless extension candidates. Maximal degree in co-relation 698. Up to 82 conditions per place. [2020-10-16 04:43:23,154 INFO L132 encePairwiseOnDemand]: 191/199 looper letters, 4 selfloop transitions, 6 changer transitions 7/47 dead transitions. [2020-10-16 04:43:23,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 47 transitions, 225 flow [2020-10-16 04:43:23,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 04:43:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 04:43:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1437 transitions. [2020-10-16 04:43:23,160 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7221105527638191 [2020-10-16 04:43:23,160 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1437 transitions. [2020-10-16 04:43:23,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1437 transitions. [2020-10-16 04:43:23,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:23,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1437 transitions. [2020-10-16 04:43:23,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 04:43:23,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 04:43:23,172 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 04:43:23,172 INFO L185 Difference]: Start difference. First operand has 55 places, 39 transitions, 173 flow. Second operand 10 states and 1437 transitions. [2020-10-16 04:43:23,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 47 transitions, 225 flow [2020-10-16 04:43:23,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 47 transitions, 218 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 04:43:23,177 INFO L241 Difference]: Finished difference. Result has 64 places, 40 transitions, 194 flow [2020-10-16 04:43:23,178 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2020-10-16 04:43:23,178 INFO L342 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2020-10-16 04:43:23,178 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 194 flow [2020-10-16 04:43:23,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:43:23,178 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:23,178 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:23,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:43:23,179 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:23,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2086061028, now seen corresponding path program 3 times [2020-10-16 04:43:23,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:23,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895061807] [2020-10-16 04:43:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:43:23,220 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:43:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:43:23,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:43:23,327 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:43:23,327 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:43:23,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:43:23,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,361 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,362 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,362 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,363 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,364 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,365 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,366 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,368 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:43:23 BasicIcfg [2020-10-16 04:43:23,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:43:23,455 INFO L168 Benchmark]: Toolchain (without parser) took 11504.45 ms. Allocated memory was 253.2 MB in the beginning and 591.4 MB in the end (delta: 338.2 MB). Free memory was 208.6 MB in the beginning and 288.5 MB in the end (delta: -80.0 MB). Peak memory consumption was 258.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:43:23,456 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:43:23,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.05 ms. Allocated memory was 253.2 MB in the beginning and 319.3 MB in the end (delta: 66.1 MB). Free memory was 208.6 MB in the beginning and 269.5 MB in the end (delta: -60.9 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:43:23,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.99 ms. Allocated memory is still 319.3 MB. Free memory was 269.5 MB in the beginning and 266.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:43:23,460 INFO L168 Benchmark]: Boogie Preprocessor took 39.79 ms. Allocated memory is still 319.3 MB. Free memory was 266.9 MB in the beginning and 261.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 14.2 GB. [2020-10-16 04:43:23,461 INFO L168 Benchmark]: RCFGBuilder took 2570.82 ms. Allocated memory was 319.3 MB in the beginning and 371.7 MB in the end (delta: 52.4 MB). Free memory was 261.9 MB in the beginning and 313.6 MB in the end (delta: -51.8 MB). Peak memory consumption was 141.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:43:23,462 INFO L168 Benchmark]: TraceAbstraction took 8044.26 ms. Allocated memory was 371.7 MB in the beginning and 591.4 MB in the end (delta: 219.7 MB). Free memory was 313.6 MB in the beginning and 288.5 MB in the end (delta: 25.1 MB). Peak memory consumption was 244.8 MB. Max. memory is 14.2 GB. [2020-10-16 04:43:23,470 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 774.05 ms. Allocated memory was 253.2 MB in the beginning and 319.3 MB in the end (delta: 66.1 MB). Free memory was 208.6 MB in the beginning and 269.5 MB in the end (delta: -60.9 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 69.99 ms. Allocated memory is still 319.3 MB. Free memory was 269.5 MB in the beginning and 266.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.79 ms. Allocated memory is still 319.3 MB. Free memory was 266.9 MB in the beginning and 261.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2570.82 ms. Allocated memory was 319.3 MB in the beginning and 371.7 MB in the end (delta: 52.4 MB). Free memory was 261.9 MB in the beginning and 313.6 MB in the end (delta: -51.8 MB). Peak memory consumption was 141.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8044.26 ms. Allocated memory was 371.7 MB in the beginning and 591.4 MB in the end (delta: 219.7 MB). Free memory was 313.6 MB in the beginning and 288.5 MB in the end (delta: 25.1 MB). Peak memory consumption was 244.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1569 VarBasedMoverChecksPositive, 81 VarBasedMoverChecksNegative, 27 SemBasedMoverChecksPositive, 54 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 216 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.3s, 117 PlacesBefore, 41 PlacesAfterwards, 106 TransitionsBefore, 29 TransitionsAfterwards, 2340 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 5958 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff0_thd4; [L725] 0 _Bool z$r_buff1_thd0; [L726] 0 _Bool z$r_buff1_thd1; [L727] 0 _Bool z$r_buff1_thd2; [L728] 0 _Bool z$r_buff1_thd3; [L729] 0 _Bool z$r_buff1_thd4; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L853] 0 pthread_t t493; [L854] FCALL, FORK 0 pthread_create(&t493, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t494; [L856] FCALL, FORK 0 pthread_create(&t494, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t495; [L858] FCALL, FORK 0 pthread_create(&t495, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 pthread_t t496; [L860] FCALL, FORK 0 pthread_create(&t496, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 4 z$w_buff1 = z$w_buff0 [L800] 4 z$w_buff0 = 1 [L801] 4 z$w_buff1_used = z$w_buff0_used [L802] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L804] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L805] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L806] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L807] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L808] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L809] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 4 z$flush_delayed = weak$$choice2 [L815] 4 z$mem_tmp = z [L816] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L816] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L817] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0) [L817] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L818] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L818] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L819] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L819] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L821] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4) [L821] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L821] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L822] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0 [L822] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L822] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L823] 4 __unbuffered_p3_EAX = z [L824] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L824] 4 z = z$flush_delayed ? z$mem_tmp : z [L825] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 3 z$flush_delayed = weak$$choice2 [L777] 3 z$mem_tmp = z [L778] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L779] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L779] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L780] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L782] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L783] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L784] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L784] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] 3 __unbuffered_p2_EAX = z [L786] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L786] 3 z = z$flush_delayed ? z$mem_tmp : z [L787] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L831] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L831] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L831] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L832] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L832] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L834] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L835] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L866] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L866] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L867] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L867] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L868] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L869] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L870] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L873] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 109 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 7.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 49 SDtfs, 38 SDslu, 50 SDs, 0 SdLazy, 258 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 18392 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...