/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/mix051_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:00:32,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:00:32,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:00:32,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:00:32,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:00:32,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:00:32,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:00:32,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:00:32,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:00:32,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:00:32,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:00:32,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:00:32,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:00:32,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:00:32,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:00:32,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:00:32,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:00:32,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:00:32,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:00:32,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:00:32,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:00:32,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:00:32,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:00:32,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:00:32,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:00:32,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:00:32,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:00:32,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:00:32,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:00:32,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:00:32,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:00:32,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:00:32,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:00:32,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:00:32,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:00:32,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:00:32,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:00:32,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:00:32,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:00:32,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:00:32,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:00:32,648 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 02:00:32,696 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:00:32,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:00:32,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:00:32,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:00:32,698 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:00:32,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:00:32,698 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:00:32,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:00:32,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:00:32,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:00:32,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:00:32,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:00:32,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:00:32,699 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:00:32,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:00:32,700 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:00:32,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:00:32,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:00:32,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:00:32,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:00:32,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:00:32,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:00:32,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:00:32,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:00:32,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:00:32,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:00:32,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:00:32,702 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:00:32,702 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:00:32,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:00:32,703 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:00:33,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:00:33,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:00:33,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:00:33,029 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:00:33,030 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:00:33,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2020-10-22 02:00:33,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/612d3d75d/9ffd79aa4de34762ab6c64aaaef4bc3e/FLAG108150e8a [2020-10-22 02:00:33,702 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:00:33,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2020-10-22 02:00:33,720 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/612d3d75d/9ffd79aa4de34762ab6c64aaaef4bc3e/FLAG108150e8a [2020-10-22 02:00:33,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/612d3d75d/9ffd79aa4de34762ab6c64aaaef4bc3e [2020-10-22 02:00:33,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:00:33,964 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:00:33,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:00:33,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:00:33,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:00:33,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:00:33" (1/1) ... [2020-10-22 02:00:33,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e6f1a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:33, skipping insertion in model container [2020-10-22 02:00:33,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:00:33" (1/1) ... [2020-10-22 02:00:33,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:00:34,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:00:34,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:00:34,644 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:00:34,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:00:34,802 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:00:34,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:34 WrapperNode [2020-10-22 02:00:34,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:00:34,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:00:34,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:00:34,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:00:34,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:34" (1/1) ... [2020-10-22 02:00:34,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:34" (1/1) ... [2020-10-22 02:00:34,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:00:34,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:00:34,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:00:34,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:00:34,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:34" (1/1) ... [2020-10-22 02:00:34,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:34" (1/1) ... [2020-10-22 02:00:34,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:34" (1/1) ... [2020-10-22 02:00:34,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:34" (1/1) ... [2020-10-22 02:00:34,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:34" (1/1) ... [2020-10-22 02:00:34,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:34" (1/1) ... [2020-10-22 02:00:34,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:34" (1/1) ... [2020-10-22 02:00:34,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:00:34,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:00:34,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:00:34,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:00:34,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:34" (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 02:00:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:00:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:00:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:00:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:00:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:00:34,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:00:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:00:34,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:00:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:00:34,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:00:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-22 02:00:34,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-22 02:00:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:00:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:00:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:00:34,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:00:34,999 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 02:00:37,295 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:00:37,295 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:00:37,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:00:37 BoogieIcfgContainer [2020-10-22 02:00:37,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:00:37,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:00:37,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:00:37,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:00:37,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:00:33" (1/3) ... [2020-10-22 02:00:37,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1f6bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:00:37, skipping insertion in model container [2020-10-22 02:00:37,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:00:34" (2/3) ... [2020-10-22 02:00:37,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1f6bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:00:37, skipping insertion in model container [2020-10-22 02:00:37,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:00:37" (3/3) ... [2020-10-22 02:00:37,307 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2020-10-22 02:00:37,319 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:00:37,319 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:00:37,328 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:00:37,329 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:00:37,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,371 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,371 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,373 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,374 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,374 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,380 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,382 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,382 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,385 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,386 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,389 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,391 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,393 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,394 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:00:37,395 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:00:37,409 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-22 02:00:37,430 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:00:37,430 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:00:37,430 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:00:37,430 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:00:37,431 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:00:37,431 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:00:37,431 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:00:37,431 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:00:37,445 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:00:37,446 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-10-22 02:00:37,449 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-10-22 02:00:37,451 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-10-22 02:00:37,506 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-10-22 02:00:37,506 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:00:37,512 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-10-22 02:00:37,516 INFO L116 LiptonReduction]: Number of co-enabled transitions 2896 [2020-10-22 02:00:37,881 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 02:00:39,970 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-22 02:00:40,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-22 02:00:40,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:00:40,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-22 02:00:40,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:00:41,171 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-22 02:00:42,786 WARN L193 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 119 [2020-10-22 02:00:43,214 WARN L193 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-22 02:00:43,789 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-22 02:00:44,157 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-22 02:00:44,779 WARN L193 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-22 02:00:45,088 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-22 02:00:45,659 WARN L193 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-22 02:00:46,233 WARN L193 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-22 02:00:46,541 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-22 02:00:46,661 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-22 02:00:47,160 WARN L193 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-10-22 02:00:47,357 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-22 02:00:47,369 INFO L131 LiptonReduction]: Checked pairs total: 8383 [2020-10-22 02:00:47,369 INFO L133 LiptonReduction]: Total number of compositions: 101 [2020-10-22 02:00:47,376 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-22 02:00:47,649 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4122 states. [2020-10-22 02:00:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states. [2020-10-22 02:00:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-22 02:00:47,659 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:47,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-22 02:00:47,661 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:47,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1192686716, now seen corresponding path program 1 times [2020-10-22 02:00:47,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:47,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81133110] [2020-10-22 02:00:47,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:47,968 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 02:00:47,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81133110] [2020-10-22 02:00:47,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:47,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:00:47,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [558122503] [2020-10-22 02:00:47,971 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:47,974 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:47,987 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-22 02:00:47,988 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:47,992 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:00:47,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:00:47,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:48,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:00:48,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:00:48,011 INFO L87 Difference]: Start difference. First operand 4122 states. Second operand 3 states. [2020-10-22 02:00:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:48,201 INFO L93 Difference]: Finished difference Result 3437 states and 13500 transitions. [2020-10-22 02:00:48,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:00:48,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-22 02:00:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:48,250 INFO L225 Difference]: With dead ends: 3437 [2020-10-22 02:00:48,250 INFO L226 Difference]: Without dead ends: 2812 [2020-10-22 02:00:48,252 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 02:00:48,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2020-10-22 02:00:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2812. [2020-10-22 02:00:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2812 states. [2020-10-22 02:00:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 10875 transitions. [2020-10-22 02:00:48,459 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 10875 transitions. Word has length 5 [2020-10-22 02:00:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:48,459 INFO L481 AbstractCegarLoop]: Abstraction has 2812 states and 10875 transitions. [2020-10-22 02:00:48,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:00:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 10875 transitions. [2020-10-22 02:00:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:00:48,465 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:48,465 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:48,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:00:48,466 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:48,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:48,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1586905763, now seen corresponding path program 1 times [2020-10-22 02:00:48,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:48,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284891] [2020-10-22 02:00:48,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:48,674 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 02:00:48,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284891] [2020-10-22 02:00:48,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:48,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:00:48,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2041719220] [2020-10-22 02:00:48,675 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:48,677 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:48,679 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 02:00:48,679 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:48,680 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:00:48,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:00:48,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:48,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:00:48,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:00:48,682 INFO L87 Difference]: Start difference. First operand 2812 states and 10875 transitions. Second operand 3 states. [2020-10-22 02:00:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:48,760 INFO L93 Difference]: Finished difference Result 2762 states and 10645 transitions. [2020-10-22 02:00:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:00:48,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 02:00:48,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:48,789 INFO L225 Difference]: With dead ends: 2762 [2020-10-22 02:00:48,789 INFO L226 Difference]: Without dead ends: 2762 [2020-10-22 02:00:48,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:00:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2020-10-22 02:00:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762. [2020-10-22 02:00:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2020-10-22 02:00:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 10645 transitions. [2020-10-22 02:00:48,903 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 10645 transitions. Word has length 11 [2020-10-22 02:00:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:48,904 INFO L481 AbstractCegarLoop]: Abstraction has 2762 states and 10645 transitions. [2020-10-22 02:00:48,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:00:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 10645 transitions. [2020-10-22 02:00:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:00:48,908 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:48,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:48,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:00:48,908 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:48,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1804240950, now seen corresponding path program 1 times [2020-10-22 02:00:48,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:48,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85382520] [2020-10-22 02:00:48,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:49,167 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 02:00:49,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85382520] [2020-10-22 02:00:49,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:49,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:00:49,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [696894372] [2020-10-22 02:00:49,168 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:49,170 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:49,174 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 22 transitions. [2020-10-22 02:00:49,174 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:49,364 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [25735#(or (and (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd0~0) (<= ~x$r_buff0_thd0~0 0) (not (= 2 ~x~0))) (not (= (mod ~x$w_buff0_used~0 256) 0)))] [2020-10-22 02:00:49,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:00:49,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:49,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:00:49,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:00:49,366 INFO L87 Difference]: Start difference. First operand 2762 states and 10645 transitions. Second operand 6 states. [2020-10-22 02:00:49,493 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2020-10-22 02:00:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:49,662 INFO L93 Difference]: Finished difference Result 3626 states and 14077 transitions. [2020-10-22 02:00:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:00:49,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-22 02:00:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:49,695 INFO L225 Difference]: With dead ends: 3626 [2020-10-22 02:00:49,695 INFO L226 Difference]: Without dead ends: 3626 [2020-10-22 02:00:49,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:00:49,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2020-10-22 02:00:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2816. [2020-10-22 02:00:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2816 states. [2020-10-22 02:00:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 10861 transitions. [2020-10-22 02:00:49,827 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 10861 transitions. Word has length 12 [2020-10-22 02:00:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:49,827 INFO L481 AbstractCegarLoop]: Abstraction has 2816 states and 10861 transitions. [2020-10-22 02:00:49,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:00:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 10861 transitions. [2020-10-22 02:00:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:00:49,833 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:49,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:49,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:00:49,834 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:49,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:49,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1949437596, now seen corresponding path program 2 times [2020-10-22 02:00:49,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:49,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220236872] [2020-10-22 02:00:49,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:50,026 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 02:00:50,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220236872] [2020-10-22 02:00:50,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:50,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:00:50,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [193410842] [2020-10-22 02:00:50,027 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:50,029 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:50,031 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2020-10-22 02:00:50,032 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:50,032 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:00:50,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:00:50,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:00:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:00:50,033 INFO L87 Difference]: Start difference. First operand 2816 states and 10861 transitions. Second operand 5 states. [2020-10-22 02:00:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:50,126 INFO L93 Difference]: Finished difference Result 2988 states and 11513 transitions. [2020-10-22 02:00:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:00:50,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-22 02:00:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:50,152 INFO L225 Difference]: With dead ends: 2988 [2020-10-22 02:00:50,152 INFO L226 Difference]: Without dead ends: 2988 [2020-10-22 02:00:50,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:00:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-10-22 02:00:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2988. [2020-10-22 02:00:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2020-10-22 02:00:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 11513 transitions. [2020-10-22 02:00:50,265 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 11513 transitions. Word has length 12 [2020-10-22 02:00:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:50,265 INFO L481 AbstractCegarLoop]: Abstraction has 2988 states and 11513 transitions. [2020-10-22 02:00:50,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:00:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 11513 transitions. [2020-10-22 02:00:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:00:50,267 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:50,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:50,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:00:50,268 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:50,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1521554523, now seen corresponding path program 1 times [2020-10-22 02:00:50,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:50,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768501129] [2020-10-22 02:00:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:50,429 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 02:00:50,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768501129] [2020-10-22 02:00:50,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:50,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:00:50,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1381049659] [2020-10-22 02:00:50,430 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:50,432 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:50,435 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 41 transitions. [2020-10-22 02:00:50,436 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:50,928 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:00:50,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:00:50,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:50,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:00:50,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:00:50,930 INFO L87 Difference]: Start difference. First operand 2988 states and 11513 transitions. Second operand 5 states. [2020-10-22 02:00:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:51,128 INFO L93 Difference]: Finished difference Result 2974 states and 11437 transitions. [2020-10-22 02:00:51,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:00:51,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 02:00:51,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:51,231 INFO L225 Difference]: With dead ends: 2974 [2020-10-22 02:00:51,231 INFO L226 Difference]: Without dead ends: 2974 [2020-10-22 02:00:51,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:00:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-10-22 02:00:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 2913. [2020-10-22 02:00:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2020-10-22 02:00:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 11193 transitions. [2020-10-22 02:00:51,331 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 11193 transitions. Word has length 13 [2020-10-22 02:00:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:51,331 INFO L481 AbstractCegarLoop]: Abstraction has 2913 states and 11193 transitions. [2020-10-22 02:00:51,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:00:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 11193 transitions. [2020-10-22 02:00:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:00:51,334 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:51,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:51,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:00:51,335 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:51,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:51,336 INFO L82 PathProgramCache]: Analyzing trace with hash -76450844, now seen corresponding path program 1 times [2020-10-22 02:00:51,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:51,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397537455] [2020-10-22 02:00:51,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:51,496 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 02:00:51,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397537455] [2020-10-22 02:00:51,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:51,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:00:51,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1835574970] [2020-10-22 02:00:51,497 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:51,499 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:51,504 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 42 transitions. [2020-10-22 02:00:51,505 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:51,854 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:00:51,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:00:51,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:51,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:00:51,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:00:51,856 INFO L87 Difference]: Start difference. First operand 2913 states and 11193 transitions. Second operand 6 states. [2020-10-22 02:00:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:52,093 INFO L93 Difference]: Finished difference Result 3347 states and 12801 transitions. [2020-10-22 02:00:52,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:00:52,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-22 02:00:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:52,109 INFO L225 Difference]: With dead ends: 3347 [2020-10-22 02:00:52,109 INFO L226 Difference]: Without dead ends: 3347 [2020-10-22 02:00:52,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:00:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2020-10-22 02:00:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3293. [2020-10-22 02:00:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2020-10-22 02:00:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 12585 transitions. [2020-10-22 02:00:52,214 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 12585 transitions. Word has length 14 [2020-10-22 02:00:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:52,214 INFO L481 AbstractCegarLoop]: Abstraction has 3293 states and 12585 transitions. [2020-10-22 02:00:52,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:00:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 12585 transitions. [2020-10-22 02:00:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:00:52,218 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:52,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:52,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:00:52,219 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1572195959, now seen corresponding path program 1 times [2020-10-22 02:00:52,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:52,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086234610] [2020-10-22 02:00:52,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:52,304 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 02:00:52,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086234610] [2020-10-22 02:00:52,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:52,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:00:52,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1395406194] [2020-10-22 02:00:52,305 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:52,307 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:52,312 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 44 transitions. [2020-10-22 02:00:52,312 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:52,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:00:52,717 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:00:52,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:00:52,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:52,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:00:52,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:00:52,719 INFO L87 Difference]: Start difference. First operand 3293 states and 12585 transitions. Second operand 4 states. [2020-10-22 02:00:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:52,776 INFO L93 Difference]: Finished difference Result 3316 states and 11559 transitions. [2020-10-22 02:00:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:00:52,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-22 02:00:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:52,787 INFO L225 Difference]: With dead ends: 3316 [2020-10-22 02:00:52,787 INFO L226 Difference]: Without dead ends: 2495 [2020-10-22 02:00:52,787 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 1 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 02:00:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2020-10-22 02:00:52,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2495. [2020-10-22 02:00:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2020-10-22 02:00:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 8595 transitions. [2020-10-22 02:00:52,949 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 8595 transitions. Word has length 14 [2020-10-22 02:00:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:52,949 INFO L481 AbstractCegarLoop]: Abstraction has 2495 states and 8595 transitions. [2020-10-22 02:00:52,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:00:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 8595 transitions. [2020-10-22 02:00:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:00:52,952 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:52,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:52,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:00:52,953 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:52,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:52,953 INFO L82 PathProgramCache]: Analyzing trace with hash 713638536, now seen corresponding path program 1 times [2020-10-22 02:00:52,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:52,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617745789] [2020-10-22 02:00:52,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:53,110 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 02:00:53,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617745789] [2020-10-22 02:00:53,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:53,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:00:53,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1054738492] [2020-10-22 02:00:53,111 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:53,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:53,121 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 47 transitions. [2020-10-22 02:00:53,122 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:53,451 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [71032#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:00:53,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:00:53,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:53,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:00:53,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:00:53,453 INFO L87 Difference]: Start difference. First operand 2495 states and 8595 transitions. Second operand 6 states. [2020-10-22 02:00:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:53,534 INFO L93 Difference]: Finished difference Result 2074 states and 6613 transitions. [2020-10-22 02:00:53,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:00:53,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 02:00:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:53,540 INFO L225 Difference]: With dead ends: 2074 [2020-10-22 02:00:53,540 INFO L226 Difference]: Without dead ends: 1583 [2020-10-22 02:00:53,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:00:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2020-10-22 02:00:53,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1419. [2020-10-22 02:00:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2020-10-22 02:00:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4381 transitions. [2020-10-22 02:00:53,584 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4381 transitions. Word has length 15 [2020-10-22 02:00:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:53,584 INFO L481 AbstractCegarLoop]: Abstraction has 1419 states and 4381 transitions. [2020-10-22 02:00:53,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:00:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4381 transitions. [2020-10-22 02:00:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:00:53,590 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:53,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:53,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:00:53,590 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:53,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:53,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1377884487, now seen corresponding path program 1 times [2020-10-22 02:00:53,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:53,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559709607] [2020-10-22 02:00:53,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:53,744 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 02:00:53,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559709607] [2020-10-22 02:00:53,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:53,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:00:53,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [83389557] [2020-10-22 02:00:53,745 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:53,749 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:53,766 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 141 transitions. [2020-10-22 02:00:53,766 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:54,884 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [75953#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:00:54,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:00:54,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:00:54,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:00:54,886 INFO L87 Difference]: Start difference. First operand 1419 states and 4381 transitions. Second operand 7 states. [2020-10-22 02:00:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:54,962 INFO L93 Difference]: Finished difference Result 1234 states and 3787 transitions. [2020-10-22 02:00:54,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:00:54,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 02:00:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:54,967 INFO L225 Difference]: With dead ends: 1234 [2020-10-22 02:00:54,968 INFO L226 Difference]: Without dead ends: 1095 [2020-10-22 02:00:54,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:00:54,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2020-10-22 02:00:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1007. [2020-10-22 02:00:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2020-10-22 02:00:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3145 transitions. [2020-10-22 02:00:54,992 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3145 transitions. Word has length 19 [2020-10-22 02:00:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:54,993 INFO L481 AbstractCegarLoop]: Abstraction has 1007 states and 3145 transitions. [2020-10-22 02:00:54,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:00:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3145 transitions. [2020-10-22 02:00:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 02:00:54,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:54,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:00:54,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:00:54,996 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:54,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:54,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1654709643, now seen corresponding path program 1 times [2020-10-22 02:00:54,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:54,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366795517] [2020-10-22 02:00:54,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:55,119 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 02:00:55,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366795517] [2020-10-22 02:00:55,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:55,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:00:55,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1755865774] [2020-10-22 02:00:55,121 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:55,125 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:55,269 INFO L252 McrAutomatonBuilder]: Finished intersection with 117 states and 247 transitions. [2020-10-22 02:00:55,269 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:57,342 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [79211#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:00:57,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:00:57,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:00:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:00:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:00:57,344 INFO L87 Difference]: Start difference. First operand 1007 states and 3145 transitions. Second operand 8 states. [2020-10-22 02:00:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:00:57,450 INFO L93 Difference]: Finished difference Result 975 states and 3079 transitions. [2020-10-22 02:00:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 02:00:57,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-22 02:00:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:00:57,454 INFO L225 Difference]: With dead ends: 975 [2020-10-22 02:00:57,455 INFO L226 Difference]: Without dead ends: 956 [2020-10-22 02:00:57,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:00:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2020-10-22 02:00:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 940. [2020-10-22 02:00:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2020-10-22 02:00:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 3003 transitions. [2020-10-22 02:00:57,477 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 3003 transitions. Word has length 23 [2020-10-22 02:00:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:00:57,480 INFO L481 AbstractCegarLoop]: Abstraction has 940 states and 3003 transitions. [2020-10-22 02:00:57,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:00:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 3003 transitions. [2020-10-22 02:00:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-22 02:00:57,483 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:00:57,483 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 02:00:57,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:00:57,484 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:00:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:00:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1459468934, now seen corresponding path program 1 times [2020-10-22 02:00:57,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:00:57,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364045742] [2020-10-22 02:00:57,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:00:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:00:57,569 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 02:00:57,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364045742] [2020-10-22 02:00:57,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:00:57,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:00:57,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [146176565] [2020-10-22 02:00:57,571 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:00:57,577 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:00:57,639 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 320 transitions. [2020-10-22 02:00:57,639 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:00:59,622 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 3 [2020-10-22 02:01:00,314 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:01:00,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:01:00,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:00,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:01:00,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:01:00,316 INFO L87 Difference]: Start difference. First operand 940 states and 3003 transitions. Second operand 4 states. [2020-10-22 02:01:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:00,343 INFO L93 Difference]: Finished difference Result 1242 states and 3910 transitions. [2020-10-22 02:01:00,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:01:00,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-22 02:01:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:00,348 INFO L225 Difference]: With dead ends: 1242 [2020-10-22 02:01:00,349 INFO L226 Difference]: Without dead ends: 492 [2020-10-22 02:01:00,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 123 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 02:01:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-10-22 02:01:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2020-10-22 02:01:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2020-10-22 02:01:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1435 transitions. [2020-10-22 02:01:00,364 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1435 transitions. Word has length 27 [2020-10-22 02:01:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:00,364 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 1435 transitions. [2020-10-22 02:01:00,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:01:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1435 transitions. [2020-10-22 02:01:00,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-22 02:01:00,366 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:00,366 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 02:01:00,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:01:00,367 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:00,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:00,367 INFO L82 PathProgramCache]: Analyzing trace with hash 815207464, now seen corresponding path program 2 times [2020-10-22 02:01:00,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:00,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438825240] [2020-10-22 02:01:00,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:01:00,464 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 02:01:00,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438825240] [2020-10-22 02:01:00,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:01:00,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:01:00,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [907653089] [2020-10-22 02:01:00,466 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:01:00,471 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:01:00,527 INFO L252 McrAutomatonBuilder]: Finished intersection with 109 states and 216 transitions. [2020-10-22 02:01:00,527 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:01:02,302 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 4 [2020-10-22 02:01:02,466 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [84306#(or (not (= ~z~0 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))] [2020-10-22 02:01:02,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:01:02,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:02,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:01:02,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:01:02,468 INFO L87 Difference]: Start difference. First operand 492 states and 1435 transitions. Second operand 6 states. [2020-10-22 02:01:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:02,636 INFO L93 Difference]: Finished difference Result 970 states and 2860 transitions. [2020-10-22 02:01:02,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:01:02,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-22 02:01:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:02,639 INFO L225 Difference]: With dead ends: 970 [2020-10-22 02:01:02,639 INFO L226 Difference]: Without dead ends: 432 [2020-10-22 02:01:02,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:01:02,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-10-22 02:01:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 332. [2020-10-22 02:01:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-10-22 02:01:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 907 transitions. [2020-10-22 02:01:02,652 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 907 transitions. Word has length 27 [2020-10-22 02:01:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:02,652 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 907 transitions. [2020-10-22 02:01:02,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:01:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 907 transitions. [2020-10-22 02:01:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-22 02:01:02,654 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:02,654 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 02:01:02,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 02:01:02,655 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash -851335184, now seen corresponding path program 3 times [2020-10-22 02:01:02,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:02,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096829802] [2020-10-22 02:01:02,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:01:03,148 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 02:01:03,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096829802] [2020-10-22 02:01:03,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:01:03,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 02:01:03,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [292575904] [2020-10-22 02:01:03,150 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:01:03,155 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:01:03,185 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 168 transitions. [2020-10-22 02:01:03,185 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:01:03,682 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 139 [2020-10-22 02:01:03,698 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:03,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:03,700 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:03,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:03,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:03,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:03,714 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:03,720 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:03,725 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:03,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:03,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:03,746 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:03,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:03,754 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:03,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:03,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:03,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:03,773 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:03,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:03,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:03,789 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:03,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:03,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:03,804 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:03,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:03,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:03,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:03,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:03,825 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:03,826 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:01:03,833 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:03,849 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:03,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:03,855 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:03,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:03,864 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:03,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:03,876 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:03,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:03,886 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 6 conjuncts [2020-10-22 02:01:03,892 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 7 conjuncts [2020-10-22 02:01:03,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:03,910 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:03,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:03,940 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:03,953 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:03,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:03,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:03,971 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:01:03,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:03,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:04,009 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:04,021 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:04,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,036 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:04,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,232 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2020-10-22 02:01:04,236 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 4, 2, 3, 2, 1] term [2020-10-22 02:01:04,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,238 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-10-22 02:01:04,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,241 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:01:04,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,242 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:04,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:04,244 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:04,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,268 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:04,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,304 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 02:01:04,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,603 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2020-10-22 02:01:04,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-10-22 02:01:04,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,614 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-10-22 02:01:04,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,617 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:01:04,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:04,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:04,620 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:04,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,645 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:04,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,680 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 02:01:04,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,915 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 22 [2020-10-22 02:01:04,942 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:01:04,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,947 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:04,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:04,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:04,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:04,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:04,969 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:04,974 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:04,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:04,979 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:04,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:04,991 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:04,995 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:01:04,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:05,172 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2020-10-22 02:01:05,290 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 32 [2020-10-22 02:01:05,455 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 26 [2020-10-22 02:01:05,821 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 102 [2020-10-22 02:01:05,829 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:05,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:05,831 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:05,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:05,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:05,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:05,836 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:05,841 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:05,842 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:05,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:05,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:05,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:05,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:05,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:05,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:05,876 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:05,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:05,918 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:01:05,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:06,047 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2020-10-22 02:01:06,157 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2020-10-22 02:01:06,346 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:06,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,348 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:06,349 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,351 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:06,360 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:06,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,371 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:06,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,385 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:06,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,394 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:06,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,412 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:06,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,428 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:06,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,447 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 5 conjuncts [2020-10-22 02:01:06,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,461 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:01:06,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,519 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:01:06,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:06,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:06,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:06,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:06,552 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:01:06,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:06,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,572 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:06,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,584 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:01:06,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:06,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,587 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:06,598 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 7 conjuncts [2020-10-22 02:01:06,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:06,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,602 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:06,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 7 conjuncts [2020-10-22 02:01:06,615 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:01:06,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,648 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:06,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,662 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:06,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:06,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:06,678 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:06,687 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 02:01:06,688 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:06,695 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:01:06,703 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:06,719 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:06,733 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:06,742 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 02:01:06,742 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:06,744 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 02:01:06,745 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 02:01:06,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:06,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,204 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2020-10-22 02:01:07,213 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:07,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,214 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:07,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,217 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:07,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:07,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:07,230 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:07,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:07,247 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:07,252 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:07,260 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:07,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:07,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:07,269 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:07,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:07,280 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:07,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:07,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:07,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:07,293 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:07,293 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:07,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:07,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:07,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:07,316 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:07,332 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:07,335 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:01:07,340 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:07,358 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 02:01:07,367 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:07,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:07,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,397 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:07,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:07,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:07,417 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:07,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:07,426 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:07,429 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:01:07,434 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:07,446 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:07,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:07,458 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 5 conjuncts [2020-10-22 02:01:07,459 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:01:07,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:07,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:07,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:07,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:07,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:07,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:07,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:07,498 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:07,508 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 5 conjuncts [2020-10-22 02:01:07,517 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:07,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:07,532 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:07,550 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:07,551 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:07,552 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 2 conjuncts [2020-10-22 02:01:07,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:07,789 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 32 [2020-10-22 02:01:08,167 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 110 [2020-10-22 02:01:08,179 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:01:08,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,189 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:08,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:08,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,199 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:08,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:08,206 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:08,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:08,223 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:08,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,237 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:08,248 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 02:01:08,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:08,258 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:08,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:08,279 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:08,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 7 conjuncts [2020-10-22 02:01:08,300 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:01:08,307 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:08,325 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:08,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,334 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:08,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:08,344 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:08,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,357 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,363 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,363 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,364 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:08,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,374 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:08,374 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:01:08,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,376 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:08,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,390 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 02:01:08,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:08,409 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:08,418 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:01:08,509 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:08,521 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:08,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,933 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 110 [2020-10-22 02:01:08,940 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:01:08,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,949 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:08,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,955 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:08,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:08,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,969 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:08,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:08,989 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:08,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:08,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,002 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:09,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,018 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 5 conjuncts [2020-10-22 02:01:09,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:09,021 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,042 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,057 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:01:09,061 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,069 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:09,080 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 5 conjuncts [2020-10-22 02:01:09,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:09,083 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,103 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,120 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:01:09,124 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,132 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:09,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:09,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,144 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:01:09,148 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,156 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:09,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:09,166 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 02:01:09,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:09,167 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:09,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,184 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:09,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,534 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 110 [2020-10-22 02:01:09,543 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:01:09,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,553 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:09,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:09,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,566 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:09,574 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:09,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,581 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:09,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,590 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,610 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:01:09,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,615 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,631 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,636 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:01:09,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,664 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,676 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:09,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:09,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,687 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:09,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,704 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,716 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 02:01:09,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:09,721 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 7 conjuncts [2020-10-22 02:01:09,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:09,723 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:09,743 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,764 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,779 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:01:09,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,806 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:09,821 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:01:09,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:09,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:09,859 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:09,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:01:09,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,879 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:09,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,906 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:09,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,908 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:09,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,909 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:09,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,919 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:09,924 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:09,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:09,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,928 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:09,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:09,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:09,947 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:09,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:09,956 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 02:01:09,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:10,123 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2020-10-22 02:01:10,197 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:10,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,198 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:10,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,206 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:10,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,209 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:10,209 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:10,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:10,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,229 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:10,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:10,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,245 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:10,250 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:10,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:10,525 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2020-10-22 02:01:10,724 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2020-10-22 02:01:10,731 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:10,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,733 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:10,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,734 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:10,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,746 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:10,754 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:10,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:10,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,760 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:10,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:10,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,788 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:10,797 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:10,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:10,939 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:10,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,941 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:10,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,944 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:01:10,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:10,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,949 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:10,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,964 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:10,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:10,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:10,988 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:10,993 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:10,994 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:10,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:11,012 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:11,018 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:11,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:11,149 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:01:11,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:11,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:11,154 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:11,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:11,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:11,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:11,175 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:01:11,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:11,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:11,230 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:11,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:11,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,361 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:11,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:11,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,664 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:11,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:11,824 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:11,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:11,826 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:11,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:11,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:11,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:11,837 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:11,843 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:11,848 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:11,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:11,865 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:11,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:11,874 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:11,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:11,882 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:11,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:11,907 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:11,915 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:11,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:12,092 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-10-22 02:01:12,210 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2020-10-22 02:01:12,332 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2020-10-22 02:01:12,472 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2020-10-22 02:01:12,479 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:01:12,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:12,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:12,482 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:12,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:12,494 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:12,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:12,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,552 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:12,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,563 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:01:12,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,624 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:12,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,632 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:01:12,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:12,702 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:12,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:12,866 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 36 [2020-10-22 02:01:13,079 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2020-10-22 02:01:13,275 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 104 [2020-10-22 02:01:13,281 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:13,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:13,282 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:13,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:13,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:13,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:13,290 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:13,292 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:13,293 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:13,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:13,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:13,306 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:13,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:13,312 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:13,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:13,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:13,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:13,319 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:13,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:13,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:13,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:13,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:13,336 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:13,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:13,769 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 36 [2020-10-22 02:01:13,902 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-10-22 02:01:14,358 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2020-10-22 02:01:14,370 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:14,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:14,372 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:14,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:14,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:14,374 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:14,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:14,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:14,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:14,382 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:14,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:14,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:14,394 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:14,396 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:14,399 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:14,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:14,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:14,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:14,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:14,419 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:14,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:14,434 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-22 02:01:14,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:14,741 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 36 [2020-10-22 02:01:14,896 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [85959#(and (or (and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0)) (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd4~0 256) 0)))) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 85961#(and (or (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))) (and (<= ~x$w_buff0_used~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)))) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd4~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 85960#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (or (and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0)) (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))) (and (not (= (mod ~x$w_buff0_used~0 256) 0)) (not (= (mod ~x$r_buff0_thd4~0 256) 0))))), 85962#(or (not (= (mod ~x$w_buff0_used~0 256) 0)) (and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$r_buff0_thd4~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= 0 ~x$w_buff0~0)))] [2020-10-22 02:01:14,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-22 02:01:14,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:14,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-22 02:01:14,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-22 02:01:14,897 INFO L87 Difference]: Start difference. First operand 332 states and 907 transitions. Second operand 13 states. [2020-10-22 02:01:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:15,222 INFO L93 Difference]: Finished difference Result 464 states and 1262 transitions. [2020-10-22 02:01:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 02:01:15,223 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-22 02:01:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:15,226 INFO L225 Difference]: With dead ends: 464 [2020-10-22 02:01:15,226 INFO L226 Difference]: Without dead ends: 332 [2020-10-22 02:01:15,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 18 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-22 02:01:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-10-22 02:01:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 256. [2020-10-22 02:01:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-10-22 02:01:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 683 transitions. [2020-10-22 02:01:15,233 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 683 transitions. Word has length 27 [2020-10-22 02:01:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:15,233 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 683 transitions. [2020-10-22 02:01:15,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-22 02:01:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 683 transitions. [2020-10-22 02:01:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-22 02:01:15,236 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:15,236 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 02:01:15,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 02:01:15,236 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:15,237 INFO L82 PathProgramCache]: Analyzing trace with hash 672342000, now seen corresponding path program 4 times [2020-10-22 02:01:15,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:15,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37877890] [2020-10-22 02:01:15,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:01:15,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:01:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:01:15,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:01:15,489 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:01:15,489 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:01:15,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 02:01:15,490 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:01:15,509 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L2-->L866: Formula: (let ((.cse6 (= (mod ~x$w_buff1_used~0_In1572661098 256) 0)) (.cse7 (= (mod ~x$r_buff1_thd0~0_In1572661098 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In1572661098 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In1572661098 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= ~x$r_buff1_thd0~0_Out1572661098 ~x$r_buff1_thd0~0_In1572661098) (= ~x$r_buff0_thd0~0_In1572661098 ~x$r_buff0_thd0~0_Out1572661098) (or (and (= ~x$w_buff0~0_In1572661098 ~x~0_Out1572661098) .cse0 .cse1) (and .cse2 (or (and .cse3 (= ~x~0_In1572661098 ~x~0_Out1572661098)) (and .cse4 .cse5 (= ~x$w_buff1~0_In1572661098 ~x~0_Out1572661098))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In1572661098| ULTIMATE.start_assume_abort_if_not_~cond_Out1572661098) (or (and (= ~x$w_buff0_used~0_Out1572661098 0) .cse0 .cse1) (and .cse2 (= ~x$w_buff0_used~0_Out1572661098 ~x$w_buff0_used~0_In1572661098))) (or (and (= ~x$w_buff1_used~0_Out1572661098 0) .cse4 .cse5) (and (= ~x$w_buff1_used~0_In1572661098 ~x$w_buff1_used~0_Out1572661098) .cse3)) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out1572661098))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1572661098, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1572661098, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1572661098|, ~x$w_buff1~0=~x$w_buff1~0_In1572661098, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1572661098, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1572661098, ~x~0=~x~0_In1572661098, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1572661098} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1572661098, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1572661098, ~x$w_buff1~0=~x$w_buff1~0_In1572661098, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1572661098|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1572661098, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1572661098|, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1572661098|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1572661098|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1572661098, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1572661098|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1572661098, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1572661098|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1572661098|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1572661098, ~x~0=~x~0_Out1572661098} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~x$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2020-10-22 02:01:15,522 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 02:01:15,523 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [769] [2020-10-22 02:01:15,525 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 02:01:15,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,525 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 02:01:15,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,525 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 02:01:15,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,526 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 02:01:15,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,526 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 02:01:15,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,528 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 02:01:15,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,528 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 02:01:15,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,528 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 02:01:15,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,529 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 02:01:15,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,529 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 02:01:15,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,529 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 02:01:15,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,530 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 02:01:15,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,530 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 02:01:15,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,531 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 02:01:15,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,531 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 02:01:15,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,531 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 02:01:15,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,532 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 02:01:15,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,536 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 02:01:15,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,536 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 02:01:15,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,537 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 02:01:15,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,537 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 02:01:15,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,538 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 02:01:15,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,538 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 02:01:15,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,539 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 02:01:15,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,539 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 02:01:15,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,539 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 02:01:15,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,540 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 02:01:15,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,540 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 02:01:15,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,540 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 02:01:15,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,540 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 02:01:15,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,541 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 02:01:15,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,541 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 02:01:15,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,541 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 02:01:15,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:15,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:01:15 BasicIcfg [2020-10-22 02:01:15,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:01:15,642 INFO L168 Benchmark]: Toolchain (without parser) took 41684.15 ms. Allocated memory was 147.3 MB in the beginning and 685.2 MB in the end (delta: 537.9 MB). Free memory was 101.7 MB in the beginning and 88.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 550.8 MB. Max. memory is 7.1 GB. [2020-10-22 02:01:15,643 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 147.3 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 02:01:15,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 837.84 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 100.9 MB in the beginning and 153.4 MB in the end (delta: -52.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:01:15,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.11 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 150.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-22 02:01:15,645 INFO L168 Benchmark]: Boogie Preprocessor took 45.72 ms. Allocated memory is still 203.9 MB. Free memory was 150.1 MB in the beginning and 147.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:01:15,646 INFO L168 Benchmark]: RCFGBuilder took 2382.35 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 147.4 MB in the beginning and 124.9 MB in the end (delta: 22.5 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. [2020-10-22 02:01:15,646 INFO L168 Benchmark]: TraceAbstraction took 38340.84 ms. Allocated memory was 246.4 MB in the beginning and 685.2 MB in the end (delta: 438.8 MB). Free memory was 124.9 MB in the beginning and 88.8 MB in the end (delta: 36.1 MB). Peak memory consumption was 474.9 MB. Max. memory is 7.1 GB. [2020-10-22 02:01:15,650 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 147.3 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 837.84 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 100.9 MB in the beginning and 153.4 MB in the end (delta: -52.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.11 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 150.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.72 ms. Allocated memory is still 203.9 MB. Free memory was 150.1 MB in the beginning and 147.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2382.35 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 147.4 MB in the beginning and 124.9 MB in the end (delta: 22.5 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38340.84 ms. Allocated memory was 246.4 MB in the beginning and 685.2 MB in the end (delta: 438.8 MB). Free memory was 124.9 MB in the beginning and 88.8 MB in the end (delta: 36.1 MB). Peak memory consumption was 474.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1470 VarBasedMoverChecksPositive, 47 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 129 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.9s, 130 PlacesBefore, 46 PlacesAfterwards, 120 TransitionsBefore, 33 TransitionsAfterwards, 2896 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 101 TotalNumberOfCompositions, 8383 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_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t1379; [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L820] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L750] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L873] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L875] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L878] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix051_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 38.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.2s, HoareTripleCheckerStatistics: 472 SDtfs, 646 SDslu, 1059 SDs, 0 SdLazy, 480 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 545 GetRequests, 459 SyntacticMatches, 22 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4122occurred 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: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 1369 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 41494 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...