/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:04:07,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:04:07,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:04:07,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:04:07,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:04:07,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:04:07,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:04:07,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:04:07,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:04:07,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:04:07,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:04:07,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:04:07,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:04:07,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:04:07,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:04:07,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:04:07,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:04:07,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:04:07,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:04:07,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:04:07,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:04:07,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:04:07,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:04:07,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:04:07,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:04:07,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:04:07,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:04:07,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:04:07,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:04:07,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:04:07,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:04:07,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:04:07,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:04:07,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:04:07,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:04:07,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:04:07,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:04:07,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:04:07,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:04:07,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:04:07,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:04:07,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-21 22:04:07,493 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:04:07,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:04:07,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:04:07,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:04:07,498 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:04:07,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:04:07,498 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:04:07,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:04:07,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:04:07,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:04:07,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:04:07,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:04:07,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:04:07,501 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:04:07,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:04:07,501 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:04:07,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:04:07,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:04:07,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:04:07,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:04:07,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:04:07,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:04:07,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:04:07,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 22:04:07,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:04:07,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:04:07,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:04:07,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:04:07,504 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 22:04:07,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 22:04:07,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:04:07,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:04:07,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:04:07,848 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:04:07,848 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:04:07,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2020-10-21 22:04:07,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e26849b/d1111e03eb9a4743bed0ed9e94bd5019/FLAG158616205 [2020-10-21 22:04:08,487 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:04:08,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2020-10-21 22:04:08,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e26849b/d1111e03eb9a4743bed0ed9e94bd5019/FLAG158616205 [2020-10-21 22:04:08,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e26849b/d1111e03eb9a4743bed0ed9e94bd5019 [2020-10-21 22:04:08,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:04:08,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:04:08,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:04:08,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:04:08,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:04:08,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:04:08" (1/1) ... [2020-10-21 22:04:08,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7adc8642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:08, skipping insertion in model container [2020-10-21 22:04:08,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:04:08" (1/1) ... [2020-10-21 22:04:08,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:04:08,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:04:09,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:04:09,348 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:04:09,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:04:09,489 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:04:09,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:09 WrapperNode [2020-10-21 22:04:09,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:04:09,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:04:09,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:04:09,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:04:09,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:09" (1/1) ... [2020-10-21 22:04:09,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:09" (1/1) ... [2020-10-21 22:04:09,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:04:09,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:04:09,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:04:09,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:04:09,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:09" (1/1) ... [2020-10-21 22:04:09,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:09" (1/1) ... [2020-10-21 22:04:09,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:09" (1/1) ... [2020-10-21 22:04:09,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:09" (1/1) ... [2020-10-21 22:04:09,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:09" (1/1) ... [2020-10-21 22:04:09,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:09" (1/1) ... [2020-10-21 22:04:09,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:09" (1/1) ... [2020-10-21 22:04:09,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:04:09,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:04:09,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:04:09,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:04:09,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:09" (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-21 22:04:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:04:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:04:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:04:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:04:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:04:09,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:04:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:04:09,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:04:09,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:04:09,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:04:09,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:04:09,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:04:09,701 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 22:04:11,614 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:04:11,614 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:04:11,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:04:11 BoogieIcfgContainer [2020-10-21 22:04:11,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:04:11,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:04:11,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:04:11,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:04:11,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:04:08" (1/3) ... [2020-10-21 22:04:11,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2811354e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:04:11, skipping insertion in model container [2020-10-21 22:04:11,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:09" (2/3) ... [2020-10-21 22:04:11,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2811354e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:04:11, skipping insertion in model container [2020-10-21 22:04:11,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:04:11" (3/3) ... [2020-10-21 22:04:11,626 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2020-10-21 22:04:11,638 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:04:11,638 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:04:11,646 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:04:11,647 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:04:11,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,677 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,678 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,679 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,682 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,682 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,688 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,690 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,690 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,692 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,693 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:11,696 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:04:11,710 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-21 22:04:11,740 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:04:11,740 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:04:11,740 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 22:04:11,740 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:04:11,740 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:04:11,741 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:04:11,741 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:04:11,741 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:04:11,755 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 22:04:11,758 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-21 22:04:11,762 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-21 22:04:11,764 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2020-10-21 22:04:11,810 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-10-21 22:04:11,811 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:04:11,815 INFO L80 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 3/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-10-21 22:04:11,818 INFO L116 LiptonReduction]: Number of co-enabled transitions 1046 [2020-10-21 22:04:12,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:12,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:12,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:12,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:12,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:12,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:12,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:12,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:12,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:12,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:12,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:12,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:12,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:12,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:12,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:12,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:12,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:12,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:12,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:12,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:12,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:12,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:12,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:12,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:12,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:12,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:12,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:12,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:12,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:12,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:12,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:12,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,041 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 22:04:13,146 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-21 22:04:13,276 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 22:04:13,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:13,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:13,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:13,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:13,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:14,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:04:14,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:14,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:04:14,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 22:04:14,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:14,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:14,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:14,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:14,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:14,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:14,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 22:04:14,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:14,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:14,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:14,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:14,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:14,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:14,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:14,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:14,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:14,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:14,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:14,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:14,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:14,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:14,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:14,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:14,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:14,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:14,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:14,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:14,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:14,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:14,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:14,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:14,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:14,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:15,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:15,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:15,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:15,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:15,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:15,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:15,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:15,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:15,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:15,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:15,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:15,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:15,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:04:15,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:15,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:15,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:04:15,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 22:04:15,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:15,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,856 WARN L193 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2020-10-21 22:04:16,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-21 22:04:16,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:16,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:16,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:17,900 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 141 DAG size of output: 104 [2020-10-21 22:04:19,156 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 235 DAG size of output: 194 [2020-10-21 22:04:19,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-21 22:04:19,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:19,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:19,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:20,260 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 149 DAG size of output: 120 [2020-10-21 22:04:21,478 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2020-10-21 22:04:21,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-21 22:04:21,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:21,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 22:04:21,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,647 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 142 DAG size of output: 105 [2020-10-21 22:04:22,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:22,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:22,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:22,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:22,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:22,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:22,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:22,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:22,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:22,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 5, 2, 2, 1] term [2020-10-21 22:04:22,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-10-21 22:04:22,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 5, 3, 2, 1] term [2020-10-21 22:04:22,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 3, 5, 3, 2, 1] term [2020-10-21 22:04:22,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:22,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 2, 1] term [2020-10-21 22:04:22,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 2, 2, 1] term [2020-10-21 22:04:22,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:22,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:22,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-10-21 22:04:22,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:22,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:22,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-21 22:04:22,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:22,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-21 22:04:22,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:23,354 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-21 22:04:23,703 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-21 22:04:23,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 3, 5, 3, 2, 1] term [2020-10-21 22:04:23,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:23,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 2, 1] term [2020-10-21 22:04:23,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:23,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 5, 2, 2, 1] term [2020-10-21 22:04:23,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:23,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-10-21 22:04:23,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:23,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:23,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:23,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:23,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:23,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:23,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:23,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:23,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:23,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 5, 3, 2, 1] term [2020-10-21 22:04:23,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:23,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:23,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:23,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:23,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:24,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 2, 2, 1] term [2020-10-21 22:04:24,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:24,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:24,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:24,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:24,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:24,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:24,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:24,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:24,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:24,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:24,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:24,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-10-21 22:04:24,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:24,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:24,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:24,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:24,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:24,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-21 22:04:24,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:24,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-21 22:04:24,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:24,482 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-21 22:04:24,841 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-21 22:04:25,260 WARN L193 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-10-21 22:04:25,450 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-21 22:04:25,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-21 22:04:25,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:25,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-21 22:04:25,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:25,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 2, 2, 1] term [2020-10-21 22:04:25,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:25,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:25,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:25,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:25,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:25,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:25,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:25,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:25,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:25,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:25,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:25,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-10-21 22:04:25,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:25,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:25,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:25,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:25,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:25,576 INFO L131 LiptonReduction]: Checked pairs total: 2642 [2020-10-21 22:04:25,576 INFO L133 LiptonReduction]: Total number of compositions: 83 [2020-10-21 22:04:25,584 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-21 22:04:25,604 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 164 states. [2020-10-21 22:04:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-10-21 22:04:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-21 22:04:25,613 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:25,614 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-21 22:04:25,614 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:25,621 INFO L82 PathProgramCache]: Analyzing trace with hash 948624, now seen corresponding path program 1 times [2020-10-21 22:04:25,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:25,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401520847] [2020-10-21 22:04:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:25,866 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-21 22:04:25,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401520847] [2020-10-21 22:04:25,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:25,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:04:25,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012610664] [2020-10-21 22:04:25,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:04:25,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:25,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:04:25,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:25,896 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2020-10-21 22:04:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:25,973 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-21 22:04:25,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:25,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-21 22:04:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:25,988 INFO L225 Difference]: With dead ends: 137 [2020-10-21 22:04:25,989 INFO L226 Difference]: Without dead ends: 112 [2020-10-21 22:04:25,990 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-21 22:04:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-21 22:04:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-21 22:04:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-21 22:04:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-21 22:04:26,043 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 3 [2020-10-21 22:04:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:26,043 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-21 22:04:26,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:04:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-21 22:04:26,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 22:04:26,044 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:26,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:26,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 22:04:26,045 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:26,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:26,045 INFO L82 PathProgramCache]: Analyzing trace with hash -51811783, now seen corresponding path program 1 times [2020-10-21 22:04:26,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:26,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166884761] [2020-10-21 22:04:26,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:26,221 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-21 22:04:26,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166884761] [2020-10-21 22:04:26,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:26,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:04:26,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152682068] [2020-10-21 22:04:26,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:04:26,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:26,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:04:26,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:26,224 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-21 22:04:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:26,255 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-10-21 22:04:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:26,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 22:04:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:26,261 INFO L225 Difference]: With dead ends: 111 [2020-10-21 22:04:26,261 INFO L226 Difference]: Without dead ends: 111 [2020-10-21 22:04:26,262 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-21 22:04:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-21 22:04:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-21 22:04:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-21 22:04:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-10-21 22:04:26,289 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-10-21 22:04:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:26,289 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-10-21 22:04:26,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:04:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-10-21 22:04:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-21 22:04:26,290 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:26,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:26,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 22:04:26,293 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:26,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:26,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1592805591, now seen corresponding path program 1 times [2020-10-21 22:04:26,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:26,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276311119] [2020-10-21 22:04:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:26,371 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-21 22:04:26,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276311119] [2020-10-21 22:04:26,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:26,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:04:26,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027532868] [2020-10-21 22:04:26,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:04:26,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:26,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:04:26,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:04:26,374 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 4 states. [2020-10-21 22:04:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:26,438 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2020-10-21 22:04:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:04:26,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-21 22:04:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:26,441 INFO L225 Difference]: With dead ends: 107 [2020-10-21 22:04:26,441 INFO L226 Difference]: Without dead ends: 107 [2020-10-21 22:04:26,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-21 22:04:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-21 22:04:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-21 22:04:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2020-10-21 22:04:26,451 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 8 [2020-10-21 22:04:26,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:26,452 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2020-10-21 22:04:26,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:04:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2020-10-21 22:04:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-21 22:04:26,453 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:26,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:26,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 22:04:26,453 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1606197126, now seen corresponding path program 1 times [2020-10-21 22:04:26,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:26,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762279605] [2020-10-21 22:04:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:26,566 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-21 22:04:26,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762279605] [2020-10-21 22:04:26,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:26,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:04:26,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854339606] [2020-10-21 22:04:26,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:04:26,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:26,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:04:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:26,569 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand 3 states. [2020-10-21 22:04:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:26,613 INFO L93 Difference]: Finished difference Result 103 states and 230 transitions. [2020-10-21 22:04:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:26,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-21 22:04:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:26,616 INFO L225 Difference]: With dead ends: 103 [2020-10-21 22:04:26,616 INFO L226 Difference]: Without dead ends: 103 [2020-10-21 22:04:26,616 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-21 22:04:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-21 22:04:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-21 22:04:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-21 22:04:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 230 transitions. [2020-10-21 22:04:26,625 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 230 transitions. Word has length 8 [2020-10-21 22:04:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:26,625 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 230 transitions. [2020-10-21 22:04:26,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:04:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 230 transitions. [2020-10-21 22:04:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 22:04:26,627 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:26,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:26,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 22:04:26,627 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:26,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:26,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2132364918, now seen corresponding path program 1 times [2020-10-21 22:04:26,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:26,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687257901] [2020-10-21 22:04:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:26,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687257901] [2020-10-21 22:04:26,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:26,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:04:26,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196508933] [2020-10-21 22:04:26,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:04:26,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:26,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:04:26,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:26,914 INFO L87 Difference]: Start difference. First operand 103 states and 230 transitions. Second operand 5 states. [2020-10-21 22:04:27,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:27,009 INFO L93 Difference]: Finished difference Result 111 states and 244 transitions. [2020-10-21 22:04:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:04:27,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-21 22:04:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:27,012 INFO L225 Difference]: With dead ends: 111 [2020-10-21 22:04:27,013 INFO L226 Difference]: Without dead ends: 111 [2020-10-21 22:04:27,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-21 22:04:27,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-21 22:04:27,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-21 22:04:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 244 transitions. [2020-10-21 22:04:27,031 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 244 transitions. Word has length 9 [2020-10-21 22:04:27,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:27,032 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 244 transitions. [2020-10-21 22:04:27,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:04:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 244 transitions. [2020-10-21 22:04:27,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:04:27,039 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:27,039 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:27,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 22:04:27,039 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:27,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:27,040 INFO L82 PathProgramCache]: Analyzing trace with hash -505503669, now seen corresponding path program 1 times [2020-10-21 22:04:27,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:27,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228482661] [2020-10-21 22:04:27,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:27,353 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-21 22:04:27,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228482661] [2020-10-21 22:04:27,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:27,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:04:27,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575559876] [2020-10-21 22:04:27,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 22:04:27,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:27,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 22:04:27,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:04:27,358 INFO L87 Difference]: Start difference. First operand 111 states and 244 transitions. Second operand 7 states. [2020-10-21 22:04:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:27,523 INFO L93 Difference]: Finished difference Result 131 states and 274 transitions. [2020-10-21 22:04:27,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:04:27,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-21 22:04:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:27,525 INFO L225 Difference]: With dead ends: 131 [2020-10-21 22:04:27,525 INFO L226 Difference]: Without dead ends: 113 [2020-10-21 22:04:27,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-21 22:04:27,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-21 22:04:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2020-10-21 22:04:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-21 22:04:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 202 transitions. [2020-10-21 22:04:27,534 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 202 transitions. Word has length 11 [2020-10-21 22:04:27,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:27,539 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 202 transitions. [2020-10-21 22:04:27,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 22:04:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 202 transitions. [2020-10-21 22:04:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:04:27,540 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:27,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:27,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 22:04:27,540 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:27,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:27,541 INFO L82 PathProgramCache]: Analyzing trace with hash -505718933, now seen corresponding path program 1 times [2020-10-21 22:04:27,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:27,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961034709] [2020-10-21 22:04:27,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:27,603 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-21 22:04:27,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961034709] [2020-10-21 22:04:27,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:27,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:04:27,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004654791] [2020-10-21 22:04:27,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:04:27,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:27,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:04:27,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:27,605 INFO L87 Difference]: Start difference. First operand 95 states and 202 transitions. Second operand 3 states. [2020-10-21 22:04:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:27,619 INFO L93 Difference]: Finished difference Result 131 states and 271 transitions. [2020-10-21 22:04:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:27,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 22:04:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:27,621 INFO L225 Difference]: With dead ends: 131 [2020-10-21 22:04:27,621 INFO L226 Difference]: Without dead ends: 71 [2020-10-21 22:04:27,622 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-21 22:04:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-21 22:04:27,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-21 22:04:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-21 22:04:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 138 transitions. [2020-10-21 22:04:27,631 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 138 transitions. Word has length 11 [2020-10-21 22:04:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:27,631 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 138 transitions. [2020-10-21 22:04:27,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:04:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 138 transitions. [2020-10-21 22:04:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:04:27,633 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:27,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:27,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 22:04:27,633 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:27,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:27,634 INFO L82 PathProgramCache]: Analyzing trace with hash -548127863, now seen corresponding path program 2 times [2020-10-21 22:04:27,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:27,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993589989] [2020-10-21 22:04:27,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:27,769 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-21 22:04:27,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993589989] [2020-10-21 22:04:27,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:27,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:04:27,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250606240] [2020-10-21 22:04:27,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:04:27,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:27,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:04:27,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:04:27,772 INFO L87 Difference]: Start difference. First operand 71 states and 138 transitions. Second operand 4 states. [2020-10-21 22:04:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:27,813 INFO L93 Difference]: Finished difference Result 65 states and 107 transitions. [2020-10-21 22:04:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:04:27,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 22:04:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:27,814 INFO L225 Difference]: With dead ends: 65 [2020-10-21 22:04:27,814 INFO L226 Difference]: Without dead ends: 48 [2020-10-21 22:04:27,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-21 22:04:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-21 22:04:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-21 22:04:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 75 transitions. [2020-10-21 22:04:27,819 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 75 transitions. Word has length 11 [2020-10-21 22:04:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:27,819 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 75 transitions. [2020-10-21 22:04:27,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:04:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 75 transitions. [2020-10-21 22:04:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 22:04:27,821 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:27,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:27,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 22:04:27,821 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:27,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:27,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1087278397, now seen corresponding path program 1 times [2020-10-21 22:04:27,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:27,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679304081] [2020-10-21 22:04:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:27,904 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-21 22:04:27,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679304081] [2020-10-21 22:04:27,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:27,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:04:27,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809779016] [2020-10-21 22:04:27,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:04:27,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:27,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:04:27,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:27,906 INFO L87 Difference]: Start difference. First operand 48 states and 75 transitions. Second operand 5 states. [2020-10-21 22:04:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:27,945 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2020-10-21 22:04:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:04:27,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 22:04:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:27,946 INFO L225 Difference]: With dead ends: 39 [2020-10-21 22:04:27,946 INFO L226 Difference]: Without dead ends: 24 [2020-10-21 22:04:27,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-21 22:04:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-21 22:04:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-21 22:04:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-21 22:04:27,949 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2020-10-21 22:04:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:27,949 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-21 22:04:27,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:04:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-21 22:04:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 22:04:27,950 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:27,950 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:27,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 22:04:27,950 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:27,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:27,951 INFO L82 PathProgramCache]: Analyzing trace with hash -521387093, now seen corresponding path program 1 times [2020-10-21 22:04:27,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:27,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570216454] [2020-10-21 22:04:27,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:04:27,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:04:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:04:28,023 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:04:28,064 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 22:04:28,064 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 22:04:28,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 22:04:28,065 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 22:04:28,079 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L797-->L804: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In1226772523 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In1226772523 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In1226772523 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In1226772523 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out1226772523 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1226772523|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1226772523 0)) (= ~y$r_buff0_thd0~0_In1226772523 ~y$r_buff0_thd0~0_Out1226772523) (or (and (= ~y$w_buff0_used~0_Out1226772523 ~y$w_buff0_used~0_In1226772523) .cse0) (and .cse1 .cse2 (= ~y$w_buff0_used~0_Out1226772523 0))) (or (and .cse3 (= ~y$w_buff1_used~0_Out1226772523 ~y$w_buff1_used~0_In1226772523)) (and .cse4 (= ~y$w_buff1_used~0_Out1226772523 0) .cse5)) (= ~y$r_buff1_thd0~0_Out1226772523 ~y$r_buff1_thd0~0_In1226772523) (or (and .cse1 .cse2 (= ~y~0_Out1226772523 ~y$w_buff0~0_In1226772523)) (and .cse0 (or (and .cse3 (= ~y~0_Out1226772523 ~y~0_In1226772523)) (and (= ~y~0_Out1226772523 ~y$w_buff1~0_In1226772523) .cse4 .cse5))))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1226772523|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1226772523, ~y$w_buff1~0=~y$w_buff1~0_In1226772523, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1226772523, ~y$w_buff0~0=~y$w_buff0~0_In1226772523, ~y~0=~y~0_In1226772523, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1226772523, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1226772523} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1226772523, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1226772523|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1226772523|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1226772523|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1226772523|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1226772523|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1226772523|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1226772523|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1226772523, ~y$w_buff1~0=~y$w_buff1~0_In1226772523, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1226772523, ~y$w_buff0~0=~y$w_buff0~0_In1226772523, ~y~0=~y~0_Out1226772523, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1226772523, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1226772523} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-21 22:04:28,086 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-21 22:04:28,086 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [733] [2020-10-21 22:04:28,092 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-21 22:04:28,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,093 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-21 22:04:28,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,093 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-21 22:04:28,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,093 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-21 22:04:28,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,094 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-21 22:04:28,094 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,095 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-21 22:04:28,095 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,095 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-21 22:04:28,096 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,096 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-21 22:04:28,096 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,096 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-21 22:04:28,096 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,097 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-21 22:04:28,097 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,097 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-21 22:04:28,097 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,098 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-21 22:04:28,098 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,099 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-21 22:04:28,099 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,099 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-21 22:04:28,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,100 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-21 22:04:28,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,100 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-21 22:04:28,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,100 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-21 22:04:28,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,101 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-21 22:04:28,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,101 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-21 22:04:28,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,107 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-21 22:04:28,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,107 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-21 22:04:28,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,108 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-21 22:04:28,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,108 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-21 22:04:28,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:28,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:04:28 BasicIcfg [2020-10-21 22:04:28,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 22:04:28,171 INFO L168 Benchmark]: Toolchain (without parser) took 19423.92 ms. Allocated memory was 138.4 MB in the beginning and 448.3 MB in the end (delta: 309.9 MB). Free memory was 98.8 MB in the beginning and 252.0 MB in the end (delta: -153.2 MB). Peak memory consumption was 156.6 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:28,172 INFO L168 Benchmark]: CDTParser took 3.35 ms. Allocated memory is still 138.4 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 22:04:28,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.49 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 97.7 MB in the beginning and 153.3 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:28,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.75 ms. Allocated memory is still 201.3 MB. Free memory was 153.3 MB in the beginning and 150.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:28,176 INFO L168 Benchmark]: Boogie Preprocessor took 52.35 ms. Allocated memory is still 201.3 MB. Free memory was 150.5 MB in the beginning and 147.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:28,177 INFO L168 Benchmark]: RCFGBuilder took 2005.05 ms. Allocated memory was 201.3 MB in the beginning and 250.6 MB in the end (delta: 49.3 MB). Free memory was 147.8 MB in the beginning and 198.5 MB in the end (delta: -50.7 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:28,178 INFO L168 Benchmark]: TraceAbstraction took 16550.29 ms. Allocated memory was 250.6 MB in the beginning and 448.3 MB in the end (delta: 197.7 MB). Free memory was 198.5 MB in the beginning and 252.0 MB in the end (delta: -53.5 MB). Peak memory consumption was 144.1 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:28,182 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.35 ms. Allocated memory is still 138.4 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 736.49 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 97.7 MB in the beginning and 153.3 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.75 ms. Allocated memory is still 201.3 MB. Free memory was 153.3 MB in the beginning and 150.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.35 ms. Allocated memory is still 201.3 MB. Free memory was 150.5 MB in the beginning and 147.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2005.05 ms. Allocated memory was 201.3 MB in the beginning and 250.6 MB in the end (delta: 49.3 MB). Free memory was 147.8 MB in the beginning and 198.5 MB in the end (delta: -50.7 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16550.29 ms. Allocated memory was 250.6 MB in the beginning and 448.3 MB in the end (delta: 197.7 MB). Free memory was 198.5 MB in the beginning and 252.0 MB in the end (delta: -53.5 MB). Peak memory consumption was 144.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 724 VarBasedMoverChecksPositive, 57 VarBasedMoverChecksNegative, 13 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 59 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 13.8s, 87 PlacesBefore, 26 PlacesAfterwards, 83 TransitionsBefore, 19 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 83 TotalNumberOfCompositions, 2642 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2481; [L791] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2482; [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe029_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.3s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.8s, HoareTripleCheckerStatistics: 128 SDtfs, 88 SDslu, 144 SDs, 0 SdLazy, 140 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 4935 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...