/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 01:43:12,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 01:43:12,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 01:43:12,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 01:43:12,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 01:43:12,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 01:43:12,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 01:43:12,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 01:43:12,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 01:43:12,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 01:43:12,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 01:43:12,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 01:43:12,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 01:43:12,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 01:43:12,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 01:43:12,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 01:43:12,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 01:43:12,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 01:43:12,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 01:43:12,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 01:43:12,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 01:43:12,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 01:43:12,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 01:43:12,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 01:43:12,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 01:43:12,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 01:43:12,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 01:43:12,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 01:43:12,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 01:43:12,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 01:43:12,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 01:43:12,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 01:43:12,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 01:43:12,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 01:43:12,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 01:43:12,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 01:43:12,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 01:43:12,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 01:43:12,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 01:43:12,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 01:43:12,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 01:43:12,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-10-22 01:43:12,851 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 01:43:12,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 01:43:12,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 01:43:12,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 01:43:12,853 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 01:43:12,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 01:43:12,854 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 01:43:12,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 01:43:12,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 01:43:12,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 01:43:12,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 01:43:12,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 01:43:12,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 01:43:12,855 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 01:43:12,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 01:43:12,855 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 01:43:12,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 01:43:12,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 01:43:12,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 01:43:12,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 01:43:12,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 01:43:12,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 01:43:12,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 01:43:12,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 01:43:12,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 01:43:12,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 01:43:12,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 01:43:12,858 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 01:43:12,858 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 01:43:12,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 01:43:12,858 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 01:43:13,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 01:43:13,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 01:43:13,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 01:43:13,184 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 01:43:13,184 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 01:43:13,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i [2020-10-22 01:43:13,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25b55788/acb4a3ded20344a6ab35f7784dabf878/FLAG108702a70 [2020-10-22 01:43:13,839 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 01:43:13,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i [2020-10-22 01:43:13,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25b55788/acb4a3ded20344a6ab35f7784dabf878/FLAG108702a70 [2020-10-22 01:43:14,072 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25b55788/acb4a3ded20344a6ab35f7784dabf878 [2020-10-22 01:43:14,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 01:43:14,088 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 01:43:14,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 01:43:14,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 01:43:14,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 01:43:14,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:43:14" (1/1) ... [2020-10-22 01:43:14,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c66f4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14, skipping insertion in model container [2020-10-22 01:43:14,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:43:14" (1/1) ... [2020-10-22 01:43:14,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 01:43:14,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 01:43:14,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:43:14,677 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 01:43:14,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:43:14,894 INFO L208 MainTranslator]: Completed translation [2020-10-22 01:43:14,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14 WrapperNode [2020-10-22 01:43:14,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 01:43:14,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 01:43:14,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 01:43:14,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 01:43:14,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14" (1/1) ... [2020-10-22 01:43:14,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14" (1/1) ... [2020-10-22 01:43:14,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 01:43:14,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 01:43:14,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 01:43:14,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 01:43:14,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14" (1/1) ... [2020-10-22 01:43:14,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14" (1/1) ... [2020-10-22 01:43:14,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14" (1/1) ... [2020-10-22 01:43:14,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14" (1/1) ... [2020-10-22 01:43:14,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14" (1/1) ... [2020-10-22 01:43:15,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14" (1/1) ... [2020-10-22 01:43:15,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14" (1/1) ... [2020-10-22 01:43:15,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 01:43:15,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 01:43:15,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 01:43:15,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 01:43:15,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 01:43:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 01:43:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 01:43:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 01:43:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 01:43:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 01:43:15,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 01:43:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 01:43:15,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 01:43:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 01:43:15,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 01:43:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-22 01:43:15,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-22 01:43:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 01:43:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 01:43:15,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 01:43:15,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 01:43:15,105 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 01:43:17,296 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 01:43:17,297 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 01:43:17,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:43:17 BoogieIcfgContainer [2020-10-22 01:43:17,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 01:43:17,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 01:43:17,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 01:43:17,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 01:43:17,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 01:43:14" (1/3) ... [2020-10-22 01:43:17,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5a2cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:43:17, skipping insertion in model container [2020-10-22 01:43:17,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:43:14" (2/3) ... [2020-10-22 01:43:17,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5a2cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:43:17, skipping insertion in model container [2020-10-22 01:43:17,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:43:17" (3/3) ... [2020-10-22 01:43:17,308 INFO L111 eAbstractionObserver]: Analyzing ICFG mix023_rmo.opt.i [2020-10-22 01:43:17,320 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 01:43:17,321 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 01:43:17,329 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 01:43:17,330 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 01:43:17,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,367 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,367 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,369 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,369 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,380 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,384 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,384 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,395 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,396 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,400 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,401 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,405 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,408 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,412 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,414 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,414 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:43:17,417 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 01:43:17,432 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-22 01:43:17,455 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 01:43:17,455 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 01:43:17,455 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 01:43:17,456 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 01:43:17,456 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 01:43:17,456 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 01:43:17,456 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 01:43:17,456 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 01:43:17,472 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 01:43:17,473 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-22 01:43:17,476 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-22 01:43:17,479 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-10-22 01:43:17,539 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-10-22 01:43:17,540 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 01:43:17,546 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-10-22 01:43:17,551 INFO L116 LiptonReduction]: Number of co-enabled transitions 2862 [2020-10-22 01:43:18,241 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 01:43:18,358 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-22 01:43:18,585 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-22 01:43:20,168 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-10-22 01:43:20,813 WARN L193 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-22 01:43:21,026 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-22 01:43:21,126 INFO L131 LiptonReduction]: Checked pairs total: 7701 [2020-10-22 01:43:21,126 INFO L133 LiptonReduction]: Total number of compositions: 102 [2020-10-22 01:43:21,134 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-22 01:43:21,415 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-10-22 01:43:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-10-22 01:43:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 01:43:21,426 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:43:21,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:43:21,428 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:43:21,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:43:21,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1877032046, now seen corresponding path program 1 times [2020-10-22 01:43:21,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:43:21,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707597049] [2020-10-22 01:43:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:43:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:43:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:43:21,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707597049] [2020-10-22 01:43:21,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:43:21,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:43:21,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [967853107] [2020-10-22 01:43:21,768 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:43:21,771 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:43:21,787 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 01:43:21,787 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:43:21,793 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:43:21,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:43:21,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:43:21,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:43:21,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:43:21,813 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-10-22 01:43:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:43:21,928 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-22 01:43:21,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:43:21,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-22 01:43:21,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:43:21,974 INFO L225 Difference]: With dead ends: 3250 [2020-10-22 01:43:21,974 INFO L226 Difference]: Without dead ends: 2650 [2020-10-22 01:43:21,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:43:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-22 01:43:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-22 01:43:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-22 01:43:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-22 01:43:22,231 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-10-22 01:43:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:43:22,232 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-22 01:43:22,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:43:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-22 01:43:22,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 01:43:22,237 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:43:22,238 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:43:22,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 01:43:22,238 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:43:22,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:43:22,239 INFO L82 PathProgramCache]: Analyzing trace with hash 394130702, now seen corresponding path program 1 times [2020-10-22 01:43:22,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:43:22,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283123378] [2020-10-22 01:43:22,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:43:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:43:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:43:22,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283123378] [2020-10-22 01:43:22,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:43:22,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:43:22,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [351180217] [2020-10-22 01:43:22,367 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:43:22,369 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:43:22,371 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 01:43:22,371 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:43:22,371 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:43:22,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:43:22,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:43:22,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:43:22,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:43:22,374 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-22 01:43:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:43:22,410 INFO L93 Difference]: Finished difference Result 2590 states and 9950 transitions. [2020-10-22 01:43:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:43:22,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 01:43:22,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:43:22,437 INFO L225 Difference]: With dead ends: 2590 [2020-10-22 01:43:22,437 INFO L226 Difference]: Without dead ends: 2590 [2020-10-22 01:43:22,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:43:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2020-10-22 01:43:22,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2020-10-22 01:43:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2020-10-22 01:43:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 9950 transitions. [2020-10-22 01:43:22,544 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 9950 transitions. Word has length 11 [2020-10-22 01:43:22,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:43:22,545 INFO L481 AbstractCegarLoop]: Abstraction has 2590 states and 9950 transitions. [2020-10-22 01:43:22,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:43:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 9950 transitions. [2020-10-22 01:43:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 01:43:22,554 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:43:22,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:43:22,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 01:43:22,555 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:43:22,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:43:22,556 INFO L82 PathProgramCache]: Analyzing trace with hash -858357833, now seen corresponding path program 1 times [2020-10-22 01:43:22,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:43:22,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483732479] [2020-10-22 01:43:22,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:43:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:43:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:43:22,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483732479] [2020-10-22 01:43:22,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:43:22,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:43:22,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [301823985] [2020-10-22 01:43:22,638 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:43:22,640 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:43:22,646 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-22 01:43:22,646 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:43:22,743 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:43:22,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:43:22,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:43:22,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:43:22,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:43:22,745 INFO L87 Difference]: Start difference. First operand 2590 states and 9950 transitions. Second operand 3 states. [2020-10-22 01:43:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:43:22,844 INFO L93 Difference]: Finished difference Result 2410 states and 9176 transitions. [2020-10-22 01:43:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:43:22,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-22 01:43:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:43:22,866 INFO L225 Difference]: With dead ends: 2410 [2020-10-22 01:43:22,866 INFO L226 Difference]: Without dead ends: 2410 [2020-10-22 01:43:22,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-10-22 01:43:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-22 01:43:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-22 01:43:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-22 01:43:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9176 transitions. [2020-10-22 01:43:22,977 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9176 transitions. Word has length 12 [2020-10-22 01:43:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:43:22,978 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9176 transitions. [2020-10-22 01:43:22,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:43:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9176 transitions. [2020-10-22 01:43:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 01:43:22,981 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:43:22,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:43:22,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 01:43:22,981 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:43:22,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:43:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash -292087857, now seen corresponding path program 1 times [2020-10-22 01:43:22,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:43:22,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705854204] [2020-10-22 01:43:22,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:43:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:43:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:43:23,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705854204] [2020-10-22 01:43:23,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:43:23,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:43:23,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [109275091] [2020-10-22 01:43:23,040 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:43:23,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:43:23,047 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 50 transitions. [2020-10-22 01:43:23,047 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:43:23,273 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:43:23,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:43:23,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:43:23,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:43:23,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:43:23,274 INFO L87 Difference]: Start difference. First operand 2410 states and 9176 transitions. Second operand 3 states. [2020-10-22 01:43:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:43:23,303 INFO L93 Difference]: Finished difference Result 2290 states and 8670 transitions. [2020-10-22 01:43:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:43:23,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-22 01:43:23,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:43:23,323 INFO L225 Difference]: With dead ends: 2290 [2020-10-22 01:43:23,323 INFO L226 Difference]: Without dead ends: 2290 [2020-10-22 01:43:23,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-10-22 01:43:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2020-10-22 01:43:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2290. [2020-10-22 01:43:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2020-10-22 01:43:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 8670 transitions. [2020-10-22 01:43:23,401 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 8670 transitions. Word has length 14 [2020-10-22 01:43:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:43:23,401 INFO L481 AbstractCegarLoop]: Abstraction has 2290 states and 8670 transitions. [2020-10-22 01:43:23,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:43:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 8670 transitions. [2020-10-22 01:43:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 01:43:23,405 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:43:23,405 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:43:23,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 01:43:23,405 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:43:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:43:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2122603733, now seen corresponding path program 1 times [2020-10-22 01:43:23,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:43:23,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498319867] [2020-10-22 01:43:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:43:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:43:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:43:23,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498319867] [2020-10-22 01:43:23,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:43:23,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:43:23,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [826405286] [2020-10-22 01:43:23,469 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:43:23,471 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:43:23,477 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 79 transitions. [2020-10-22 01:43:23,478 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:43:23,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:23,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:24,000 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [38350#(not (= 4 ~__unbuffered_cnt~0))] [2020-10-22 01:43:24,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 01:43:24,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:43:24,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 01:43:24,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 01:43:24,003 INFO L87 Difference]: Start difference. First operand 2290 states and 8670 transitions. Second operand 5 states. [2020-10-22 01:43:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:43:24,147 INFO L93 Difference]: Finished difference Result 1740 states and 5916 transitions. [2020-10-22 01:43:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 01:43:24,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-22 01:43:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:43:24,158 INFO L225 Difference]: With dead ends: 1740 [2020-10-22 01:43:24,158 INFO L226 Difference]: Without dead ends: 1140 [2020-10-22 01:43:24,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:43:24,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2020-10-22 01:43:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2020-10-22 01:43:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1140 states. [2020-10-22 01:43:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 3518 transitions. [2020-10-22 01:43:24,201 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 3518 transitions. Word has length 15 [2020-10-22 01:43:24,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:43:24,201 INFO L481 AbstractCegarLoop]: Abstraction has 1140 states and 3518 transitions. [2020-10-22 01:43:24,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 01:43:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 3518 transitions. [2020-10-22 01:43:24,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 01:43:24,205 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:43:24,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:43:24,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 01:43:24,206 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:43:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:43:24,206 INFO L82 PathProgramCache]: Analyzing trace with hash -200781553, now seen corresponding path program 1 times [2020-10-22 01:43:24,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:43:24,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242078159] [2020-10-22 01:43:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:43:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:43:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:43:24,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242078159] [2020-10-22 01:43:24,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:43:24,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 01:43:24,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1215394981] [2020-10-22 01:43:24,469 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:43:24,475 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:43:24,516 INFO L252 McrAutomatonBuilder]: Finished intersection with 127 states and 252 transitions. [2020-10-22 01:43:24,517 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:43:24,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:25,002 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 4 [2020-10-22 01:43:25,266 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 3 [2020-10-22 01:43:25,776 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 01:43:26,254 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 3 [2020-10-22 01:43:26,526 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [42384#(<= ~__unbuffered_cnt~0 0), 42381#(not (= 4 ~__unbuffered_cnt~0)), 42382#(not (= ~__unbuffered_cnt~0 3)), 42383#(not (= ~__unbuffered_cnt~0 2))] [2020-10-22 01:43:26,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-22 01:43:26,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:43:26,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-22 01:43:26,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-10-22 01:43:26,527 INFO L87 Difference]: Start difference. First operand 1140 states and 3518 transitions. Second operand 10 states. [2020-10-22 01:43:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:43:26,643 INFO L93 Difference]: Finished difference Result 965 states and 3018 transitions. [2020-10-22 01:43:26,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-22 01:43:26,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-22 01:43:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:43:26,650 INFO L225 Difference]: With dead ends: 965 [2020-10-22 01:43:26,651 INFO L226 Difference]: Without dead ends: 853 [2020-10-22 01:43:26,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-22 01:43:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2020-10-22 01:43:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2020-10-22 01:43:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2020-10-22 01:43:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2701 transitions. [2020-10-22 01:43:26,677 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 2701 transitions. Word has length 20 [2020-10-22 01:43:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:43:26,678 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 2701 transitions. [2020-10-22 01:43:26,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-22 01:43:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 2701 transitions. [2020-10-22 01:43:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-22 01:43:26,681 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:43:26,681 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:43:26,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 01:43:26,682 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:43:26,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:43:26,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1974878827, now seen corresponding path program 1 times [2020-10-22 01:43:26,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:43:26,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363247474] [2020-10-22 01:43:26,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:43:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:43:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:43:26,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363247474] [2020-10-22 01:43:26,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:43:26,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:43:26,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [638098786] [2020-10-22 01:43:26,760 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:43:26,768 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:43:26,985 INFO L252 McrAutomatonBuilder]: Finished intersection with 224 states and 472 transitions. [2020-10-22 01:43:26,985 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:43:27,691 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-22 01:43:28,199 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 3 [2020-10-22 01:43:28,890 WARN L193 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 01:43:29,625 WARN L193 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 3 [2020-10-22 01:43:29,736 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:43:29,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:43:29,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:43:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:43:29,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:43:29,738 INFO L87 Difference]: Start difference. First operand 853 states and 2701 transitions. Second operand 4 states. [2020-10-22 01:43:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:43:29,759 INFO L93 Difference]: Finished difference Result 1080 states and 3363 transitions. [2020-10-22 01:43:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:43:29,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-22 01:43:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:43:29,763 INFO L225 Difference]: With dead ends: 1080 [2020-10-22 01:43:29,764 INFO L226 Difference]: Without dead ends: 442 [2020-10-22 01:43:29,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 01:43:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-22 01:43:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-10-22 01:43:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-22 01:43:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1255 transitions. [2020-10-22 01:43:29,776 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1255 transitions. Word has length 27 [2020-10-22 01:43:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:43:29,777 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1255 transitions. [2020-10-22 01:43:29,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:43:29,777 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1255 transitions. [2020-10-22 01:43:29,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-22 01:43:29,778 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:43:29,779 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:43:29,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 01:43:29,779 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:43:29,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:43:29,780 INFO L82 PathProgramCache]: Analyzing trace with hash 95322943, now seen corresponding path program 2 times [2020-10-22 01:43:29,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:43:29,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602951456] [2020-10-22 01:43:29,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:43:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:43:29,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-10-22 01:43:29,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602951456] [2020-10-22 01:43:29,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:43:29,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 01:43:29,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1578767012] [2020-10-22 01:43:29,835 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:43:29,841 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:43:29,895 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 179 transitions. [2020-10-22 01:43:29,895 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:43:30,131 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:43:30,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:43:30,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:43:30,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:43:30,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:43:30,133 INFO L87 Difference]: Start difference. First operand 442 states and 1255 transitions. Second operand 3 states. [2020-10-22 01:43:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:43:30,153 INFO L93 Difference]: Finished difference Result 564 states and 1583 transitions. [2020-10-22 01:43:30,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:43:30,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-22 01:43:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:43:30,156 INFO L225 Difference]: With dead ends: 564 [2020-10-22 01:43:30,156 INFO L226 Difference]: Without dead ends: 214 [2020-10-22 01:43:30,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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-10-22 01:43:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-10-22 01:43:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-10-22 01:43:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-22 01:43:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 543 transitions. [2020-10-22 01:43:30,162 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 543 transitions. Word has length 27 [2020-10-22 01:43:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:43:30,162 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 543 transitions. [2020-10-22 01:43:30,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:43:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 543 transitions. [2020-10-22 01:43:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-22 01:43:30,164 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:43:30,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:43:30,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 01:43:30,164 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:43:30,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:43:30,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1331134533, now seen corresponding path program 3 times [2020-10-22 01:43:30,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:43:30,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138753922] [2020-10-22 01:43:30,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:43:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:43:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:43:30,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138753922] [2020-10-22 01:43:30,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:43:30,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:43:30,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [388518499] [2020-10-22 01:43:30,220 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:43:30,225 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:43:30,378 INFO L252 McrAutomatonBuilder]: Finished intersection with 149 states and 308 transitions. [2020-10-22 01:43:30,378 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:43:31,077 WARN L193 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:43:31,567 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:43:31,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:43:31,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:43:31,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:43:31,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:43:31,569 INFO L87 Difference]: Start difference. First operand 214 states and 543 transitions. Second operand 4 states. [2020-10-22 01:43:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:43:31,607 INFO L93 Difference]: Finished difference Result 443 states and 1120 transitions. [2020-10-22 01:43:31,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:43:31,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-22 01:43:31,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:43:31,609 INFO L225 Difference]: With dead ends: 443 [2020-10-22 01:43:31,609 INFO L226 Difference]: Without dead ends: 138 [2020-10-22 01:43:31,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 01:43:31,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-10-22 01:43:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-10-22 01:43:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-22 01:43:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 323 transitions. [2020-10-22 01:43:31,615 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 323 transitions. Word has length 27 [2020-10-22 01:43:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:43:31,615 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 323 transitions. [2020-10-22 01:43:31,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:43:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 323 transitions. [2020-10-22 01:43:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-22 01:43:31,618 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:43:31,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:43:31,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 01:43:31,618 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:43:31,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:43:31,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2136042089, now seen corresponding path program 4 times [2020-10-22 01:43:31,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:43:31,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076116469] [2020-10-22 01:43:31,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:43:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:43:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:43:31,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076116469] [2020-10-22 01:43:31,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:43:31,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 01:43:31,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [13096979] [2020-10-22 01:43:31,920 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:43:31,925 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:43:32,006 INFO L252 McrAutomatonBuilder]: Finished intersection with 173 states and 362 transitions. [2020-10-22 01:43:32,007 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:43:32,155 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:43:32,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:32,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:32,169 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:32,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:32,172 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:32,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:32,174 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 2, 2, 1] term [2020-10-22 01:43:32,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:32,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:32,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:32,177 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:32,193 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:32,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,198 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:32,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,217 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:32,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:32,222 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:32,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,228 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:32,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:32,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:32,253 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:32,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:32,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:32,267 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:32,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,271 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:32,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:32,298 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:32,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,302 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:32,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:32,321 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:32,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,325 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:32,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,341 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:32,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:32,346 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:32,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,349 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:32,357 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:32,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,107 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 28 [2020-10-22 01:43:33,411 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-22 01:43:33,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,427 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:43:33,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,430 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:33,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:33,436 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:33,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:33,454 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:33,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:33,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,499 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:43:33,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,867 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:43:33,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,873 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:43:33,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,875 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:33,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:43:33,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:43:33,882 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:33,887 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 5 conjuncts [2020-10-22 01:43:33,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:33,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,894 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:33,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:33,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:33,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:33,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:33,943 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:33,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:33,960 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:33,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,975 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:33,982 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:33,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:33,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:34,002 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-22 01:43:34,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:34,459 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-10-22 01:43:34,922 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-10-22 01:43:34,929 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:43:34,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:34,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:34,935 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:43:34,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:34,937 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:34,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:34,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:34,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:34,950 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:34,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:34,953 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:34,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:34,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:34,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:34,965 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:34,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:34,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:34,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:43:34,974 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:34,975 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:43:34,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:34,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:34,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:34,986 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 5 conjuncts [2020-10-22 01:43:34,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:34,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:34,992 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:34,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:35,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:35,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:35,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:35,025 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:35,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,033 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:35,037 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 5 conjuncts [2020-10-22 01:43:35,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:35,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,043 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:35,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:35,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:35,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:35,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:35,076 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:43:35,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,084 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-22 01:43:35,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:35,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:35,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:35,302 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:35,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:35,304 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:35,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:35,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:35,307 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:35,307 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:35,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:35,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:35,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:35,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:35,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:35,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,365 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:35,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:35,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:35,390 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:35,399 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:43:35,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:35,981 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 31 [2020-10-22 01:43:36,444 WARN L193 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-10-22 01:43:36,453 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:43:36,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:36,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:36,459 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:43:36,460 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:36,461 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:36,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:36,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:36,464 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:43:36,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:36,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,470 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:36,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:36,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,506 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 3 conjuncts [2020-10-22 01:43:36,507 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:43:36,508 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:36,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:36,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,518 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:36,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:36,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,540 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:36,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:36,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,549 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:36,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:36,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:36,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:36,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:43:36,579 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:36,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:36,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:36,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:36,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,610 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:36,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:36,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:36,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:36,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:36,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:36,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:36,648 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-22 01:43:36,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,182 WARN L193 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 101 [2020-10-22 01:43:37,191 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:43:37,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,197 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:43:37,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,199 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:37,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:37,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,202 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:43:37,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,211 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:37,220 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:37,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:37,228 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:37,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:37,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,246 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:37,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:37,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,265 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,269 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:37,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:37,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,316 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:37,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,326 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:37,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:37,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:37,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:43:37,366 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:37,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:37,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:37,387 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:37,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:37,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:37,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,620 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 21 [2020-10-22 01:43:37,944 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 126 [2020-10-22 01:43:37,951 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:43:37,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,956 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:43:37,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,957 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:37,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,958 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:37,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,960 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:43:37,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:37,966 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:37,973 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:37,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:37,979 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:37,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:37,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:37,993 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:37,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:38,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,014 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:38,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:38,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:38,046 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:38,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:38,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:38,053 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:38,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:38,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:38,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:38,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:43:38,085 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:38,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:38,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:38,102 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:38,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:38,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:38,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:38,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:38,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:38,179 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [48768#(or (and (= ~y$r_buff0_thd4~0 0) (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd2~0 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))), 48769#(and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0~0 1) (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff1_thd4~0 0) (= ~__unbuffered_cnt~0 0)), 48762#(and (= ~__unbuffered_p1_EBX~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), 48763#(and (or (and (not (= (mod ~y$r_buff0_thd4~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))) (= (mod ~y$r_buff1_thd4~0 256) 0)) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (or (= ~y~0 1) (and (not (= (mod ~y$r_buff0_thd4~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))))), 48764#(and (= ~__unbuffered_p1_EBX~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)), 48765#(and (= ~y~0 1) (= ~y$r_buff1_thd2~0 0) (<= ~__unbuffered_cnt~0 0) (= ~y$w_buff0~0 1) (<= 0 ~__unbuffered_cnt~0)), 48766#(and (or (and (not (= (mod ~y$r_buff0_thd4~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))) (= (mod ~y$r_buff1_thd4~0 256) 0)) (= ~y$r_buff1_thd2~0 0) (<= ~__unbuffered_cnt~0 0) (= ~y$w_buff0~0 1) (<= 0 ~__unbuffered_cnt~0) (or (= ~y~0 1) (and (not (= (mod ~y$r_buff0_thd4~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))))), 48767#(and (or (= 0 (mod ~y$r_buff0_thd3~0 256)) (and (= ~y$r_buff1_thd2~0 0) (<= ~__unbuffered_cnt~0 0) (= ~y$w_buff0~0 1) (<= 0 ~__unbuffered_cnt~0) (= (mod ~y$r_buff1_thd4~0 256) 0))) (or (and (not (= (mod ~y$r_buff0_thd4~0 256) 0)) (= ~y$r_buff1_thd2~0 0) (<= ~__unbuffered_cnt~0 0) (= ~y$w_buff0~0 1) (<= 0 ~__unbuffered_cnt~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0)))))] [2020-10-22 01:43:38,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-22 01:43:38,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:43:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-22 01:43:38,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2020-10-22 01:43:38,180 INFO L87 Difference]: Start difference. First operand 138 states and 323 transitions. Second operand 20 states. [2020-10-22 01:43:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:43:38,963 INFO L93 Difference]: Finished difference Result 213 states and 494 transitions. [2020-10-22 01:43:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-22 01:43:38,963 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2020-10-22 01:43:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:43:38,965 INFO L225 Difference]: With dead ends: 213 [2020-10-22 01:43:38,965 INFO L226 Difference]: Without dead ends: 184 [2020-10-22 01:43:38,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2020-10-22 01:43:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-10-22 01:43:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2020-10-22 01:43:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-22 01:43:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 369 transitions. [2020-10-22 01:43:38,974 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 369 transitions. Word has length 27 [2020-10-22 01:43:38,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:43:38,974 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 369 transitions. [2020-10-22 01:43:38,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-22 01:43:38,974 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 369 transitions. [2020-10-22 01:43:38,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-22 01:43:38,975 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:43:38,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:43:38,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 01:43:38,976 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:43:38,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:43:38,976 INFO L82 PathProgramCache]: Analyzing trace with hash 416450791, now seen corresponding path program 5 times [2020-10-22 01:43:38,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:43:38,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259616642] [2020-10-22 01:43:38,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:43:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:43:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:43:39,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259616642] [2020-10-22 01:43:39,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:43:39,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 01:43:39,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1453449928] [2020-10-22 01:43:39,165 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:43:39,171 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:43:39,318 INFO L252 McrAutomatonBuilder]: Finished intersection with 174 states and 365 transitions. [2020-10-22 01:43:39,318 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:43:39,415 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-22 01:43:39,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,416 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:43:39,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,418 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:39,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,419 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:39,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,421 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:39,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,430 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:39,433 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:39,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:39,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,456 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:39,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:39,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,478 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:39,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,486 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:43:39,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,673 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 29 [2020-10-22 01:43:39,771 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-22 01:43:39,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,772 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:43:39,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,774 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:39,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,775 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:39,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,777 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:39,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:39,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:39,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,807 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:39,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,814 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:39,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:43:39,830 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:39,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:39,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:39,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:39,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,854 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:39,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:39,863 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:43:39,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,111 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 92 [2020-10-22 01:43:40,119 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-22 01:43:40,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,121 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:43:40,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,123 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:40,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,125 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:40,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,129 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:40,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,154 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:40,155 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:40,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:40,177 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:40,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,188 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:40,193 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:40,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:40,208 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:43:40,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,551 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 92 [2020-10-22 01:43:40,556 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-22 01:43:40,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,557 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:43:40,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,561 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:40,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,562 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:40,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,567 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:40,571 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:40,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:40,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:40,597 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:40,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,615 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:40,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,632 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:40,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:40,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:43:40,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:40,797 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 28 [2020-10-22 01:43:40,993 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 92 [2020-10-22 01:43:41,001 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-22 01:43:41,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,002 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:43:41,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,005 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:43:41,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:41,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:43:41,009 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:41,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,036 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:41,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,081 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:43:41,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,212 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-22 01:43:41,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,213 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:43:41,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,216 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:43:41,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,217 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:41,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:43:41,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,232 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:41,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,248 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:41,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,261 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:43:41,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,473 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 92 [2020-10-22 01:43:41,477 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-22 01:43:41,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,478 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:43:41,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,480 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:41,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,482 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:41,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,483 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:41,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,495 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:41,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,516 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:41,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,545 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:43:41,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,672 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-22 01:43:41,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,673 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:43:41,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,675 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:41,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,676 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:41,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,688 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:41,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,702 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:41,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,712 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:41,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,725 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:41,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,733 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:41,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,739 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:43:41,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,795 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 2, 2, 1] term [2020-10-22 01:43:41,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,796 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 1] term [2020-10-22 01:43:41,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,798 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:43:41,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,799 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:41,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,808 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:41,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,820 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:41,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:41,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:41,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:41,855 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 4, 3, 2, 1] term [2020-10-22 01:43:41,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,065 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 27 [2020-10-22 01:43:42,158 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 2, 2, 1] term [2020-10-22 01:43:42,158 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,159 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 1] term [2020-10-22 01:43:42,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,165 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:43:42,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,166 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:42,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,181 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:42,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:42,190 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:42,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:42,200 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:42,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:42,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,226 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:42,240 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 4, 3, 2, 1] term [2020-10-22 01:43:42,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,376 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 26 [2020-10-22 01:43:42,497 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2020-10-22 01:43:42,502 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 2, 2, 1] term [2020-10-22 01:43:42,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,503 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 1] term [2020-10-22 01:43:42,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,506 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:42,507 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,508 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:42,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,509 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:42,510 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:42,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:42,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:42,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:42,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,549 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:42,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:42,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:42,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:42,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,645 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 4, 3, 2, 1] term [2020-10-22 01:43:42,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,810 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2020-10-22 01:43:42,819 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-22 01:43:42,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,819 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:43:42,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,822 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:42,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,823 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:42,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,829 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:42,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,846 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:42,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:42,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,856 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:42,859 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:42,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:42,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,871 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:42,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:42,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:42,883 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:43:42,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,057 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-22 01:43:43,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,058 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:43:43,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,061 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:43,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,062 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:43,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,064 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:43,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,082 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:43,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:43,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:43,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:43,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,102 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:43,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:43,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:43,112 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:43,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,157 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:43:43,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,511 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2020-10-22 01:43:43,515 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-22 01:43:43,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,516 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:43:43,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,520 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:43,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,522 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:43,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,536 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:43,540 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:43,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:43,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,556 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:43,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:43,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,581 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:43:43,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,599 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:43:43,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,894 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 123 [2020-10-22 01:43:43,905 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-22 01:43:43,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,906 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-22 01:43:43,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,910 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:43,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,912 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:43:43,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:43:43,915 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:43,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:43:43,925 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:43:43,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:43,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,941 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:43,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:43,970 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:43:43,971 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:43:43,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:43,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:43,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:43:43,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:43,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:44,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:44,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:44,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:44,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:44,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:43:44,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:43:44,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:43:44,164 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [49328#(and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff1_thd4~0 0) (not (= ~y$w_buff0~0 0))), 49329#(or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd4~0 0)), 49326#(and (or (= (mod ~y$w_buff0_used~0 256) 0) (not (= ~y$w_buff0~0 0))) (or (and (not (= (mod ~y$r_buff0_thd4~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))) (and (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (mod ~y$r_buff1_thd4~0 256) 0) (<= 0 (div ~y$w_buff0_used~0 256)) (not (= ~y~0 0))))), 49327#(and (or (and (not (= (mod ~y$r_buff0_thd4~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0)) (not (= ~y$w_buff0~0 0))) (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0)))) (or (= 0 (mod ~y$r_buff0_thd3~0 256)) (and (= (mod ~y$r_buff1_thd4~0 256) 0) (not (= ~y$w_buff0~0 0)))))] [2020-10-22 01:43:44,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 01:43:44,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:43:44,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 01:43:44,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-22 01:43:44,166 INFO L87 Difference]: Start difference. First operand 163 states and 369 transitions. Second operand 11 states. [2020-10-22 01:43:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:43:44,392 INFO L93 Difference]: Finished difference Result 181 states and 399 transitions. [2020-10-22 01:43:44,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 01:43:44,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-22 01:43:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:43:44,395 INFO L225 Difference]: With dead ends: 181 [2020-10-22 01:43:44,395 INFO L226 Difference]: Without dead ends: 80 [2020-10-22 01:43:44,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-10-22 01:43:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-22 01:43:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-10-22 01:43:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-22 01:43:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 157 transitions. [2020-10-22 01:43:44,400 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 157 transitions. Word has length 27 [2020-10-22 01:43:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:43:44,400 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 157 transitions. [2020-10-22 01:43:44,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 01:43:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 157 transitions. [2020-10-22 01:43:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-22 01:43:44,401 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:43:44,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:43:44,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 01:43:44,402 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:43:44,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:43:44,403 INFO L82 PathProgramCache]: Analyzing trace with hash -865695065, now seen corresponding path program 6 times [2020-10-22 01:43:44,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:43:44,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551095603] [2020-10-22 01:43:44,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:43:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:43:44,501 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:43:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:43:44,559 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:43:44,610 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 01:43:44,611 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 01:43:44,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 01:43:44,612 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 01:43:44,656 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L3-->L877: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In-793277085 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-793277085 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-793277085 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-793277085 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~y$r_buff1_thd0~0_Out-793277085 ~y$r_buff1_thd0~0_In-793277085) (or (and .cse0 (= ~y$w_buff1_used~0_Out-793277085 ~y$w_buff1_used~0_In-793277085)) (and .cse1 .cse2 (= ~y$w_buff1_used~0_Out-793277085 0))) (or (and .cse3 (or (and .cse0 (= ~y~0_Out-793277085 ~y~0_In-793277085)) (and (= ~y~0_Out-793277085 ~y$w_buff1~0_In-793277085) .cse1 .cse2))) (and .cse4 .cse5 (= ~y~0_Out-793277085 ~y$w_buff0~0_In-793277085))) (= ~y$r_buff0_thd0~0_In-793277085 ~y$r_buff0_thd0~0_Out-793277085) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-793277085 0)) (or (and .cse3 (= ~y$w_buff0_used~0_In-793277085 ~y$w_buff0_used~0_Out-793277085)) (and .cse4 .cse5 (= ~y$w_buff0_used~0_Out-793277085 0)))))) InVars {ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-793277085, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-793277085, ~y$w_buff1~0=~y$w_buff1~0_In-793277085, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-793277085, ~y$w_buff0~0=~y$w_buff0~0_In-793277085, ~y~0=~y~0_In-793277085, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-793277085, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-793277085} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-793277085, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-793277085|, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-793277085|, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-793277085|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-793277085|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-793277085|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-793277085|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-793277085, ~y$w_buff1~0=~y$w_buff1~0_In-793277085, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-793277085, ~y$w_buff0~0=~y$w_buff0~0_In-793277085, ~y~0=~y~0_Out-793277085, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-793277085, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-793277085} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-22 01:43:44,665 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,665 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,665 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [797] [2020-10-22 01:43:44,667 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,667 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,667 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,668 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,668 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,670 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,670 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,671 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,671 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,672 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,672 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,673 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:43:44,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:43:44,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 01:43:44 BasicIcfg [2020-10-22 01:43:44,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 01:43:44,766 INFO L168 Benchmark]: Toolchain (without parser) took 30682.92 ms. Allocated memory was 138.9 MB in the beginning and 731.4 MB in the end (delta: 592.4 MB). Free memory was 100.4 MB in the beginning and 391.7 MB in the end (delta: -291.2 MB). Peak memory consumption was 301.2 MB. Max. memory is 7.1 GB. [2020-10-22 01:43:44,766 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 01:43:44,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.74 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 99.6 MB in the beginning and 152.4 MB in the end (delta: -52.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-10-22 01:43:44,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.35 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 149.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-22 01:43:44,769 INFO L168 Benchmark]: Boogie Preprocessor took 42.44 ms. Allocated memory is still 202.4 MB. Free memory was 149.6 MB in the beginning and 147.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-22 01:43:44,770 INFO L168 Benchmark]: RCFGBuilder took 2289.43 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 147.5 MB in the beginning and 185.9 MB in the end (delta: -38.4 MB). Peak memory consumption was 101.6 MB. Max. memory is 7.1 GB. [2020-10-22 01:43:44,770 INFO L168 Benchmark]: TraceAbstraction took 27463.46 ms. Allocated memory was 248.5 MB in the beginning and 731.4 MB in the end (delta: 482.9 MB). Free memory was 184.1 MB in the beginning and 391.7 MB in the end (delta: -207.6 MB). Peak memory consumption was 275.3 MB. Max. memory is 7.1 GB. [2020-10-22 01:43:44,775 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.74 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 99.6 MB in the beginning and 152.4 MB in the end (delta: -52.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.35 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 149.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.44 ms. Allocated memory is still 202.4 MB. Free memory was 149.6 MB in the beginning and 147.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2289.43 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 147.5 MB in the beginning and 185.9 MB in the end (delta: -38.4 MB). Peak memory consumption was 101.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27463.46 ms. Allocated memory was 248.5 MB in the beginning and 731.4 MB in the end (delta: 482.9 MB). Free memory was 184.1 MB in the beginning and 391.7 MB in the end (delta: -207.6 MB). Peak memory consumption was 275.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1472 VarBasedMoverChecksPositive, 62 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 153 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.6s, 131 PlacesBefore, 46 PlacesAfterwards, 121 TransitionsBefore, 33 TransitionsAfterwards, 2862 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 102 TotalNumberOfCompositions, 7701 MoverChecksTotal - 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; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L859] 0 pthread_t t621; [L860] FCALL, FORK 0 pthread_create(&t621, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L861] 0 pthread_t t622; [L862] FCALL, FORK 0 pthread_create(&t622, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L863] 0 pthread_t t623; [L864] FCALL, FORK 0 pthread_create(&t623, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L865] 0 pthread_t t624; [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "mix023_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t624, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L834] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L837] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L838] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L840] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L841] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L755] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L770] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1 [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L782] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = y [L785] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L818] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix023_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 388 SDtfs, 448 SDslu, 1064 SDs, 0 SdLazy, 735 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 283 SyntacticMatches, 23 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 21 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 23007 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...