/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/pthread-wmm/safe023_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 11:11:18,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 11:11:18,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 11:11:18,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 11:11:18,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 11:11:18,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 11:11:18,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 11:11:18,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 11:11:18,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 11:11:18,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 11:11:18,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 11:11:18,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 11:11:18,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 11:11:18,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 11:11:18,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 11:11:18,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 11:11:18,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 11:11:18,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 11:11:18,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 11:11:18,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 11:11:18,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 11:11:18,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 11:11:18,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 11:11:18,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 11:11:18,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 11:11:18,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 11:11:18,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 11:11:18,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 11:11:18,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 11:11:18,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 11:11:18,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 11:11:18,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 11:11:18,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 11:11:18,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 11:11:18,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 11:11:18,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 11:11:18,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 11:11:18,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 11:11:18,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 11:11:18,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 11:11:18,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 11:11:18,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 11:11:19,000 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 11:11:19,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 11:11:19,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 11:11:19,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 11:11:19,003 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 11:11:19,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 11:11:19,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 11:11:19,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 11:11:19,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 11:11:19,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 11:11:19,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 11:11:19,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 11:11:19,007 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 11:11:19,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 11:11:19,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 11:11:19,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 11:11:19,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 11:11:19,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 11:11:19,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 11:11:19,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 11:11:19,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 11:11:19,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 11:11:19,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 11:11:19,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 11:11:19,010 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 11:11:19,011 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 11:11:19,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 11:11:19,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 11:11:19,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 11:11:19,514 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 11:11:19,515 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 11:11:19,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe023_pso.oepc.i [2020-12-22 11:11:19,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfa0deee/1bebd8649d064491822d1823b7405128/FLAG8aa4d1acf [2020-12-22 11:11:20,464 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 11:11:20,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_pso.oepc.i [2020-12-22 11:11:20,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfa0deee/1bebd8649d064491822d1823b7405128/FLAG8aa4d1acf [2020-12-22 11:11:20,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfa0deee/1bebd8649d064491822d1823b7405128 [2020-12-22 11:11:20,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 11:11:20,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 11:11:20,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 11:11:20,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 11:11:20,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 11:11:20,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:11:20" (1/1) ... [2020-12-22 11:11:20,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e70e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:20, skipping insertion in model container [2020-12-22 11:11:20,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:11:20" (1/1) ... [2020-12-22 11:11:20,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 11:11:20,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 11:11:20,968 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_pso.oepc.i[993,1006] [2020-12-22 11:11:21,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 11:11:21,362 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 11:11:21,381 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe023_pso.oepc.i[993,1006] [2020-12-22 11:11:21,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 11:11:21,543 INFO L208 MainTranslator]: Completed translation [2020-12-22 11:11:21,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:21 WrapperNode [2020-12-22 11:11:21,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 11:11:21,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 11:11:21,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 11:11:21,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 11:11:21,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:21" (1/1) ... [2020-12-22 11:11:21,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:21" (1/1) ... [2020-12-22 11:11:21,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 11:11:21,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 11:11:21,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 11:11:21,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 11:11:21,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:21" (1/1) ... [2020-12-22 11:11:21,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:21" (1/1) ... [2020-12-22 11:11:21,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:21" (1/1) ... [2020-12-22 11:11:21,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:21" (1/1) ... [2020-12-22 11:11:21,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:21" (1/1) ... [2020-12-22 11:11:21,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:21" (1/1) ... [2020-12-22 11:11:21,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:21" (1/1) ... [2020-12-22 11:11:21,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 11:11:21,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 11:11:21,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 11:11:21,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 11:11:21,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 11:11:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 11:11:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-22 11:11:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 11:11:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 11:11:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-22 11:11:21,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-22 11:11:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-22 11:11:21,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-22 11:11:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-22 11:11:21,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-22 11:11:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 11:11:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-22 11:11:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 11:11:21,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 11:11:21,850 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-22 11:11:25,498 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 11:11:25,499 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-22 11:11:25,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:11:25 BoogieIcfgContainer [2020-12-22 11:11:25,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 11:11:25,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 11:11:25,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 11:11:25,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 11:11:25,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 11:11:20" (1/3) ... [2020-12-22 11:11:25,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1377d3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:11:25, skipping insertion in model container [2020-12-22 11:11:25,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:11:21" (2/3) ... [2020-12-22 11:11:25,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1377d3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:11:25, skipping insertion in model container [2020-12-22 11:11:25,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:11:25" (3/3) ... [2020-12-22 11:11:25,511 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_pso.oepc.i [2020-12-22 11:11:25,519 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-22 11:11:25,520 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 11:11:25,526 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 11:11:25,527 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-22 11:11:25,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,573 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,575 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,576 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,596 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,596 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,597 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,597 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,597 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,604 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,604 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,628 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,633 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,633 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,633 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,633 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,637 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,638 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:11:25,642 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-22 11:11:25,663 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-22 11:11:25,687 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 11:11:25,687 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 11:11:25,687 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 11:11:25,687 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 11:11:25,688 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 11:11:25,688 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 11:11:25,688 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 11:11:25,688 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 11:11:25,702 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-22 11:11:25,705 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 213 flow [2020-12-22 11:11:25,708 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 213 flow [2020-12-22 11:11:25,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2020-12-22 11:11:25,761 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2020-12-22 11:11:25,761 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-22 11:11:25,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-12-22 11:11:25,770 INFO L116 LiptonReduction]: Number of co-enabled transitions 1786 [2020-12-22 11:11:26,878 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-22 11:11:26,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:26,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:26,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:26,886 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-22 11:11:26,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:27,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-22 11:11:27,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:27,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-22 11:11:27,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:27,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-22 11:11:27,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:27,308 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 11:11:27,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:27,310 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 11:11:27,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:28,400 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-12-22 11:11:28,826 WARN L197 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-12-22 11:11:31,015 WARN L197 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-12-22 11:11:31,946 WARN L197 SmtUtils]: Spent 928.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2020-12-22 11:11:32,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-22 11:11:32,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:32,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-22 11:11:32,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:32,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:32,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:32,182 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-22 11:11:32,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:32,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 11:11:32,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:32,558 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 11:11:32,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:32,596 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-22 11:11:32,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:32,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-22 11:11:32,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:32,717 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:32,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:32,719 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:32,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:32,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:32,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:32,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:32,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:32,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:32,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:32,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:32,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:32,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:32,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:32,756 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:32,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:32,825 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:32,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:11:32,829 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:32,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:32,879 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:32,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:32,888 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:11:32,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:11:32,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:11:32,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:11:32,891 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:11:32,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:11:32,894 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:32,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:32,895 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:32,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:32,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:32,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:32,963 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:32,964 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:32,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:11:32,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:11:32,981 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:11:32,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:11:32,983 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:11:32,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:11:32,986 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:32,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:32,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:32,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:32,990 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:32,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:33,049 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:33,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:11:33,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:33,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:33,091 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,095 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,098 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,188 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,190 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,193 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,218 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,222 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,286 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,287 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,289 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,291 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,318 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,320 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,323 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,327 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,588 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:11:33,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:11:33,605 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:11:33,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:11:33,607 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:11:33,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:11:33,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:33,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:33,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:33,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:33,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:33,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:33,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:33,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:11:33,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:33,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:33,708 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,709 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,711 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,714 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,737 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,738 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,740 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,743 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,905 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,928 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,929 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:33,931 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,931 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:33,934 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:33,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:11:34,009 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:34,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:11:34,013 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:34,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:34,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:11:34,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:34,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:11:34,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:11:34,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:11:34,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:11:34,073 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:11:34,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:11:34,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:34,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:34,078 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:34,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:34,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:11:34,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:11:34,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-22 11:11:34,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:11:34,806 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-12-22 11:11:34,924 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-22 11:11:35,444 WARN L197 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2020-12-22 11:11:35,648 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-22 11:11:36,358 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-22 11:11:36,524 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-22 11:11:37,215 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-12-22 11:11:37,682 WARN L197 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-12-22 11:11:37,890 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-22 11:11:38,304 WARN L197 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-12-22 11:11:38,495 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-22 11:11:38,503 INFO L131 LiptonReduction]: Checked pairs total: 4941 [2020-12-22 11:11:38,503 INFO L133 LiptonReduction]: Total number of compositions: 83 [2020-12-22 11:11:38,511 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-12-22 11:11:38,596 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1166 states. [2020-12-22 11:11:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states. [2020-12-22 11:11:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-22 11:11:38,604 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:38,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-22 11:11:38,605 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:38,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:38,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1729429653, now seen corresponding path program 1 times [2020-12-22 11:11:38,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:38,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478961297] [2020-12-22 11:11:38,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:38,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478961297] [2020-12-22 11:11:38,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:38,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 11:11:38,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946338216] [2020-12-22 11:11:38,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 11:11:38,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:38,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 11:11:38,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 11:11:38,944 INFO L87 Difference]: Start difference. First operand 1166 states. Second operand 3 states. [2020-12-22 11:11:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:39,102 INFO L93 Difference]: Finished difference Result 974 states and 3122 transitions. [2020-12-22 11:11:39,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 11:11:39,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-22 11:11:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:39,139 INFO L225 Difference]: With dead ends: 974 [2020-12-22 11:11:39,140 INFO L226 Difference]: Without dead ends: 824 [2020-12-22 11:11:39,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 11:11:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2020-12-22 11:11:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2020-12-22 11:11:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2020-12-22 11:11:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2607 transitions. [2020-12-22 11:11:39,278 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2607 transitions. Word has length 5 [2020-12-22 11:11:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:39,278 INFO L481 AbstractCegarLoop]: Abstraction has 824 states and 2607 transitions. [2020-12-22 11:11:39,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 11:11:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2607 transitions. [2020-12-22 11:11:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-22 11:11:39,281 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:39,281 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:11:39,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 11:11:39,283 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:39,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:39,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1605444359, now seen corresponding path program 1 times [2020-12-22 11:11:39,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:39,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121183071] [2020-12-22 11:11:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:39,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121183071] [2020-12-22 11:11:39,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:39,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 11:11:39,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264617440] [2020-12-22 11:11:39,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 11:11:39,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:39,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 11:11:39,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 11:11:39,610 INFO L87 Difference]: Start difference. First operand 824 states and 2607 transitions. Second operand 4 states. [2020-12-22 11:11:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:39,665 INFO L93 Difference]: Finished difference Result 824 states and 2507 transitions. [2020-12-22 11:11:39,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 11:11:39,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-22 11:11:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:39,673 INFO L225 Difference]: With dead ends: 824 [2020-12-22 11:11:39,673 INFO L226 Difference]: Without dead ends: 674 [2020-12-22 11:11:39,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:11:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-12-22 11:11:39,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2020-12-22 11:11:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-12-22 11:11:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 2067 transitions. [2020-12-22 11:11:39,708 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 2067 transitions. Word has length 10 [2020-12-22 11:11:39,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:39,709 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 2067 transitions. [2020-12-22 11:11:39,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 11:11:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 2067 transitions. [2020-12-22 11:11:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-22 11:11:39,713 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:39,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:11:39,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 11:11:39,714 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash 318682642, now seen corresponding path program 1 times [2020-12-22 11:11:39,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:39,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212409856] [2020-12-22 11:11:39,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:39,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212409856] [2020-12-22 11:11:39,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:39,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 11:11:39,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437581885] [2020-12-22 11:11:39,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 11:11:39,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:39,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 11:11:39,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 11:11:39,994 INFO L87 Difference]: Start difference. First operand 674 states and 2067 transitions. Second operand 4 states. [2020-12-22 11:11:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:40,029 INFO L93 Difference]: Finished difference Result 719 states and 2148 transitions. [2020-12-22 11:11:40,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 11:11:40,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-22 11:11:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:40,034 INFO L225 Difference]: With dead ends: 719 [2020-12-22 11:11:40,035 INFO L226 Difference]: Without dead ends: 644 [2020-12-22 11:11:40,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:11:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-12-22 11:11:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2020-12-22 11:11:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2020-12-22 11:11:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1963 transitions. [2020-12-22 11:11:40,059 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1963 transitions. Word has length 13 [2020-12-22 11:11:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:40,060 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 1963 transitions. [2020-12-22 11:11:40,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 11:11:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1963 transitions. [2020-12-22 11:11:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-22 11:11:40,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:40,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:11:40,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 11:11:40,063 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:40,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:40,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1327934908, now seen corresponding path program 1 times [2020-12-22 11:11:40,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:40,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014141741] [2020-12-22 11:11:40,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:40,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014141741] [2020-12-22 11:11:40,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:40,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:11:40,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143500792] [2020-12-22 11:11:40,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 11:11:40,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:40,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 11:11:40,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:11:40,236 INFO L87 Difference]: Start difference. First operand 644 states and 1963 transitions. Second operand 7 states. [2020-12-22 11:11:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:40,587 INFO L93 Difference]: Finished difference Result 872 states and 2622 transitions. [2020-12-22 11:11:40,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 11:11:40,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-12-22 11:11:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:40,592 INFO L225 Difference]: With dead ends: 872 [2020-12-22 11:11:40,592 INFO L226 Difference]: Without dead ends: 452 [2020-12-22 11:11:40,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:11:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-12-22 11:11:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-12-22 11:11:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-12-22 11:11:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1295 transitions. [2020-12-22 11:11:40,610 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1295 transitions. Word has length 14 [2020-12-22 11:11:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:40,610 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1295 transitions. [2020-12-22 11:11:40,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 11:11:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1295 transitions. [2020-12-22 11:11:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 11:11:40,612 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:40,612 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:11:40,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 11:11:40,613 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:40,613 INFO L82 PathProgramCache]: Analyzing trace with hash 698930335, now seen corresponding path program 1 times [2020-12-22 11:11:40,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:40,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680283964] [2020-12-22 11:11:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:40,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680283964] [2020-12-22 11:11:40,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:40,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 11:11:40,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594100682] [2020-12-22 11:11:40,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 11:11:40,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:40,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 11:11:40,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 11:11:40,865 INFO L87 Difference]: Start difference. First operand 452 states and 1295 transitions. Second operand 6 states. [2020-12-22 11:11:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:41,172 INFO L93 Difference]: Finished difference Result 788 states and 2230 transitions. [2020-12-22 11:11:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:11:41,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-22 11:11:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:41,178 INFO L225 Difference]: With dead ends: 788 [2020-12-22 11:11:41,178 INFO L226 Difference]: Without dead ends: 623 [2020-12-22 11:11:41,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-22 11:11:41,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-12-22 11:11:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 548. [2020-12-22 11:11:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2020-12-22 11:11:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1536 transitions. [2020-12-22 11:11:41,200 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1536 transitions. Word has length 16 [2020-12-22 11:11:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:41,200 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 1536 transitions. [2020-12-22 11:11:41,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 11:11:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1536 transitions. [2020-12-22 11:11:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 11:11:41,202 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:41,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:11:41,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 11:11:41,202 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:41,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:41,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1981172119, now seen corresponding path program 2 times [2020-12-22 11:11:41,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:41,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350556473] [2020-12-22 11:11:41,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:41,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350556473] [2020-12-22 11:11:41,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:41,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 11:11:41,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328391671] [2020-12-22 11:11:41,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 11:11:41,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:41,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 11:11:41,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-22 11:11:41,463 INFO L87 Difference]: Start difference. First operand 548 states and 1536 transitions. Second operand 9 states. [2020-12-22 11:11:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:41,816 INFO L93 Difference]: Finished difference Result 610 states and 1682 transitions. [2020-12-22 11:11:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:11:41,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-12-22 11:11:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:41,821 INFO L225 Difference]: With dead ends: 610 [2020-12-22 11:11:41,822 INFO L226 Difference]: Without dead ends: 572 [2020-12-22 11:11:41,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-12-22 11:11:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-12-22 11:11:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 546. [2020-12-22 11:11:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-12-22 11:11:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1528 transitions. [2020-12-22 11:11:41,844 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1528 transitions. Word has length 16 [2020-12-22 11:11:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:41,844 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 1528 transitions. [2020-12-22 11:11:41,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 11:11:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1528 transitions. [2020-12-22 11:11:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 11:11:41,846 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:41,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:11:41,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 11:11:41,847 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash 191962061, now seen corresponding path program 1 times [2020-12-22 11:11:41,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:41,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140683629] [2020-12-22 11:11:41,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:41,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140683629] [2020-12-22 11:11:41,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:41,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 11:11:41,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691304181] [2020-12-22 11:11:41,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 11:11:41,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:41,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 11:11:41,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 11:11:41,964 INFO L87 Difference]: Start difference. First operand 546 states and 1528 transitions. Second operand 4 states. [2020-12-22 11:11:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:41,993 INFO L93 Difference]: Finished difference Result 524 states and 1309 transitions. [2020-12-22 11:11:41,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 11:11:41,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-22 11:11:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:41,997 INFO L225 Difference]: With dead ends: 524 [2020-12-22 11:11:41,997 INFO L226 Difference]: Without dead ends: 398 [2020-12-22 11:11:41,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:11:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2020-12-22 11:11:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2020-12-22 11:11:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-12-22 11:11:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 972 transitions. [2020-12-22 11:11:42,011 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 972 transitions. Word has length 17 [2020-12-22 11:11:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:42,011 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 972 transitions. [2020-12-22 11:11:42,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 11:11:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 972 transitions. [2020-12-22 11:11:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 11:11:42,013 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:42,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:11:42,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 11:11:42,013 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:42,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1568697210, now seen corresponding path program 1 times [2020-12-22 11:11:42,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:42,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858855729] [2020-12-22 11:11:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:42,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858855729] [2020-12-22 11:11:42,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:42,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 11:11:42,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862367062] [2020-12-22 11:11:42,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 11:11:42,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:42,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 11:11:42,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:11:42,140 INFO L87 Difference]: Start difference. First operand 398 states and 972 transitions. Second operand 5 states. [2020-12-22 11:11:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:42,181 INFO L93 Difference]: Finished difference Result 329 states and 747 transitions. [2020-12-22 11:11:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 11:11:42,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-12-22 11:11:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:42,183 INFO L225 Difference]: With dead ends: 329 [2020-12-22 11:11:42,184 INFO L226 Difference]: Without dead ends: 266 [2020-12-22 11:11:42,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:11:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-12-22 11:11:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 242. [2020-12-22 11:11:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-12-22 11:11:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 533 transitions. [2020-12-22 11:11:42,192 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 533 transitions. Word has length 18 [2020-12-22 11:11:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:42,192 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 533 transitions. [2020-12-22 11:11:42,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 11:11:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 533 transitions. [2020-12-22 11:11:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 11:11:42,193 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:42,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:11:42,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 11:11:42,194 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1078315176, now seen corresponding path program 1 times [2020-12-22 11:11:42,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:42,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549716140] [2020-12-22 11:11:42,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:42,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549716140] [2020-12-22 11:11:42,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:42,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:11:42,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133321545] [2020-12-22 11:11:42,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 11:11:42,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:42,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 11:11:42,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-22 11:11:42,326 INFO L87 Difference]: Start difference. First operand 242 states and 533 transitions. Second operand 6 states. [2020-12-22 11:11:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:42,391 INFO L93 Difference]: Finished difference Result 217 states and 481 transitions. [2020-12-22 11:11:42,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 11:11:42,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-22 11:11:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:42,394 INFO L225 Difference]: With dead ends: 217 [2020-12-22 11:11:42,394 INFO L226 Difference]: Without dead ends: 204 [2020-12-22 11:11:42,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-22 11:11:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-12-22 11:11:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 168. [2020-12-22 11:11:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-22 11:11:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 379 transitions. [2020-12-22 11:11:42,401 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 379 transitions. Word has length 20 [2020-12-22 11:11:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:42,401 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 379 transitions. [2020-12-22 11:11:42,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 11:11:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 379 transitions. [2020-12-22 11:11:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 11:11:42,402 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:42,402 INFO L422 BasicCegarLoop]: 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-12-22 11:11:42,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 11:11:42,403 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:42,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:42,403 INFO L82 PathProgramCache]: Analyzing trace with hash 391758024, now seen corresponding path program 1 times [2020-12-22 11:11:42,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:42,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641549676] [2020-12-22 11:11:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:42,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641549676] [2020-12-22 11:11:42,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:42,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:11:42,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094730013] [2020-12-22 11:11:42,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 11:11:42,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:42,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 11:11:42,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:11:42,656 INFO L87 Difference]: Start difference. First operand 168 states and 379 transitions. Second operand 7 states. [2020-12-22 11:11:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:43,073 INFO L93 Difference]: Finished difference Result 382 states and 813 transitions. [2020-12-22 11:11:43,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 11:11:43,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-22 11:11:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:43,075 INFO L225 Difference]: With dead ends: 382 [2020-12-22 11:11:43,075 INFO L226 Difference]: Without dead ends: 290 [2020-12-22 11:11:43,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:11:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-12-22 11:11:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 196. [2020-12-22 11:11:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-12-22 11:11:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 430 transitions. [2020-12-22 11:11:43,083 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 430 transitions. Word has length 23 [2020-12-22 11:11:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:43,083 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 430 transitions. [2020-12-22 11:11:43,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 11:11:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 430 transitions. [2020-12-22 11:11:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 11:11:43,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:43,084 INFO L422 BasicCegarLoop]: 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-12-22 11:11:43,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 11:11:43,085 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:43,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:43,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1956784696, now seen corresponding path program 2 times [2020-12-22 11:11:43,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:43,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261299833] [2020-12-22 11:11:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:43,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261299833] [2020-12-22 11:11:43,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:43,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:11:43,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113556721] [2020-12-22 11:11:43,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 11:11:43,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:43,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 11:11:43,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:11:43,365 INFO L87 Difference]: Start difference. First operand 196 states and 430 transitions. Second operand 7 states. [2020-12-22 11:11:43,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:43,638 INFO L93 Difference]: Finished difference Result 248 states and 530 transitions. [2020-12-22 11:11:43,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 11:11:43,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-22 11:11:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:43,640 INFO L225 Difference]: With dead ends: 248 [2020-12-22 11:11:43,640 INFO L226 Difference]: Without dead ends: 208 [2020-12-22 11:11:43,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-22 11:11:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-12-22 11:11:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 203. [2020-12-22 11:11:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-12-22 11:11:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 443 transitions. [2020-12-22 11:11:43,648 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 443 transitions. Word has length 23 [2020-12-22 11:11:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:43,648 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 443 transitions. [2020-12-22 11:11:43,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 11:11:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 443 transitions. [2020-12-22 11:11:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 11:11:43,650 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:43,650 INFO L422 BasicCegarLoop]: 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-12-22 11:11:43,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 11:11:43,650 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:43,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:43,651 INFO L82 PathProgramCache]: Analyzing trace with hash -406552664, now seen corresponding path program 3 times [2020-12-22 11:11:43,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:43,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395401048] [2020-12-22 11:11:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:43,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395401048] [2020-12-22 11:11:43,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:43,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 11:11:43,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758701297] [2020-12-22 11:11:43,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 11:11:43,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:43,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 11:11:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 11:11:43,867 INFO L87 Difference]: Start difference. First operand 203 states and 443 transitions. Second operand 8 states. [2020-12-22 11:11:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:44,210 INFO L93 Difference]: Finished difference Result 300 states and 630 transitions. [2020-12-22 11:11:44,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:11:44,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-12-22 11:11:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:44,212 INFO L225 Difference]: With dead ends: 300 [2020-12-22 11:11:44,212 INFO L226 Difference]: Without dead ends: 242 [2020-12-22 11:11:44,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:11:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-12-22 11:11:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 205. [2020-12-22 11:11:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-12-22 11:11:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 446 transitions. [2020-12-22 11:11:44,221 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 446 transitions. Word has length 23 [2020-12-22 11:11:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:44,221 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 446 transitions. [2020-12-22 11:11:44,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 11:11:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 446 transitions. [2020-12-22 11:11:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 11:11:44,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:44,224 INFO L422 BasicCegarLoop]: 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-12-22 11:11:44,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 11:11:44,224 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:44,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:44,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1199136742, now seen corresponding path program 4 times [2020-12-22 11:11:44,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:44,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280684481] [2020-12-22 11:11:44,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:44,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280684481] [2020-12-22 11:11:44,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:44,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:11:44,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053655799] [2020-12-22 11:11:44,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 11:11:44,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:44,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 11:11:44,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:11:44,464 INFO L87 Difference]: Start difference. First operand 205 states and 446 transitions. Second operand 7 states. [2020-12-22 11:11:44,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:44,789 INFO L93 Difference]: Finished difference Result 257 states and 549 transitions. [2020-12-22 11:11:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 11:11:44,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-22 11:11:44,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:44,792 INFO L225 Difference]: With dead ends: 257 [2020-12-22 11:11:44,792 INFO L226 Difference]: Without dead ends: 221 [2020-12-22 11:11:44,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:11:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-12-22 11:11:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 197. [2020-12-22 11:11:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-12-22 11:11:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 425 transitions. [2020-12-22 11:11:44,799 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 425 transitions. Word has length 23 [2020-12-22 11:11:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:44,799 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 425 transitions. [2020-12-22 11:11:44,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 11:11:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 425 transitions. [2020-12-22 11:11:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 11:11:44,800 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:44,800 INFO L422 BasicCegarLoop]: 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-12-22 11:11:44,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 11:11:44,801 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:44,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:44,801 INFO L82 PathProgramCache]: Analyzing trace with hash -840132570, now seen corresponding path program 5 times [2020-12-22 11:11:44,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:44,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792257512] [2020-12-22 11:11:44,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:45,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792257512] [2020-12-22 11:11:45,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:45,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 11:11:45,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775111005] [2020-12-22 11:11:45,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 11:11:45,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:45,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 11:11:45,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 11:11:45,027 INFO L87 Difference]: Start difference. First operand 197 states and 425 transitions. Second operand 8 states. [2020-12-22 11:11:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:45,390 INFO L93 Difference]: Finished difference Result 244 states and 516 transitions. [2020-12-22 11:11:45,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:11:45,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-12-22 11:11:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:45,393 INFO L225 Difference]: With dead ends: 244 [2020-12-22 11:11:45,393 INFO L226 Difference]: Without dead ends: 197 [2020-12-22 11:11:45,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:11:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-12-22 11:11:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2020-12-22 11:11:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-12-22 11:11:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 387 transitions. [2020-12-22 11:11:45,401 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 387 transitions. Word has length 23 [2020-12-22 11:11:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:45,402 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 387 transitions. [2020-12-22 11:11:45,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 11:11:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 387 transitions. [2020-12-22 11:11:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 11:11:45,403 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:45,403 INFO L422 BasicCegarLoop]: 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-12-22 11:11:45,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 11:11:45,404 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1402178498, now seen corresponding path program 6 times [2020-12-22 11:11:45,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:45,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026129949] [2020-12-22 11:11:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:45,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026129949] [2020-12-22 11:11:45,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:45,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 11:11:45,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676166151] [2020-12-22 11:11:45,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 11:11:45,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:45,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 11:11:45,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-22 11:11:45,682 INFO L87 Difference]: Start difference. First operand 182 states and 387 transitions. Second operand 9 states. [2020-12-22 11:11:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:46,026 INFO L93 Difference]: Finished difference Result 234 states and 482 transitions. [2020-12-22 11:11:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:11:46,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-12-22 11:11:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:46,028 INFO L225 Difference]: With dead ends: 234 [2020-12-22 11:11:46,028 INFO L226 Difference]: Without dead ends: 211 [2020-12-22 11:11:46,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:11:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-12-22 11:11:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 182. [2020-12-22 11:11:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-12-22 11:11:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 386 transitions. [2020-12-22 11:11:46,035 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 386 transitions. Word has length 23 [2020-12-22 11:11:46,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:46,035 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 386 transitions. [2020-12-22 11:11:46,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 11:11:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 386 transitions. [2020-12-22 11:11:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 11:11:46,036 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:46,037 INFO L422 BasicCegarLoop]: 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-12-22 11:11:46,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 11:11:46,037 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:46,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:46,037 INFO L82 PathProgramCache]: Analyzing trace with hash 748788776, now seen corresponding path program 7 times [2020-12-22 11:11:46,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:46,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600742913] [2020-12-22 11:11:46,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:46,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600742913] [2020-12-22 11:11:46,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:46,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 11:11:46,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461128971] [2020-12-22 11:11:46,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 11:11:46,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:46,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 11:11:46,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 11:11:46,271 INFO L87 Difference]: Start difference. First operand 182 states and 386 transitions. Second operand 8 states. [2020-12-22 11:11:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:46,689 INFO L93 Difference]: Finished difference Result 314 states and 642 transitions. [2020-12-22 11:11:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:11:46,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-12-22 11:11:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:46,691 INFO L225 Difference]: With dead ends: 314 [2020-12-22 11:11:46,691 INFO L226 Difference]: Without dead ends: 196 [2020-12-22 11:11:46,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-12-22 11:11:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-12-22 11:11:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 151. [2020-12-22 11:11:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-12-22 11:11:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 304 transitions. [2020-12-22 11:11:46,696 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 304 transitions. Word has length 23 [2020-12-22 11:11:46,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:46,696 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 304 transitions. [2020-12-22 11:11:46,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 11:11:46,697 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 304 transitions. [2020-12-22 11:11:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 11:11:46,697 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:46,697 INFO L422 BasicCegarLoop]: 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-12-22 11:11:46,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 11:11:46,698 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:46,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:46,698 INFO L82 PathProgramCache]: Analyzing trace with hash -709797980, now seen corresponding path program 8 times [2020-12-22 11:11:46,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:46,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806382998] [2020-12-22 11:11:46,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:11:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:11:46,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806382998] [2020-12-22 11:11:46,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:11:46,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 11:11:46,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603640506] [2020-12-22 11:11:46,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 11:11:46,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:11:46,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 11:11:46,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-22 11:11:46,978 INFO L87 Difference]: Start difference. First operand 151 states and 304 transitions. Second operand 9 states. [2020-12-22 11:11:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:11:47,352 INFO L93 Difference]: Finished difference Result 195 states and 381 transitions. [2020-12-22 11:11:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:11:47,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-12-22 11:11:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:11:47,354 INFO L225 Difference]: With dead ends: 195 [2020-12-22 11:11:47,354 INFO L226 Difference]: Without dead ends: 170 [2020-12-22 11:11:47,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:11:47,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-22 11:11:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2020-12-22 11:11:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-12-22 11:11:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 303 transitions. [2020-12-22 11:11:47,359 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 303 transitions. Word has length 23 [2020-12-22 11:11:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:11:47,359 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 303 transitions. [2020-12-22 11:11:47,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 11:11:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 303 transitions. [2020-12-22 11:11:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 11:11:47,360 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:11:47,360 INFO L422 BasicCegarLoop]: 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-12-22 11:11:47,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 11:11:47,361 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:11:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:11:47,361 INFO L82 PathProgramCache]: Analyzing trace with hash -469028828, now seen corresponding path program 9 times [2020-12-22 11:11:47,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:11:47,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788931066] [2020-12-22 11:11:47,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:11:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 11:11:47,443 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 11:11:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 11:11:47,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 11:11:47,654 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 11:11:47,657 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 11:11:47,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 11:11:47,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 11:11:47 BasicIcfg [2020-12-22 11:11:47,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 11:11:47,838 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 11:11:47,838 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 11:11:47,838 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 11:11:47,839 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:11:25" (3/4) ... [2020-12-22 11:11:47,842 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 11:11:47,996 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/safe023_pso.oepc.i-witness.graphml [2020-12-22 11:11:47,996 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 11:11:47,998 INFO L168 Benchmark]: Toolchain (without parser) took 27334.40 ms. Allocated memory was 170.9 MB in the beginning and 539.0 MB in the end (delta: 368.1 MB). Free memory was 144.0 MB in the beginning and 444.2 MB in the end (delta: -300.2 MB). Peak memory consumption was 68.3 MB. Max. memory is 8.0 GB. [2020-12-22 11:11:47,998 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 170.9 MB. Free memory is still 143.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 11:11:47,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 876.59 ms. Allocated memory is still 170.9 MB. Free memory was 143.8 MB in the beginning and 106.0 MB in the end (delta: 37.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. [2020-12-22 11:11:47,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.33 ms. Allocated memory is still 170.9 MB. Free memory was 105.8 MB in the beginning and 102.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 11:11:47,999 INFO L168 Benchmark]: Boogie Preprocessor took 69.00 ms. Allocated memory is still 170.9 MB. Free memory was 102.9 MB in the beginning and 99.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 11:11:47,999 INFO L168 Benchmark]: RCFGBuilder took 3813.46 ms. Allocated memory was 170.9 MB in the beginning and 212.9 MB in the end (delta: 41.9 MB). Free memory was 99.8 MB in the beginning and 180.0 MB in the end (delta: -80.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 8.0 GB. [2020-12-22 11:11:48,000 INFO L168 Benchmark]: TraceAbstraction took 22333.46 ms. Allocated memory was 212.9 MB in the beginning and 539.0 MB in the end (delta: 326.1 MB). Free memory was 179.5 MB in the beginning and 465.1 MB in the end (delta: -285.7 MB). Peak memory consumption was 315.7 MB. Max. memory is 8.0 GB. [2020-12-22 11:11:48,001 INFO L168 Benchmark]: Witness Printer took 158.95 ms. Allocated memory is still 539.0 MB. Free memory was 465.1 MB in the beginning and 444.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2020-12-22 11:11:48,003 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 170.9 MB. Free memory is still 143.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 876.59 ms. Allocated memory is still 170.9 MB. Free memory was 143.8 MB in the beginning and 106.0 MB in the end (delta: 37.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 72.33 ms. Allocated memory is still 170.9 MB. Free memory was 105.8 MB in the beginning and 102.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 69.00 ms. Allocated memory is still 170.9 MB. Free memory was 102.9 MB in the beginning and 99.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3813.46 ms. Allocated memory was 170.9 MB in the beginning and 212.9 MB in the end (delta: 41.9 MB). Free memory was 99.8 MB in the beginning and 180.0 MB in the end (delta: -80.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 22333.46 ms. Allocated memory was 212.9 MB in the beginning and 539.0 MB in the end (delta: 326.1 MB). Free memory was 179.5 MB in the beginning and 465.1 MB in the end (delta: -285.7 MB). Peak memory consumption was 315.7 MB. Max. memory is 8.0 GB. * Witness Printer took 158.95 ms. Allocated memory is still 539.0 MB. Free memory was 465.1 MB in the beginning and 444.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1036 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 109 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.7s, 107 PlacesBefore, 38 PlacesAfterwards, 99 TransitionsBefore, 29 TransitionsAfterwards, 1786 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, 4941 MoverChecksTotal - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2327; [L855] FCALL, FORK 0 pthread_create(&t2327, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2328; [L857] FCALL, FORK 0 pthread_create(&t2328, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2329; [L859] FCALL, FORK 0 pthread_create(&t2329, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!cond) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.9s, HoareTripleCheckerStatistics: 451 SDtfs, 672 SDslu, 1360 SDs, 0 SdLazy, 1176 SolverSat, 296 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1166occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 429 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 50248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...