/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-12 05:12:34,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-12 05:12:34,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-12 05:12:34,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-12 05:12:34,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-12 05:12:34,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-12 05:12:34,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-12 05:12:34,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-12 05:12:34,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-12 05:12:34,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-12 05:12:34,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-12 05:12:34,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-12 05:12:34,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-12 05:12:34,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-12 05:12:34,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-12 05:12:34,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-12 05:12:34,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-12 05:12:34,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-12 05:12:34,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-12 05:12:34,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-12 05:12:34,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-12 05:12:34,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-12 05:12:34,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-12 05:12:34,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-12 05:12:34,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-12 05:12:34,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-12 05:12:34,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-12 05:12:34,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-12 05:12:34,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-12 05:12:34,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-12 05:12:34,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-12 05:12:34,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-12 05:12:34,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-12 05:12:34,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-12 05:12:34,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-12 05:12:34,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-12 05:12:34,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-12 05:12:34,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-12 05:12:34,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-12 05:12:34,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-12 05:12:34,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-12 05:12:34,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf [2020-11-12 05:12:34,979 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-12 05:12:34,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-12 05:12:34,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-12 05:12:34,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-12 05:12:34,985 INFO L138 SettingsManager]: * Use SBE=true [2020-11-12 05:12:34,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-12 05:12:34,986 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-12 05:12:34,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-12 05:12:34,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-12 05:12:34,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-12 05:12:34,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-12 05:12:34,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-12 05:12:34,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-12 05:12:34,989 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-12 05:12:34,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-12 05:12:34,990 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-12 05:12:34,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-12 05:12:34,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-12 05:12:34,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-12 05:12:34,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-12 05:12:34,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-12 05:12:34,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 05:12:34,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-12 05:12:34,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-12 05:12:34,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-12 05:12:34,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-12 05:12:34,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-12 05:12:34,994 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-11-12 05:12:34,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-12 05:12:34,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-12 05:12:34,995 INFO L138 SettingsManager]: * Sleep set reduction in concurrent analysis=DELAY_SET 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-11-12 05:12:35,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-12 05:12:35,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-12 05:12:35,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-12 05:12:35,524 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-12 05:12:35,525 INFO L275 PluginConnector]: CDTParser initialized [2020-11-12 05:12:35,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_rmo.oepc.i [2020-11-12 05:12:35,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a29d7d6c/c7b0972c6ea145ea919e2f09c41f0cf9/FLAGe7321c5f0 [2020-11-12 05:12:36,362 INFO L306 CDTParser]: Found 1 translation units. [2020-11-12 05:12:36,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_rmo.oepc.i [2020-11-12 05:12:36,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a29d7d6c/c7b0972c6ea145ea919e2f09c41f0cf9/FLAGe7321c5f0 [2020-11-12 05:12:36,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a29d7d6c/c7b0972c6ea145ea919e2f09c41f0cf9 [2020-11-12 05:12:36,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-12 05:12:36,526 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-12 05:12:36,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-12 05:12:36,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-12 05:12:36,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-12 05:12:36,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:12:36" (1/1) ... [2020-11-12 05:12:36,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e4b19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:36, skipping insertion in model container [2020-11-12 05:12:36,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:12:36" (1/1) ... [2020-11-12 05:12:36,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-12 05:12:36,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-12 05:12:37,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 05:12:37,175 INFO L203 MainTranslator]: Completed pre-run [2020-11-12 05:12:37,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 05:12:37,393 INFO L208 MainTranslator]: Completed translation [2020-11-12 05:12:37,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:37 WrapperNode [2020-11-12 05:12:37,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-12 05:12:37,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-12 05:12:37,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-12 05:12:37,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-12 05:12:37,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:37" (1/1) ... [2020-11-12 05:12:37,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:37" (1/1) ... [2020-11-12 05:12:37,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-12 05:12:37,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-12 05:12:37,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-12 05:12:37,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-12 05:12:37,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:37" (1/1) ... [2020-11-12 05:12:37,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:37" (1/1) ... [2020-11-12 05:12:37,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:37" (1/1) ... [2020-11-12 05:12:37,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:37" (1/1) ... [2020-11-12 05:12:37,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:37" (1/1) ... [2020-11-12 05:12:37,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:37" (1/1) ... [2020-11-12 05:12:37,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:37" (1/1) ... [2020-11-12 05:12:37,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-12 05:12:37,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-12 05:12:37,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-12 05:12:37,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-12 05:12:37,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:37" (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-11-12 05:12:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-12 05:12:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-12 05:12:37,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-12 05:12:37,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-12 05:12:37,684 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-12 05:12:37,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-12 05:12:37,684 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-12 05:12:37,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-12 05:12:37,684 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-12 05:12:37,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-12 05:12:37,685 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-12 05:12:37,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-12 05:12:37,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-12 05:12:37,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-12 05:12:37,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-12 05:12:37,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-12 05:12:37,688 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-12 05:12:40,415 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-12 05:12:40,415 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-12 05:12:40,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:12:40 BoogieIcfgContainer [2020-11-12 05:12:40,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-12 05:12:40,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-12 05:12:40,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-12 05:12:40,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-12 05:12:40,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:12:36" (1/3) ... [2020-11-12 05:12:40,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c473f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:12:40, skipping insertion in model container [2020-11-12 05:12:40,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:37" (2/3) ... [2020-11-12 05:12:40,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c473f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:12:40, skipping insertion in model container [2020-11-12 05:12:40,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:12:40" (3/3) ... [2020-11-12 05:12:40,427 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_rmo.oepc.i [2020-11-12 05:12:40,444 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-12 05:12:40,444 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-12 05:12:40,449 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-12 05:12:40,450 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-12 05:12:40,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,496 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,496 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,497 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,497 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,497 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,499 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,500 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,501 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,502 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,505 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,505 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,506 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,506 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,511 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,511 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,516 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,516 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,516 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,516 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,516 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,517 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,517 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,517 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,518 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,519 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,522 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,523 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,525 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,525 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,525 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,525 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,526 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,527 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,528 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,529 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,534 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,535 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,536 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,536 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,538 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,544 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,545 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,550 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,550 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,557 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,559 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,560 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:12:40,561 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-12 05:12:40,575 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-12 05:12:40,599 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 05:12:40,599 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 05:12:40,600 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 05:12:40,600 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 05:12:40,600 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 05:12:40,600 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 05:12:40,600 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 05:12:40,600 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 05:12:40,615 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134 places, 124 transitions, 268 flow [2020-11-12 05:13:46,691 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 183752 states, 183748 states have (on average 4.588550623680257) internal successors, (843137), 183751 states have internal predecessors, (843137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:13:46,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-12 05:13:46,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:46,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-12 05:13:46,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:47,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:13:47,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:13:47,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:47,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:47,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:47,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:47,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:47,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:13:47,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:47,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:47,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:47,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:47,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:47,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:47,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:47,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:13:47,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:47,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:47,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:47,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:13:47,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:13:47,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:47,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:47,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:47,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:47,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:47,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:47,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:47,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:47,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:47,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:47,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:47,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:47,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:47,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:47,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:47,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:47,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:47,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:47,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:47,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:47,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:47,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:47,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:47,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:47,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:47,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:47,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:13:47,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:47,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:47,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:47,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:13:47,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:13:47,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:47,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:47,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:13:47,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:13:47,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:48,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:48,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:48,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:48,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:48,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:48,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:48,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:13:48,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:48,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:48,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:48,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:48,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:48,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:48,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:48,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:48,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:48,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:48,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:48,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:48,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:48,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:48,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:48,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:13:48,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:48,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:48,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:48,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:48,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:49,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:49,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:13:49,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:13:49,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:49,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:49,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:13:49,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:13:49,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:49,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:49,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:49,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:49,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:49,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:49,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:49,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:13:49,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:49,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:49,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:49,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:49,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:49,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:49,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:49,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:49,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:49,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:49,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:49,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:49,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:49,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:49,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:49,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:49,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:49,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:49,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:49,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:50,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:50,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:50,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:50,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:13:50,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:50,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:13:50,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:50,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:13:50,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:50,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:13:50,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:50,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:13:50,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:50,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:13:50,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:50,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:13:50,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:50,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:50,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:50,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:50,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:50,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:13:50,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:50,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:50,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:50,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:50,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:50,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:50,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:50,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:50,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:50,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:50,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:50,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:50,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:50,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:50,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:50,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:51,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:51,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:51,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:51,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:51,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:51,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:51,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:51,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:13:51,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:51,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:51,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:51,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:51,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:51,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:51,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:13:51,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:13:51,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:51,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:51,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:13:51,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:13:51,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:51,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:51,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:51,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:51,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:51,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:13:51,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:13:51,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:13:51,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:51,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:51,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:51,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:13:51,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:13:51,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:51,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:51,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:51,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:51,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:52,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:52,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:52,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:52,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:52,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:52,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:52,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:52,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:52,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:52,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:52,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:52,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:52,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:52,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:52,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:52,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:52,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:52,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:52,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:52,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:52,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:52,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:52,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:52,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:52,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:52,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:52,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:52,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:52,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:13:52,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:52,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:13:52,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:13:52,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:52,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:52,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:52,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:52,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:52,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:52,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:13:52,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:13:54,755 WARN L455 BasicCegarLoop]: Sleep Set Reduction Time: 8039ms [2020-11-12 05:13:54,951 WARN L456 BasicCegarLoop]: Sleep set: input automaton has 183752 states, 183748 states have (on average 4.588550623680257) internal successors, (843137), 183751 states have internal predecessors, (843137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:13:55,280 WARN L457 BasicCegarLoop]: Sleep set: output automaton has 183752 states, 171362 states have (on average 1.596094816820532) internal successors, (273510), 183751 states have internal predecessors, (273510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:13:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 183752 states, 171362 states have (on average 1.596094816820532) internal successors, (273510), 183751 states have internal predecessors, (273510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:13:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-12 05:13:55,479 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:13:55,480 INFO L494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:13:55,481 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:13:55,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:13:55,489 INFO L82 PathProgramCache]: Analyzing trace with hash -624824306, now seen corresponding path program 1 times [2020-11-12 05:13:55,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:13:55,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268203548] [2020-11-12 05:13:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:13:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:13:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:13:55,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268203548] [2020-11-12 05:13:55,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:13:55,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-12 05:13:55,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74264583] [2020-11-12 05:13:55,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 05:13:55,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:13:55,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 05:13:55,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 05:13:56,084 INFO L87 Difference]: Start difference. First operand has 183752 states, 171362 states have (on average 1.596094816820532) internal successors, (273510), 183751 states have internal predecessors, (273510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:13:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:13:57,958 INFO L93 Difference]: Finished difference Result 152972 states and 217413 transitions. [2020-11-12 05:13:57,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 05:13:57,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2020-11-12 05:13:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:13:58,447 INFO L225 Difference]: With dead ends: 152972 [2020-11-12 05:13:58,447 INFO L226 Difference]: Without dead ends: 80439 [2020-11-12 05:13:58,449 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-12 05:13:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80439 states. [2020-11-12 05:14:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80439 to 80439. [2020-11-12 05:14:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80439 states, 75255 states have (on average 1.8876087967576904) internal successors, (142052), 80438 states have internal predecessors, (142052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80439 states to 80439 states and 142052 transitions. [2020-11-12 05:14:02,341 INFO L78 Accepts]: Start accepts. Automaton has 80439 states and 142052 transitions. Word has length 46 [2020-11-12 05:14:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:14:02,341 INFO L481 AbstractCegarLoop]: Abstraction has 80439 states and 142052 transitions. [2020-11-12 05:14:02,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 80439 states and 142052 transitions. [2020-11-12 05:14:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-12 05:14:02,395 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:14:02,395 INFO L494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:14:02,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-12 05:14:02,396 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:14:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:14:02,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1630464496, now seen corresponding path program 1 times [2020-11-12 05:14:02,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:14:02,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141519177] [2020-11-12 05:14:02,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:14:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:14:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:14:02,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141519177] [2020-11-12 05:14:02,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:14:02,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:14:02,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560488793] [2020-11-12 05:14:02,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:14:02,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:14:02,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:14:02,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:14:02,664 INFO L87 Difference]: Start difference. First operand 80439 states and 142052 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:14:03,877 INFO L93 Difference]: Finished difference Result 97287 states and 182400 transitions. [2020-11-12 05:14:03,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 05:14:03,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2020-11-12 05:14:03,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:14:04,176 INFO L225 Difference]: With dead ends: 97287 [2020-11-12 05:14:04,177 INFO L226 Difference]: Without dead ends: 75337 [2020-11-12 05:14:04,177 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:14:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75337 states. [2020-11-12 05:14:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75337 to 75337. [2020-11-12 05:14:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75337 states, 70639 states have (on average 1.897761859595974) internal successors, (134056), 75336 states have internal predecessors, (134056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75337 states to 75337 states and 134056 transitions. [2020-11-12 05:14:07,018 INFO L78 Accepts]: Start accepts. Automaton has 75337 states and 134056 transitions. Word has length 71 [2020-11-12 05:14:07,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:14:07,019 INFO L481 AbstractCegarLoop]: Abstraction has 75337 states and 134056 transitions. [2020-11-12 05:14:07,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 75337 states and 134056 transitions. [2020-11-12 05:14:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-12 05:14:07,067 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:14:07,067 INFO L494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:14:07,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-12 05:14:07,067 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:14:07,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:14:07,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2001088943, now seen corresponding path program 1 times [2020-11-12 05:14:07,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:14:07,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203673960] [2020-11-12 05:14:07,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:14:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:14:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:14:07,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203673960] [2020-11-12 05:14:07,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:14:07,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:14:07,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107184155] [2020-11-12 05:14:07,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:14:07,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:14:07,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:14:07,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:14:07,350 INFO L87 Difference]: Start difference. First operand 75337 states and 134056 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:14:07,704 INFO L93 Difference]: Finished difference Result 81601 states and 156776 transitions. [2020-11-12 05:14:07,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 05:14:07,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2020-11-12 05:14:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:14:07,856 INFO L225 Difference]: With dead ends: 81601 [2020-11-12 05:14:07,857 INFO L226 Difference]: Without dead ends: 57001 [2020-11-12 05:14:07,857 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:14:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57001 states. [2020-11-12 05:14:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57001 to 57001. [2020-11-12 05:14:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57001 states, 53869 states have (on average 1.9278620356791476) internal successors, (103852), 57000 states have internal predecessors, (103852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57001 states to 57001 states and 103852 transitions. [2020-11-12 05:14:10,162 INFO L78 Accepts]: Start accepts. Automaton has 57001 states and 103852 transitions. Word has length 73 [2020-11-12 05:14:10,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:14:10,163 INFO L481 AbstractCegarLoop]: Abstraction has 57001 states and 103852 transitions. [2020-11-12 05:14:10,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 57001 states and 103852 transitions. [2020-11-12 05:14:10,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-12 05:14:10,204 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:14:10,205 INFO L494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:14:10,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-12 05:14:10,205 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:14:10,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:14:10,206 INFO L82 PathProgramCache]: Analyzing trace with hash 793613303, now seen corresponding path program 1 times [2020-11-12 05:14:10,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:14:10,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322760275] [2020-11-12 05:14:10,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:14:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:14:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:14:10,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322760275] [2020-11-12 05:14:10,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:14:10,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:14:10,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832406260] [2020-11-12 05:14:10,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:14:10,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:14:10,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:14:10,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:14:10,408 INFO L87 Difference]: Start difference. First operand 57001 states and 103852 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:14:10,750 INFO L93 Difference]: Finished difference Result 61177 states and 119308 transitions. [2020-11-12 05:14:10,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 05:14:10,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2020-11-12 05:14:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:14:10,871 INFO L225 Difference]: With dead ends: 61177 [2020-11-12 05:14:10,871 INFO L226 Difference]: Without dead ends: 44893 [2020-11-12 05:14:10,872 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:14:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44893 states. [2020-11-12 05:14:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44893 to 44893. [2020-11-12 05:14:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44893 states, 42805 states have (on average 1.935778530545497) internal successors, (82861), 44892 states have internal predecessors, (82861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44893 states to 44893 states and 82861 transitions. [2020-11-12 05:14:12,278 INFO L78 Accepts]: Start accepts. Automaton has 44893 states and 82861 transitions. Word has length 76 [2020-11-12 05:14:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:14:12,279 INFO L481 AbstractCegarLoop]: Abstraction has 44893 states and 82861 transitions. [2020-11-12 05:14:12,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 44893 states and 82861 transitions. [2020-11-12 05:14:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-12 05:14:12,315 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:14:12,315 INFO L494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:14:12,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-12 05:14:12,316 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:14:12,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:14:12,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1851660637, now seen corresponding path program 1 times [2020-11-12 05:14:12,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:14:12,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399188469] [2020-11-12 05:14:12,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:14:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:14:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:14:12,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399188469] [2020-11-12 05:14:12,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:14:12,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:14:12,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322091225] [2020-11-12 05:14:12,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:14:12,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:14:12,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:14:12,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:14:12,466 INFO L87 Difference]: Start difference. First operand 44893 states and 82861 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:14:12,760 INFO L93 Difference]: Finished difference Result 55163 states and 97985 transitions. [2020-11-12 05:14:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 05:14:12,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2020-11-12 05:14:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:14:12,840 INFO L225 Difference]: With dead ends: 55163 [2020-11-12 05:14:12,841 INFO L226 Difference]: Without dead ends: 40747 [2020-11-12 05:14:12,841 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:14:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40747 states. [2020-11-12 05:14:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40747 to 40747. [2020-11-12 05:14:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40747 states, 38830 states have (on average 1.938243626062323) internal successors, (75262), 40746 states have internal predecessors, (75262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40747 states to 40747 states and 75262 transitions. [2020-11-12 05:14:14,019 INFO L78 Accepts]: Start accepts. Automaton has 40747 states and 75262 transitions. Word has length 79 [2020-11-12 05:14:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:14:14,019 INFO L481 AbstractCegarLoop]: Abstraction has 40747 states and 75262 transitions. [2020-11-12 05:14:14,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 40747 states and 75262 transitions. [2020-11-12 05:14:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-12 05:14:14,054 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:14:14,055 INFO L494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:14:14,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-12 05:14:14,055 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:14:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:14:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash 402886958, now seen corresponding path program 1 times [2020-11-12 05:14:14,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:14:14,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792229920] [2020-11-12 05:14:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:14:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:14:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:14:14,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792229920] [2020-11-12 05:14:14,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:14:14,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:14:14,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569267031] [2020-11-12 05:14:14,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:14:14,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:14:14,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:14:14,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:14:14,240 INFO L87 Difference]: Start difference. First operand 40747 states and 75262 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:14,913 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-11-12 05:14:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:14:15,061 INFO L93 Difference]: Finished difference Result 68923 states and 134427 transitions. [2020-11-12 05:14:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 05:14:15,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2020-11-12 05:14:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:14:15,136 INFO L225 Difference]: With dead ends: 68923 [2020-11-12 05:14:15,136 INFO L226 Difference]: Without dead ends: 42096 [2020-11-12 05:14:15,137 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:14:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42096 states. [2020-11-12 05:14:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42096 to 34536. [2020-11-12 05:14:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34536 states, 32943 states have (on average 1.955377470175758) internal successors, (64416), 34535 states have internal predecessors, (64416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34536 states to 34536 states and 64416 transitions. [2020-11-12 05:14:16,142 INFO L78 Accepts]: Start accepts. Automaton has 34536 states and 64416 transitions. Word has length 82 [2020-11-12 05:14:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:14:16,143 INFO L481 AbstractCegarLoop]: Abstraction has 34536 states and 64416 transitions. [2020-11-12 05:14:16,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 34536 states and 64416 transitions. [2020-11-12 05:14:16,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-12 05:14:16,184 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:14:16,184 INFO L494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:14:16,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-12 05:14:16,184 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:14:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:14:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash -167685534, now seen corresponding path program 1 times [2020-11-12 05:14:16,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:14:16,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513642756] [2020-11-12 05:14:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:14:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:14:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:14:16,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513642756] [2020-11-12 05:14:16,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:14:16,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:14:16,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47773642] [2020-11-12 05:14:16,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:14:16,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:14:16,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:14:16,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:14:16,411 INFO L87 Difference]: Start difference. First operand 34536 states and 64416 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:14:17,095 INFO L93 Difference]: Finished difference Result 35430 states and 63871 transitions. [2020-11-12 05:14:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 05:14:17,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2020-11-12 05:14:17,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:14:17,127 INFO L225 Difference]: With dead ends: 35430 [2020-11-12 05:14:17,128 INFO L226 Difference]: Without dead ends: 24450 [2020-11-12 05:14:17,128 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-11-12 05:14:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24450 states. [2020-11-12 05:14:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24450 to 24450. [2020-11-12 05:14:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24450 states, 23343 states have (on average 1.9337274557683246) internal successors, (45139), 24449 states have internal predecessors, (45139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24450 states to 24450 states and 45139 transitions. [2020-11-12 05:14:17,551 INFO L78 Accepts]: Start accepts. Automaton has 24450 states and 45139 transitions. Word has length 82 [2020-11-12 05:14:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:14:17,552 INFO L481 AbstractCegarLoop]: Abstraction has 24450 states and 45139 transitions. [2020-11-12 05:14:17,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 24450 states and 45139 transitions. [2020-11-12 05:14:17,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-12 05:14:17,585 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:14:17,585 INFO L494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:14:17,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-12 05:14:17,585 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:14:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:14:17,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2049424061, now seen corresponding path program 1 times [2020-11-12 05:14:17,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:14:17,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778411070] [2020-11-12 05:14:17,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:14:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:14:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:14:17,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778411070] [2020-11-12 05:14:17,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:14:17,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 05:14:17,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184416480] [2020-11-12 05:14:17,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 05:14:17,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:14:17,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 05:14:17,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-12 05:14:17,836 INFO L87 Difference]: Start difference. First operand 24450 states and 45139 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:14:18,108 INFO L93 Difference]: Finished difference Result 19446 states and 34801 transitions. [2020-11-12 05:14:18,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 05:14:18,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2020-11-12 05:14:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:14:18,130 INFO L225 Difference]: With dead ends: 19446 [2020-11-12 05:14:18,130 INFO L226 Difference]: Without dead ends: 11940 [2020-11-12 05:14:18,131 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-11-12 05:14:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11940 states. [2020-11-12 05:14:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11940 to 11940. [2020-11-12 05:14:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11940 states, 11481 states have (on average 1.8421740266527307) internal successors, (21150), 11939 states have internal predecessors, (21150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11940 states to 11940 states and 21150 transitions. [2020-11-12 05:14:18,362 INFO L78 Accepts]: Start accepts. Automaton has 11940 states and 21150 transitions. Word has length 85 [2020-11-12 05:14:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:14:18,363 INFO L481 AbstractCegarLoop]: Abstraction has 11940 states and 21150 transitions. [2020-11-12 05:14:18,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 11940 states and 21150 transitions. [2020-11-12 05:14:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-12 05:14:18,374 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:14:18,374 INFO L494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:14:18,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-12 05:14:18,375 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:14:18,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:14:18,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1289115846, now seen corresponding path program 1 times [2020-11-12 05:14:18,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:14:18,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547925192] [2020-11-12 05:14:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:14:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:14:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:14:18,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547925192] [2020-11-12 05:14:18,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:14:18,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 05:14:18,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904399553] [2020-11-12 05:14:18,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 05:14:18,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:14:18,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 05:14:18,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 05:14:18,969 INFO L87 Difference]: Start difference. First operand 11940 states and 21150 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:14:19,189 INFO L93 Difference]: Finished difference Result 8214 states and 14076 transitions. [2020-11-12 05:14:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 05:14:19,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2020-11-12 05:14:19,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:14:19,196 INFO L225 Difference]: With dead ends: 8214 [2020-11-12 05:14:19,196 INFO L226 Difference]: Without dead ends: 4459 [2020-11-12 05:14:19,197 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-11-12 05:14:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4459 states. [2020-11-12 05:14:19,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4459 to 4459. [2020-11-12 05:14:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4459 states, 4378 states have (on average 1.6642302421196893) internal successors, (7286), 4458 states have internal predecessors, (7286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4459 states to 4459 states and 7286 transitions. [2020-11-12 05:14:19,278 INFO L78 Accepts]: Start accepts. Automaton has 4459 states and 7286 transitions. Word has length 88 [2020-11-12 05:14:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:14:19,278 INFO L481 AbstractCegarLoop]: Abstraction has 4459 states and 7286 transitions. [2020-11-12 05:14:19,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 4459 states and 7286 transitions. [2020-11-12 05:14:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-12 05:14:19,285 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:14:19,285 INFO L494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:14:19,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-12 05:14:19,285 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:14:19,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:14:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1427834278, now seen corresponding path program 1 times [2020-11-12 05:14:19,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:14:19,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30726054] [2020-11-12 05:14:19,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:14:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:14:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:14:19,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30726054] [2020-11-12 05:14:19,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:14:19,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:14:19,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974033025] [2020-11-12 05:14:19,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:14:19,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:14:19,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:14:19,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:14:19,535 INFO L87 Difference]: Start difference. First operand 4459 states and 7286 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:14:19,646 INFO L93 Difference]: Finished difference Result 7100 states and 12071 transitions. [2020-11-12 05:14:19,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 05:14:19,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2020-11-12 05:14:19,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:14:19,653 INFO L225 Difference]: With dead ends: 7100 [2020-11-12 05:14:19,653 INFO L226 Difference]: Without dead ends: 3619 [2020-11-12 05:14:19,654 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:14:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2020-11-12 05:14:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 3619. [2020-11-12 05:14:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3619 states, 3538 states have (on average 1.6859807801017523) internal successors, (5965), 3618 states have internal predecessors, (5965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 3619 states and 5965 transitions. [2020-11-12 05:14:19,718 INFO L78 Accepts]: Start accepts. Automaton has 3619 states and 5965 transitions. Word has length 93 [2020-11-12 05:14:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:14:19,718 INFO L481 AbstractCegarLoop]: Abstraction has 3619 states and 5965 transitions. [2020-11-12 05:14:19,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3619 states and 5965 transitions. [2020-11-12 05:14:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-12 05:14:19,723 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:14:19,724 INFO L494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:14:19,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-12 05:14:19,724 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:14:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:14:19,724 INFO L82 PathProgramCache]: Analyzing trace with hash -2124027674, now seen corresponding path program 2 times [2020-11-12 05:14:19,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:14:19,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477008784] [2020-11-12 05:14:19,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:14:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:14:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:14:19,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477008784] [2020-11-12 05:14:19,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:14:19,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:14:19,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254579676] [2020-11-12 05:14:19,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:14:19,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:14:19,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:14:19,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:14:19,914 INFO L87 Difference]: Start difference. First operand 3619 states and 5965 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:14:20,023 INFO L93 Difference]: Finished difference Result 5010 states and 9051 transitions. [2020-11-12 05:14:20,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 05:14:20,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2020-11-12 05:14:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:14:20,028 INFO L225 Difference]: With dead ends: 5010 [2020-11-12 05:14:20,029 INFO L226 Difference]: Without dead ends: 2760 [2020-11-12 05:14:20,029 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:14:20,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2020-11-12 05:14:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2760. [2020-11-12 05:14:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2760 states, 2679 states have (on average 1.7360955580440462) internal successors, (4651), 2759 states have internal predecessors, (4651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 4651 transitions. [2020-11-12 05:14:20,079 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 4651 transitions. Word has length 93 [2020-11-12 05:14:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:14:20,079 INFO L481 AbstractCegarLoop]: Abstraction has 2760 states and 4651 transitions. [2020-11-12 05:14:20,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:14:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 4651 transitions. [2020-11-12 05:14:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-12 05:14:20,083 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:14:20,084 INFO L494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:14:20,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-12 05:14:20,084 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:14:20,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:14:20,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1335430026, now seen corresponding path program 3 times [2020-11-12 05:14:20,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:14:20,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339370273] [2020-11-12 05:14:20,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:14:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 05:14:20,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 05:14:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 05:14:20,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 05:14:20,406 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-12 05:14:20,406 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-12 05:14:20,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-12 05:14:20,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:14:20 BasicIcfg [2020-11-12 05:14:20,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-12 05:14:20,656 INFO L168 Benchmark]: Toolchain (without parser) took 104134.28 ms. Allocated memory was 302.0 MB in the beginning and 11.7 GB in the end (delta: 11.4 GB). Free memory was 277.1 MB in the beginning and 8.9 GB in the end (delta: -8.6 GB). Peak memory consumption was 2.7 GB. Max. memory is 16.0 GB. [2020-11-12 05:14:20,657 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 302.0 MB. Free memory was 272.7 MB in the beginning and 272.7 MB in the end (delta: 60.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2020-11-12 05:14:20,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.57 ms. Allocated memory is still 302.0 MB. Free memory was 276.4 MB in the beginning and 280.8 MB in the end (delta: -4.4 MB). Peak memory consumption was 37.9 MB. Max. memory is 16.0 GB. [2020-11-12 05:14:20,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.34 ms. Allocated memory is still 302.0 MB. Free memory was 280.8 MB in the beginning and 278.7 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.0 GB. [2020-11-12 05:14:20,659 INFO L168 Benchmark]: Boogie Preprocessor took 92.23 ms. Allocated memory is still 302.0 MB. Free memory was 278.7 MB in the beginning and 276.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-12 05:14:20,660 INFO L168 Benchmark]: RCFGBuilder took 2814.58 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 276.6 MB in the beginning and 250.8 MB in the end (delta: 25.8 MB). Peak memory consumption was 173.6 MB. Max. memory is 16.0 GB. [2020-11-12 05:14:20,661 INFO L168 Benchmark]: TraceAbstraction took 100235.18 ms. Allocated memory was 362.8 MB in the beginning and 11.7 GB in the end (delta: 11.3 GB). Free memory was 250.8 MB in the beginning and 8.9 GB in the end (delta: -8.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 16.0 GB. [2020-11-12 05:14:20,665 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.79 ms. Allocated memory is still 302.0 MB. Free memory was 272.7 MB in the beginning and 272.7 MB in the end (delta: 60.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 868.57 ms. Allocated memory is still 302.0 MB. Free memory was 276.4 MB in the beginning and 280.8 MB in the end (delta: -4.4 MB). Peak memory consumption was 37.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 111.34 ms. Allocated memory is still 302.0 MB. Free memory was 280.8 MB in the beginning and 278.7 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 92.23 ms. Allocated memory is still 302.0 MB. Free memory was 278.7 MB in the beginning and 276.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2814.58 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 276.6 MB in the beginning and 250.8 MB in the end (delta: 25.8 MB). Peak memory consumption was 173.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 100235.18 ms. Allocated memory was 362.8 MB in the beginning and 11.7 GB in the end (delta: 11.3 GB). Free memory was 250.8 MB in the beginning and 8.9 GB in the end (delta: -8.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0] [L724] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L725] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L726] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L727] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L728] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L729] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0] [L730] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0] [L731] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L732] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L733] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L734] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0] [L735] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L736] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L737] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L738] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L739] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L740] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L741] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L742] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L744] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t137; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t137, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t138; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t138, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t139; VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t139, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L877] 0 pthread_t t140; VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L878] FCALL, FORK 0 pthread_create(&t140, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=1] [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=1] [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=1] [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix005_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 122 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 99.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 74.6s, HoareTripleCheckerStatistics: 1443 SDtfs, 1807 SDslu, 4883 SDs, 0 SdLazy, 389 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183752occurred 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: 13.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 7560 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 961 NumberOfCodeBlocks, 961 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 857 ConstructedInterpolants, 0 QuantifiedInterpolants, 170413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...